CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: algebraic structures</title> <meta name="description" content="Search results for: algebraic structures"> <meta name="keywords" content="algebraic structures"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="algebraic structures" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="algebraic structures"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 4294</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: algebraic structures</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4294</span> Exploring the Intersection of Categorification and Computation in Algebraic Combinatorial Structures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Gebreegziabher%20Hailu%20Gebrecherkos">Gebreegziabher Hailu Gebrecherkos</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study explores the intersection of categorification and computation within algebraic combinatorial structures, aiming to deepen the understanding of how categorical frameworks can enhance computational methods. We investigate the role of higher-dimensional categories in organizing and analyzing combinatorial data, revealing how these structures can lead to new computational techniques for solving complex problems in algebraic combinatory. By examining examples such as species, posets, and operads, we illustrate the transformative potential of categorification in generating new algorithms and optimizing existing ones. Our findings suggest that integrating categorical insights with computational approaches not only enriches the theoretical landscape but also provides practical tools for tackling intricate combinatorial challenges, ultimately paving the way for future research in both fields. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=categorification" title="categorification">categorification</a>, <a href="https://publications.waset.org/abstracts/search?q=computation" title=" computation"> computation</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20structures" title=" algebraic structures"> algebraic structures</a>, <a href="https://publications.waset.org/abstracts/search?q=combinatorics" title=" combinatorics"> combinatorics</a> </p> <a href="https://publications.waset.org/abstracts/192299/exploring-the-intersection-of-categorification-and-computation-in-algebraic-combinatorial-structures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192299.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">14</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4293</span> A Study of Algebraic Structure Involving Banach Space through Q-Analogue</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdul%20Hakim%20Khan">Abdul Hakim Khan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The aim of the present paper is to study the Banach Space and Combinatorial Algebraic Structure of R. It is further aimed to study algebraic structure of set of all q-extension of classical formula and function for 0 < q < 1. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=integral%20functions" title="integral functions">integral functions</a>, <a href="https://publications.waset.org/abstracts/search?q=q-extensions" title=" q-extensions"> q-extensions</a>, <a href="https://publications.waset.org/abstracts/search?q=q%20numbers%20of%20metric%20space" title=" q numbers of metric space"> q numbers of metric space</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20structure%20of%20r%20and%20banach%20space" title=" algebraic structure of r and banach space"> algebraic structure of r and banach space</a> </p> <a href="https://publications.waset.org/abstracts/74305/a-study-of-algebraic-structure-involving-banach-space-through-q-analogue" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/74305.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">580</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4292</span> Generalized π-Armendariz Authentication Cryptosystem</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Areej%20M.%20Abduldaim">Areej M. Abduldaim</a>, <a href="https://publications.waset.org/abstracts/search?q=Nadia%20M.%20G.%20Al-Saidi"> Nadia M. G. Al-Saidi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Algebra is one of the important fields of mathematics. It concerns with the study and manipulation of mathematical symbols. It also concerns with the study of abstractions such as groups, rings, and fields. Due to the development of these abstractions, it is extended to consider other structures, such as vectors, matrices, and polynomials, which are non-numerical objects. Computer algebra is the implementation of algebraic methods as algorithms and computer programs. Recently, many algebraic cryptosystem protocols are based on non-commutative algebraic structures, such as authentication, key exchange, and encryption-decryption processes are adopted. Cryptography is the science that aimed at sending the information through public channels in such a way that only an authorized recipient can read it. Ring theory is the most attractive category of algebra in the area of cryptography. In this paper, we employ the algebraic structure called skew -Armendariz rings to design a neoteric algorithm for zero knowledge proof. The proposed protocol is established and illustrated through numerical example, and its soundness and completeness are proved. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cryptosystem" title="cryptosystem">cryptosystem</a>, <a href="https://publications.waset.org/abstracts/search?q=identification" title=" identification"> identification</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20%CF%80-Armendariz%20rings" title=" skew π-Armendariz rings"> skew π-Armendariz rings</a>, <a href="https://publications.waset.org/abstracts/search?q=skew%20polynomial%20rings" title=" skew polynomial rings"> skew polynomial rings</a>, <a href="https://publications.waset.org/abstracts/search?q=zero%20knowledge%20protocol" title=" zero knowledge protocol"> zero knowledge protocol</a> </p> <a href="https://publications.waset.org/abstracts/75349/generalized-p-armendariz-authentication-cryptosystem" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/75349.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">217</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4291</span> Algebraic Characterization of Sheaves over Boolean Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=U.%20M.%20Swamy">U. M. Swamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A compact Hausdorff and totally disconnected topological space are known as Boolean space in view of the stone duality between Boolean algebras and such topological spaces. A sheaf over X is a triple (S, p, X) where S and X are topological spaces and p is a local homeomorphism of S onto X (that is, for each element s in S, there exist open sets U and G containing s and p(s) in S and X respectively such that the restriction of p to U is a homeomorphism of U onto G). Here we mainly concern on sheaves over Boolean spaces. From a given sheaf over a Boolean space, we obtain an algebraic structure in such a way that there is a one-to-one correspondence between these algebraic structures and sheaves over Boolean spaces. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Boolean%20algebra" title="Boolean algebra">Boolean algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=Boolean%20space" title=" Boolean space"> Boolean space</a>, <a href="https://publications.waset.org/abstracts/search?q=sheaf" title=" sheaf"> sheaf</a>, <a href="https://publications.waset.org/abstracts/search?q=stone%20duality" title=" stone duality"> stone duality</a> </p> <a href="https://publications.waset.org/abstracts/124439/algebraic-characterization-of-sheaves-over-boolean-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/124439.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">349</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4290</span> Serious Digital Video Game for Solving Algebraic Equations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Liliana%20O.%20Mart%C3%ADnez">Liliana O. Martínez</a>, <a href="https://publications.waset.org/abstracts/search?q=Juan%20E%20Gonz%C3%A1lez"> Juan E González</a>, <a href="https://publications.waset.org/abstracts/search?q=Manuel%20Ram%C3%ADrez-Aranda"> Manuel Ramírez-Aranda</a>, <a href="https://publications.waset.org/abstracts/search?q=Ana%20Cervantes-Herrera"> Ana Cervantes-Herrera</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A serious game category mobile application called Math Dominoes is presented. The main objective of this applications is to strengthen the teaching-learning process of solving algebraic equations and is based on the board game "Double 6" dominoes. Math Dominoes allows the practice of solving first, second-, and third-degree algebraic equations. This application is aimed to students who seek to strengthen their skills in solving algebraic equations in a dynamic, interactive, and fun way, to reduce the risk of failure in subsequent courses that require mastery of this algebraic tool. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algebra" title="algebra">algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=equations" title=" equations"> equations</a>, <a href="https://publications.waset.org/abstracts/search?q=dominoes" title=" dominoes"> dominoes</a>, <a href="https://publications.waset.org/abstracts/search?q=serious%20games" title=" serious games"> serious games</a> </p> <a href="https://publications.waset.org/abstracts/156059/serious-digital-video-game-for-solving-algebraic-equations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/156059.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">130</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4289</span> Symmetry Properties of Linear Algebraic Systems with Non-Canonical Scalar Multiplication</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Krish%20Jhurani">Krish Jhurani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The research paper presents an in-depth analysis of symmetry properties in linear algebraic systems under the operation of non-canonical scalar multiplication structures, specifically semirings, and near-rings. The objective is to unveil the profound alterations that occur in traditional linear algebraic structures when we replace conventional field multiplication with these non-canonical operations. In the methodology, we first establish the theoretical foundations of non-canonical scalar multiplication, followed by a meticulous investigation into the resulting symmetry properties, focusing on eigenvectors, eigenspaces, and invariant subspaces. The methodology involves a combination of rigorous mathematical proofs and derivations, supplemented by illustrative examples that exhibit these discovered symmetry properties in tangible mathematical scenarios. The core findings uncover unique symmetry attributes. For linear algebraic systems with semiring scalar multiplication, we reveal eigenvectors and eigenvalues. Systems operating under near-ring scalar multiplication disclose unique invariant subspaces. These discoveries drastically broaden the traditional landscape of symmetry properties in linear algebraic systems. With the application of these findings, potential practical implications span across various fields such as physics, coding theory, and cryptography. They could enhance error detection and correction codes, devise more secure cryptographic algorithms, and even influence theoretical physics. This expansion of applicability accentuates the significance of the presented research. The research paper thus contributes to the mathematical community by bringing forth perspectives on linear algebraic systems and their symmetry properties through the lens of non-canonical scalar multiplication, coupled with an exploration of practical applications. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=eigenspaces" title="eigenspaces">eigenspaces</a>, <a href="https://publications.waset.org/abstracts/search?q=eigenvectors" title=" eigenvectors"> eigenvectors</a>, <a href="https://publications.waset.org/abstracts/search?q=invariant%20subspaces" title=" invariant subspaces"> invariant subspaces</a>, <a href="https://publications.waset.org/abstracts/search?q=near-rings" title=" near-rings"> near-rings</a>, <a href="https://publications.waset.org/abstracts/search?q=non-canonical%20scalar%20multiplication" title=" non-canonical scalar multiplication"> non-canonical scalar multiplication</a>, <a href="https://publications.waset.org/abstracts/search?q=semirings" title=" semirings"> semirings</a>, <a href="https://publications.waset.org/abstracts/search?q=symmetry%20properties" title=" symmetry properties"> symmetry properties</a> </p> <a href="https://publications.waset.org/abstracts/167875/symmetry-properties-of-linear-algebraic-systems-with-non-canonical-scalar-multiplication" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167875.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">123</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4288</span> A Fundamental Functional Equation for Lie Algebras</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ih-Ching%20Hsu">Ih-Ching Hsu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Inspired by the so called Jacobi Identity (x y) z + (y z) x + (z x) y = 0, the following class of functional equations EQ I: F [F (x, y), z] + F [F (y, z), x] + F [F (z, x), y] = 0 is proposed, researched and generalized. Research methodologies begin with classical methods for functional equations, then evolve into discovering of any implicit algebraic structures. One of this paper’s major findings is that EQ I, under two additional conditions F (x, x) = 0 and F (x, y) + F (y, x) = 0, proves to be a fundamental functional equation for Lie Algebras. Existence of non-trivial solutions for EQ I can be proven by defining F (p, q) = [p q] = pq –qp, where p and q are quaternions, and pq is the quaternion product of p and q. EQ I can be generalized to the following class of functional equations EQ II: F [G (x, y), z] + F [G (y, z), x] + F [G (z, x), y] = 0. Concluding Statement: With a major finding proven, and non-trivial solutions derived, this research paper illustrates and provides a new functional equation scheme for studies in two major areas: (1) What underlying algebraic structures can be defined and/or derived from EQ I or EQ II? (2) What conditions can be imposed so that conditional general solutions to EQ I and EQ II can be found, investigated and applied? <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=fundamental%20functional%20equation" title="fundamental functional equation">fundamental functional equation</a>, <a href="https://publications.waset.org/abstracts/search?q=generalized%20functional%20equations" title=" generalized functional equations"> generalized functional equations</a>, <a href="https://publications.waset.org/abstracts/search?q=Lie%20algebras" title=" Lie algebras"> Lie algebras</a>, <a href="https://publications.waset.org/abstracts/search?q=quaternions" title=" quaternions"> quaternions</a> </p> <a href="https://publications.waset.org/abstracts/76600/a-fundamental-functional-equation-for-lie-algebras" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/76600.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">224</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4287</span> Virtual Reality Based 3D Video Games and Speech-Lip Synchronization Superseding Algebraic Code Excited Linear Prediction</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=P.%20S.%20Jagadeesh%20Kumar">P. S. Jagadeesh Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Meenakshi%20Sundaram"> S. Meenakshi Sundaram</a>, <a href="https://publications.waset.org/abstracts/search?q=Wenli%20Hu"> Wenli Hu</a>, <a href="https://publications.waset.org/abstracts/search?q=Yang%20Yung"> Yang Yung</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In 3D video games, the dominance of production is unceasingly growing with a protruding level of affordability in terms of budget. Afterward, the automation of speech-lip synchronization technique is customarily onerous and has advanced a critical research subject in virtual reality based 3D video games. This paper presents one of these automatic tools, precisely riveted on the synchronization of the speech and the lip movement of the game characters. A robust and precise speech recognition segment that systematized with Algebraic Code Excited Linear Prediction method is developed which unconventionally delivers lip sync results. The Algebraic Code Excited Linear Prediction algorithm is constructed on that used in code-excited linear prediction, but Algebraic Code Excited Linear Prediction codebooks have an explicit algebraic structure levied upon them. This affords a quicker substitute to the software enactments of lip sync algorithms and thus advances the superiority of service factors abridged production cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algebraic%20code%20excited%20linear%20prediction" title="algebraic code excited linear prediction">algebraic code excited linear prediction</a>, <a href="https://publications.waset.org/abstracts/search?q=speech-lip%20synchronization" title=" speech-lip synchronization"> speech-lip synchronization</a>, <a href="https://publications.waset.org/abstracts/search?q=video%20games" title=" video games"> video games</a>, <a href="https://publications.waset.org/abstracts/search?q=virtual%20reality" title=" virtual reality"> virtual reality</a> </p> <a href="https://publications.waset.org/abstracts/78585/virtual-reality-based-3d-video-games-and-speech-lip-synchronization-superseding-algebraic-code-excited-linear-prediction" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/78585.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">474</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4286</span> From Equations to Structures: Linking Abstract Algebra and High-School Algebra for Secondary School Teachers</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=J.%20Shamash">J. Shamash</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The high-school curriculum in algebra deals mainly with the solution of different types of equations. However, modern algebra has a completely different viewpoint and is concerned with algebraic structures and operations. A question then arises: What might be the relevance and contribution of an abstract algebra course for developing expertise and mathematical perspective in secondary school mathematics instruction? This is the focus of this paper. The course Algebra: From Equations to Structures is a carefully designed abstract algebra course for Israeli secondary school mathematics teachers. The course provides an introduction to algebraic structures and modern abstract algebra, and links abstract algebra to the high-school curriculum in algebra. It follows the historical attempts of mathematicians to solve polynomial equations of higher degrees, attempts which resulted in the development of group theory and field theory by Galois and Abel. In other words, algebraic structures grew out of a need to solve certain problems, and proved to be a much more fruitful way of viewing them. This theorems in both group theory and field theory. Along the historical ‘journey’, many other major results in algebra in the past 150 years are introduced, and recent directions that current research in algebra is taking are highlighted. This course is part of a unique master’s program – the Rothschild-Weizmann Program – offered by the Weizmann Institute of Science, especially designed for practicing Israeli secondary school teachers. A major component of the program comprises mathematical studies tailored for the students at the program. The rationale and structure of the course Algebra: From Equations to Structures are described, and its relevance to teaching school algebra is examined by analyzing three kinds of data sources. The first are position papers written by the participating teachers regarding the relevance of advanced mathematics studies to expertise in classroom instruction. The second data source are didactic materials designed by the participating teachers in which they connected the mathematics learned in the mathematics courses to the school curriculum and teaching. The third date source are final projects carried out by the teachers based on material learned in the course. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=abstract%20algebra" title="abstract algebra ">abstract algebra </a>, <a href="https://publications.waset.org/abstracts/search?q=linking%20abstract%20algebra%20and%20school%20mathematics" title=" linking abstract algebra and school mathematics"> linking abstract algebra and school mathematics</a>, <a href="https://publications.waset.org/abstracts/search?q=school%20algebra" title=" school algebra"> school algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=secondary%20school%20mathematics" title=" secondary school mathematics"> secondary school mathematics</a>, <a href="https://publications.waset.org/abstracts/search?q=teacher%20professional%20development" title=" teacher professional development"> teacher professional development</a> </p> <a href="https://publications.waset.org/abstracts/94997/from-equations-to-structures-linking-abstract-algebra-and-high-school-algebra-for-secondary-school-teachers" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94997.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">146</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4285</span> Incomplete Existing Algebra to Support Mathematical Computations</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ranjit%20Biswas">Ranjit Biswas</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The existing subject Algebra is incomplete to support mathematical computations being done by scientists of all areas: Mathematics, Physics, Statistics, Chemistry, Space Science, Cosmology etc. even starting from the era of great Einstein. A huge hidden gap in the subject ‘Algebra’ is unearthed. All the scientists today, including mathematicians, physicists, chemists, statisticians, cosmologists, space scientists, and economists, even starting from the great Einstein, are lucky that they got results without facing any contradictions or without facing computational errors. Most surprising is that the results of all scientists, including Nobel Prize winners, were proved by them by doing experiments too. But in this paper, it is rigorously justified that they all are lucky. An algebraist can define an infinite number of new algebraic structures. The objective of the work in this paper is not just for the sake of defining a distinct algebraic structure, but to recognize and identify a major gap of the subject ‘Algebra’ lying hidden so far in the existing vast literature of it. The objective of this work is to fix the unearthed gap. Consequently, a different algebraic structure called ‘Region’ has been introduced, and its properties are studied. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=region" title="region">region</a>, <a href="https://publications.waset.org/abstracts/search?q=ROR" title=" ROR"> ROR</a>, <a href="https://publications.waset.org/abstracts/search?q=RORR" title=" RORR"> RORR</a>, <a href="https://publications.waset.org/abstracts/search?q=region%20algebra" title=" region algebra"> region algebra</a> </p> <a href="https://publications.waset.org/abstracts/184965/incomplete-existing-algebra-to-support-mathematical-computations" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/184965.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">52</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4284</span> On Algebraic Structure of Improved Gauss-Seide Iteration</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=O.%20M.%20Bamigbola">O. M. Bamigbola</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20A.%20Ibrahim"> A. A. Ibrahim</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Analysis of real life problems often results in linear systems of equations for which solutions are sought. The method to employ depends, to some extent, on the properties of the coefficient matrix. It is not always feasible to solve linear systems of equations by direct methods, as such the need to use an iterative method becomes imperative. Before an iterative method can be employed to solve a linear system of equations there must be a guaranty that the process of solution will converge. This guaranty, which must be determined a priori, involve the use of some criterion expressible in terms of the entries of the coefficient matrix. It is, therefore, logical that the convergence criterion should depend implicitly on the algebraic structure of such a method. However, in deference to this view is the practice of conducting convergence analysis for Gauss-Seidel iteration on a criterion formulated based on the algebraic structure of Jacobi iteration. To remedy this anomaly, the Gauss-Seidel iteration was studied for its algebraic structure and contrary to the usual assumption, it was discovered that some property of the iteration matrix of Gauss-Seidel method is only diagonally dominant in its first row while the other rows do not satisfy diagonal dominance. With the aid of this structure we herein fashion out an improved version of Gauss-Seidel iteration with the prospect of enhancing convergence and robustness of the method. A numerical section is included to demonstrate the validity of the theoretical results obtained for the improved Gauss-Seidel method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=linear%20algebraic%20system" title="linear algebraic system">linear algebraic system</a>, <a href="https://publications.waset.org/abstracts/search?q=Gauss-Seidel%20iteration" title=" Gauss-Seidel iteration"> Gauss-Seidel iteration</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20structure" title=" algebraic structure"> algebraic structure</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a> </p> <a href="https://publications.waset.org/abstracts/15521/on-algebraic-structure-of-improved-gauss-seide-iteration" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15521.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">464</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4283</span> Parallel Asynchronous Multi-Splitting Methods for Differential Algebraic Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Malika%20Elkyal">Malika Elkyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider an iterative parallel multi-splitting method for differential algebraic equations. The main feature of the proposed idea is to use the asynchronous form. We prove that the multi-splitting technique can effectively accelerate the convergent performance of the iterative process. The main characteristic of an asynchronous mode is that the local algorithm does not have to wait at predetermined messages to become available. We allow some processors to communicate more frequently than others, and we allow the communication delays to be substantial and unpredictable. Accordingly, we note that synchronous algorithms in the computer science sense are particular cases of our formulation of asynchronous one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=parallel%20methods" title="parallel methods">parallel methods</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20mode" title=" asynchronous mode"> asynchronous mode</a>, <a href="https://publications.waset.org/abstracts/search?q=multisplitting" title=" multisplitting"> multisplitting</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20algebraic%20equations" title=" differential algebraic equations"> differential algebraic equations</a> </p> <a href="https://publications.waset.org/abstracts/20673/parallel-asynchronous-multi-splitting-methods-for-differential-algebraic-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/20673.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">558</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4282</span> Math Rally Proposal for the Teaching-Learning of Algebra</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Liliana%20O.%20Mart%C3%ADnez">Liliana O. Martínez</a>, <a href="https://publications.waset.org/abstracts/search?q=Juan%20E.%20Gonz%C3%A1lez"> Juan E. González</a>, <a href="https://publications.waset.org/abstracts/search?q=Manuel%20Ram%C3%ADrez-Aranda"> Manuel Ramírez-Aranda</a>, <a href="https://publications.waset.org/abstracts/search?q=Ana%20Cervantes-Herrera"> Ana Cervantes-Herrera</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this work, the use of a collection of mathematical challenges and puzzles aimed at students who are starting in algebra is proposed. The selected challenges and puzzles are intended to arouse students' interest in this area of mathematics, in addition to facilitating the teaching-learning process through challenges such as riddles, crossword puzzles, and board games, all in everyday situations that allow them to build themselves the learning. For this, it is proposed to carry out a "Math Rally: algebra" divided into four sections: mathematical reasoning, a hierarchy of operations, fractions, and algebraic equations. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algebra" title="algebra">algebra</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20challenge" title=" algebraic challenge"> algebraic challenge</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20puzzle" title=" algebraic puzzle"> algebraic puzzle</a>, <a href="https://publications.waset.org/abstracts/search?q=math%20rally" title=" math rally"> math rally</a> </p> <a href="https://publications.waset.org/abstracts/156056/math-rally-proposal-for-the-teaching-learning-of-algebra" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/156056.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">171</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4281</span> On the Cyclic Property of Groups of Prime Order</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ying%20Yi%20Wu">Ying Yi Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study of finite groups is a central topic in algebraic structures, and one of the most fundamental questions in this field is the classification of finite groups up to isomorphism. In this paper, we investigate the cyclic property of groups of prime order, which is a crucial result in the classification of finite abelian groups. We prove the following statement: If p is a prime, then every group G of order p is cyclic. Our proof utilizes the properties of group actions and the class equation, which provide a powerful tool for studying the structure of finite groups. In particular, we first show that any non-identity element of G generates a cyclic subgroup of G. Then, we establish the existence of an element of order p, which implies that G is generated by a single element. Finally, we demonstrate that any two generators of G are conjugate, which shows that G is a cyclic group. Our result has significant implications in the classification of finite groups, as it implies that any group of prime order is isomorphic to the cyclic group of the same order. Moreover, it provides a useful tool for understanding the structure of more complicated finite groups, as any finite abelian group can be decomposed into a direct product of cyclic groups. Our proof technique can also be extended to other areas of group theory, such as the classification of finite p-groups, where p is a prime. Therefore, our work has implications beyond the specific result we prove and can contribute to further research in algebraic structures. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=group%20theory" title="group theory">group theory</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20groups" title=" finite groups"> finite groups</a>, <a href="https://publications.waset.org/abstracts/search?q=cyclic%20groups" title=" cyclic groups"> cyclic groups</a>, <a href="https://publications.waset.org/abstracts/search?q=prime%20order" title=" prime order"> prime order</a>, <a href="https://publications.waset.org/abstracts/search?q=classification." title=" classification."> classification.</a> </p> <a href="https://publications.waset.org/abstracts/163778/on-the-cyclic-property-of-groups-of-prime-order" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163778.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">84</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4280</span> Identification of Configuration Space Singularities with Local Real Algebraic Geometry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marc%20Diesse">Marc Diesse</a>, <a href="https://publications.waset.org/abstracts/search?q=Hochschule%20Heilbronn"> Hochschule Heilbronn</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We address the question of identifying the configuration space singularities of linkages, i.e., points where the configuration space is not locally a submanifold of Euclidean space. Because the configuration space cannot be smoothly parameterized at such points, these singularity types have a significantly negative impact on the kinematics of the linkage. It is known that Jacobian methods do not provide sufficient conditions for the existence of CS-singularities. Herein, we present several additional algebraic criteria that provide the sufficient conditions. Further, we use those criteria to analyze certain classes of planar linkages. These examples will also show how the presented criteria can be checked using algorithmic methods. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=linkages" title="linkages">linkages</a>, <a href="https://publications.waset.org/abstracts/search?q=configuration%20space-singularities" title=" configuration space-singularities"> configuration space-singularities</a>, <a href="https://publications.waset.org/abstracts/search?q=real%20algebraic%20geometry" title=" real algebraic geometry"> real algebraic geometry</a>, <a href="https://publications.waset.org/abstracts/search?q=analytic%20geometry" title=" analytic geometry"> analytic geometry</a> </p> <a href="https://publications.waset.org/abstracts/112098/identification-of-configuration-space-singularities-with-local-real-algebraic-geometry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/112098.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">148</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4279</span> Proposal of Design Method in the Semi-Acausal System Model</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Shigeyuki%20Haruyama">Shigeyuki Haruyama</a>, <a href="https://publications.waset.org/abstracts/search?q=Ken%20Kaminishi"> Ken Kaminishi</a>, <a href="https://publications.waset.org/abstracts/search?q=Junji%20Kaneko"> Junji Kaneko</a>, <a href="https://publications.waset.org/abstracts/search?q=Tadayuki%20Kyoutani"> Tadayuki Kyoutani</a>, <a href="https://publications.waset.org/abstracts/search?q=Siti%20Ruhana%20Omar"> Siti Ruhana Omar</a>, <a href="https://publications.waset.org/abstracts/search?q=Oke%20Oktavianty"> Oke Oktavianty</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This study is used as a definition method to the value and function in manufacturing sector. In concurrence of discussion about present condition of modeling method, until now definition of 1D-CAE is ambiguity and not conceptual. Across all the physics fields, those methods are defined with the formulation of differential algebraic equation which only applied time derivation and simulation. At the same time, we propose semi-acausal modeling concept and differential algebraic equation method as a newly modeling method which the efficiency has been verified through the comparison of numerical analysis result between the semi-acausal modeling calculation and FEM theory calculation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=system%20model" title="system model">system model</a>, <a href="https://publications.waset.org/abstracts/search?q=physical%20models" title=" physical models"> physical models</a>, <a href="https://publications.waset.org/abstracts/search?q=empirical%20models" title=" empirical models"> empirical models</a>, <a href="https://publications.waset.org/abstracts/search?q=conservation%20law" title=" conservation law"> conservation law</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20algebraic%20equation" title=" differential algebraic equation"> differential algebraic equation</a>, <a href="https://publications.waset.org/abstracts/search?q=object-oriented" title=" object-oriented"> object-oriented</a> </p> <a href="https://publications.waset.org/abstracts/24516/proposal-of-design-method-in-the-semi-acausal-system-model" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24516.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">485</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4278</span> Some Properties in Jordan Ideal on 3-Prime Near-Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Abdelkarim%20Boua">Abdelkarim Boua</a>, <a href="https://publications.waset.org/abstracts/search?q=Abdelhakim%20Chillali"> Abdelhakim Chillali</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The study of non-associative structures in algebraic structures has become a separate entity; for, in the case of groups, their corresponding non-associative structure i.e. loops is dealt with separately. Similarly there is vast amount of research on the nonassociative structures of semigroups i.e. groupoids and that of rings i.e. nonassociative rings. However it is unfortunate that we do not have a parallel notions or study of non-associative near-rings. In this work we shall attempt to generalize a few known results and study the commutativity of Jordan ideal in 3-prime near-rings satisfying certain identities involving the Jordan ideal. We study the derivations satisfying certain differential identities on Jordan ideals of 3-prime near-rings. Moreover, we provide examples to show that hypothesis of our results are necessary. We give some new results and examples concerning the existence of Jordan ideal and derivations in near-rings. These near-rings can be used to build a new codes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=3-prime%20near-rings" title="3-prime near-rings">3-prime near-rings</a>, <a href="https://publications.waset.org/abstracts/search?q=near-rings" title=" near-rings"> near-rings</a>, <a href="https://publications.waset.org/abstracts/search?q=Jordan%20ideal" title=" Jordan ideal"> Jordan ideal</a>, <a href="https://publications.waset.org/abstracts/search?q=derivations" title=" derivations"> derivations</a> </p> <a href="https://publications.waset.org/abstracts/52456/some-properties-in-jordan-ideal-on-3-prime-near-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/52456.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">306</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4277</span> Graph Similarity: Algebraic Model and Its Application to Nonuniform Signal Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nileshkumar%20Vishnav">Nileshkumar Vishnav</a>, <a href="https://publications.waset.org/abstracts/search?q=Aditya%20Tatu"> Aditya Tatu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A recent approach of representing graph signals and graph filters as polynomials is useful for graph signal processing. In this approach, the adjacency matrix plays pivotal role; instead of the more common approach involving graph-Laplacian. In this work, we follow the adjacency matrix based approach and corresponding algebraic signal model. We further expand the theory and introduce the concept of similarity of two graphs. The similarity of graphs is useful in that key properties (such as filter-response, algebra related to graph) get transferred from one graph to another. We demonstrate potential applications of the relation between two similar graphs, such as nonuniform filter design, DTMF detection and signal reconstruction. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=graph%20signal%20processing" title="graph signal processing">graph signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20signal%20processing" title=" algebraic signal processing"> algebraic signal processing</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20similarity" title=" graph similarity"> graph similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=isospectral%20graphs" title=" isospectral graphs"> isospectral graphs</a>, <a href="https://publications.waset.org/abstracts/search?q=nonuniform%20signal%20processing" title=" nonuniform signal processing"> nonuniform signal processing</a> </p> <a href="https://publications.waset.org/abstracts/59404/graph-similarity-algebraic-model-and-its-application-to-nonuniform-signal-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59404.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">352</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4276</span> The Univalence Principle: Equivalent Mathematical Structures Are Indistinguishable</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michael%20Shulman">Michael Shulman</a>, <a href="https://publications.waset.org/abstracts/search?q=Paige%20North"> Paige North</a>, <a href="https://publications.waset.org/abstracts/search?q=Benedikt%20Ahrens"> Benedikt Ahrens</a>, <a href="https://publications.waset.org/abstracts/search?q=Dmitris%20Tsementzis"> Dmitris Tsementzis</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a non-algebraic and space-based style, as well as models of higher-order theories such as topological spaces. In particular, we formulate a general definition of indiscernibility for objects of any such structure, and a corresponding univalence condition that generalizes Rezk’s completeness condition for Segal spaces and ensures that all equivalences of structures are levelwise equivalences. Our work builds on Makkai’s First-Order Logic with Dependent Sorts, but is expressed in Voevodsky’s Univalent Foundations (UF), extending previous work on the Structure Identity Principle and univalent categories in UF. This enables indistinguishability to be expressed simply as identification, and yields a formal theory that is interpretable in classical homotopy theory, but also in other higher topos models. It follows that Univalent Foundations is a fully equivalence-invariant foundation for higher-categorical mathematics, as intended by Voevodsky. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=category%20theory" title="category theory">category theory</a>, <a href="https://publications.waset.org/abstracts/search?q=higher%20structures" title=" higher structures"> higher structures</a>, <a href="https://publications.waset.org/abstracts/search?q=inverse%20category" title=" inverse category"> inverse category</a>, <a href="https://publications.waset.org/abstracts/search?q=univalence" title=" univalence"> univalence</a> </p> <a href="https://publications.waset.org/abstracts/136379/the-univalence-principle-equivalent-mathematical-structures-are-indistinguishable" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/136379.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">151</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4275</span> Prime Graphs of Polynomials and Power Series Over Non-Commutative Rings</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Walaa%20Obaidallah%20Alqarafi">Walaa Obaidallah Alqarafi</a>, <a href="https://publications.waset.org/abstracts/search?q=Wafaa%20Mohammed%20Fakieh"> Wafaa Mohammed Fakieh</a>, <a href="https://publications.waset.org/abstracts/search?q=Alaa%20Abdallah%20Altassan"> Alaa Abdallah Altassan</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Algebraic graph theory is defined as a bridge between algebraic structures and graphs. It has several uses in many fields, including chemistry, physics, and computer science. The prime graph is a type of graph associated with a ring R, where the vertex set is the whole ring R, and two vertices x and y are adjacent if either xRy=0 or yRx=0. However, the investigation of the prime graph over rings remains relatively limited. The behavior of this graph in extended rings, like R[x] and R[[x]], where R is a non-commutative ring, deserves more attention because of the wider applicability in algebra and other mathematical fields. To study the prime graphs over polynomials and power series rings, we used a combination of ring-theoretic and graph-theoretic techniques. This paper focuses on two invariants: the diameter and the girth of these graphs. Furthermore, the work discusses how the graph structures change when passing from R to R[x] and R[[x]]. In our study, we found that the set of strong zero-divisors of ring R represents the set of vertices in prime graphs. Based on this discovery, we redefined the vertices of prime graphs using the definition of strong zero divisors. Additionally, our results show that although the prime graphs of R[x] and R[[x]] are comparable to the graph of R, they have different combinatorial characteristics since these extensions contain new strong zero-divisors. In particular, we find conditions in which the diameter and girth of the graphs, as they expand from R to R[x] and R[[x]], do not change or do change. In conclusion, this study shows how extending a non-commutative ring R to R[x] and R[[x]] affects the structure of their prime graphs, particularly in terms of diameter and girth. These findings enhance the understanding of the relationship between ring extensions and graph properties. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=prime%20graph" title="prime graph">prime graph</a>, <a href="https://publications.waset.org/abstracts/search?q=diameter" title=" diameter"> diameter</a>, <a href="https://publications.waset.org/abstracts/search?q=girth" title=" girth"> girth</a>, <a href="https://publications.waset.org/abstracts/search?q=polynomial%20ring" title=" polynomial ring"> polynomial ring</a>, <a href="https://publications.waset.org/abstracts/search?q=power%20series%20ring" title=" power series ring"> power series ring</a> </p> <a href="https://publications.waset.org/abstracts/192430/prime-graphs-of-polynomials-and-power-series-over-non-commutative-rings" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/192430.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">18</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4274</span> Controller Design for Highly Maneuverable Aircraft Technology Using Structured Singular Value and Direct Search Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Marek%20Dlapa">Marek Dlapa</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The algebraic approach is applied to the control of the HiMAT (Highly Maneuverable Aircraft Technology). The objective is to find a robust controller which guarantees robust stability and decoupled control of longitudinal model of a scaled remotely controlled vehicle version of the advanced fighter HiMAT. Control design is performed by decoupling the nominal MIMO (multi-input multi-output) system into two identical SISO (single-input single-output) plants which are approximated by a 4th order transfer function. The algebraic approach is then used for pole placement design, and the nominal closed-loop poles are tuned so that the peak of the µ-function is minimal. As an optimization tool, evolutionary algorithm Differential Migration is used in order to overcome the multimodality of the cost function yielding simple controller with decoupling for nominal plant which is compared with the D-K iteration through simulations of standard longitudinal manoeuvres documenting decoupled control obtained from algebraic approach for nominal plant as well as worst case perturbation. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algebraic%20approach" title="algebraic approach">algebraic approach</a>, <a href="https://publications.waset.org/abstracts/search?q=evolutionary%20computation" title=" evolutionary computation"> evolutionary computation</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithms" title=" genetic algorithms"> genetic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=HiMAT" title=" HiMAT"> HiMAT</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20control" title=" robust control"> robust control</a>, <a href="https://publications.waset.org/abstracts/search?q=structured%20singular%20value" title=" structured singular value"> structured singular value</a> </p> <a href="https://publications.waset.org/abstracts/99453/controller-design-for-highly-maneuverable-aircraft-technology-using-structured-singular-value-and-direct-search-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99453.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">140</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4273</span> Retrofitting of Historical Structures in Van City</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Eylem%20G%C3%BCzel">Eylem Güzel</a>, <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20G%C3%BClen"> Mustafa Gülen</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Historical structures are the most important symbols of a country that link the past with the future. In order to transfer them in their present conditions to the next generations, maintaining these historical structures are one of our main tasks. Seismic performance of historical structures damaged by the earthquake effects can be enhanced by repair and retrofitting applications. However, repair and retrofitting applications of historical structures are more complicated compared with the traditional structures. For this reason, they need much more attention in repair and retrofitting applications to preserve the spirit of historical structures. In this study, the present condition of selected historical structures built up in Van city that has a very rich historical heritage is given and the necessity of repair and retrofitting applications of historical structures are debated in detail. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=historical%20structures" title="historical structures">historical structures</a>, <a href="https://publications.waset.org/abstracts/search?q=repair" title=" repair"> repair</a>, <a href="https://publications.waset.org/abstracts/search?q=retrofitting" title=" retrofitting"> retrofitting</a>, <a href="https://publications.waset.org/abstracts/search?q=Van%20city" title=" Van city"> Van city</a> </p> <a href="https://publications.waset.org/abstracts/43496/retrofitting-of-historical-structures-in-van-city" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/43496.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">355</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4272</span> Toward Subtle Change Detection and Quantification in Magnetic Resonance Neuroimaging</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammad%20Esmaeilpour">Mohammad Esmaeilpour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> One of the important open problems in the field of medical image processing is detection and quantification of small changes. In this poster, we try to investigate that, how the algebraic decomposition techniques can be used for semiautomatically detecting and quantifying subtle changes in Magnetic Resonance (MR) neuroimaging volumes. We mostly focus on the low-rank values of the matrices achieved from decomposing MR image pairs during a period of time. Besides, a skillful neuroradiologist will help the algorithm to distinguish between noises and small changes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=magnetic%20resonance%20neuroimaging" title="magnetic resonance neuroimaging">magnetic resonance neuroimaging</a>, <a href="https://publications.waset.org/abstracts/search?q=subtle%20change%20detection%20and%20quantification" title=" subtle change detection and quantification"> subtle change detection and quantification</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20decomposition" title=" algebraic decomposition"> algebraic decomposition</a>, <a href="https://publications.waset.org/abstracts/search?q=basis%20functions" title=" basis functions"> basis functions</a> </p> <a href="https://publications.waset.org/abstracts/32372/toward-subtle-change-detection-and-quantification-in-magnetic-resonance-neuroimaging" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/32372.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">474</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4271</span> On the Zeros of the Degree Polynomial of a Graph</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20R.%20Nayaka">S. R. Nayaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Putta%20Swamy"> Putta Swamy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Graph polynomial is one of the algebraic representations of the Graph. The degree polynomial is one of the simple algebraic representations of graphs. The degree polynomial of a graph G of order n is the polynomial Deg(G, x) with the coefficients deg(G,i) where deg(G,i) denotes the number of vertices of degree i in G. In this article, we investigate the behavior of the roots of some families of Graphs in the complex field. We investigate for the graphs having only integral roots. Further, we characterize the graphs having single roots or having real roots and behavior of the polynomial at the particular value is also obtained. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=degree%20polynomial" title="degree polynomial">degree polynomial</a>, <a href="https://publications.waset.org/abstracts/search?q=regular%20graph" title=" regular graph"> regular graph</a>, <a href="https://publications.waset.org/abstracts/search?q=minimum%20and%20maximum%20degree" title=" minimum and maximum degree"> minimum and maximum degree</a>, <a href="https://publications.waset.org/abstracts/search?q=graph%20operations" title=" graph operations"> graph operations</a> </p> <a href="https://publications.waset.org/abstracts/56602/on-the-zeros-of-the-degree-polynomial-of-a-graph" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/56602.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">249</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4270</span> Going beyond Elementary Algebraic Identities: The Expectation of a Gifted Child, an Indian Scenario</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20R.%20Santhanam">S. R. Santhanam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> A gifted child is one who gives evidence of creativity, good memory, rapid learning. In mathematics, a teacher often comes across some gifted children and they exhibit the following characteristics: unusual alertness, enjoying solving problems, getting bored on repetitions, self-taught, going beyond what teacher taught, ask probing questions, connecting unconnected concepts, vivid imagination, readiness for research work, perseverance of a topic. There are two main areas of research carried out on them: 1)identifying gifted children, 2) interacting and channelizing them. A lack of appropriate recognition will lead the gifted child demotivated. One of the main findings is if proper attention and nourishment are not given then it leads a gifted child to become depressed, underachieving, fail to reach their full potential and sometimes develop negative attitude towards school and study. After identifying them, a mathematics teacher has to develop them into a fall fledged achiever. The responsibility of the teacher is enormous. The teacher has to be resourceful and patient. But interacting with them one finds a lot of surprises and awesomeness. The elementary algebraic identities like (a+b)(a-b)=a²-b², expansion of like (a+b)²(a-b)² and others are taught to students, of age group 13-15 in India. An average child will be satisfied with a single proof and immediate application of these identities. But a gifted child expects more from the teacher and at one stage after a little training will surpass the teacher also. In this short paper, the author shares his experience regarding teaching algebraic identities to gifted children. The following problem was given to a set of 10 gifted children of the specified age group: If a natural number ‘n’ to expressed as the sum of the two squares, will 2n also be expressed as the sum of two squares? An investigation has been done on what multiples of n satisfying the criterion. The attempts of the gifted children were consolidated and conclusion was drawn. A second problem was given to them as: can two natural numbers be found such that the difference of their square is 3? After a successful solution, more situations were analysed. As a third question, the finding of the sign of an algebraic expression in three variables was analysed. As an example: if a,b,c are real and unequal what will be sign of a²+4b²+9c²-4ab-12bc-6ca? Apart from an expression as a perfect square what other methods can be employed to prove an algebraic expression as positive negative or non negative has been analysed. Expressions like 4x²+2y²+13y²-2xy-4yz-6zx were given, and the children were asked to find the sign of the expression for all real values of x,y and z. In all investigations, only basic algebraic identities were used. As a next probe, a divisibility problem was initiated. When a,b,c are natural numbers such that a+b+c is at least 6, and if a+b+c is divisible by 6 then will 6 divide a³+b³+c³. The gifted children solved it in two different ways. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algebraic%20identities" title="algebraic identities">algebraic identities</a>, <a href="https://publications.waset.org/abstracts/search?q=gifted%20children" title=" gifted children"> gifted children</a>, <a href="https://publications.waset.org/abstracts/search?q=Indian%20scenario" title=" Indian scenario"> Indian scenario</a>, <a href="https://publications.waset.org/abstracts/search?q=research" title=" research"> research</a> </p> <a href="https://publications.waset.org/abstracts/81093/going-beyond-elementary-algebraic-identities-the-expectation-of-a-gifted-child-an-indian-scenario" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81093.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">180</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4269</span> Bound State Problems and Functional Differential Geometry</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=S.%20Srednyak">S. Srednyak</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We study a class of functional partial differential equations(FPDEs). This class is suggested by Quantum Field Theory. We derive general properties of solutions to such equations. In particular, we demonstrate that they lead to systems of coupled integral equations with singular kernels. We show that solutions to such hierarchies can be sought among functions with regular singularities at a countable set of subvarieties of the physical space. We also develop a formal analogy of basic constructions of differential geometry on functional manifolds, as this is necessary for in depth study of FPDEs. We also consider the case of linear overdetermined systems of functional differential equations and show that it can be completely solved in terms of formal solutions of a functional equation that is a functional analogy of a system of determined algebraic equations. This development leads us to formally define the functional analogy of algebraic geometry, which we call functional algebraic geometry. We study basic properties of functional algebraic varieties. In particular, we investigate the case of a formally discrete set of solutions. We also define and study functional analogy of discriminants. In the case of fully determined systems such that the defining functionals have regular singularities, we demonstrate that formal solutions can be sought in the class of functions with regular singularities. This case provides a practical way to apply our results to physics problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=functional%20equations" title="functional equations">functional equations</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20field%20theory" title=" quantum field theory"> quantum field theory</a>, <a href="https://publications.waset.org/abstracts/search?q=holomorphic%20functions" title=" holomorphic functions"> holomorphic functions</a>, <a href="https://publications.waset.org/abstracts/search?q=Yang%20Mills%20mass%20gap%20problem" title=" Yang Mills mass gap problem"> Yang Mills mass gap problem</a>, <a href="https://publications.waset.org/abstracts/search?q=quantum%20chaos" title=" quantum chaos"> quantum chaos</a> </p> <a href="https://publications.waset.org/abstracts/173716/bound-state-problems-and-functional-differential-geometry" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/173716.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">70</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4268</span> Parallel Multisplitting Methods for DAE’s</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmed%20Machmoum">Ahmed Machmoum</a>, <a href="https://publications.waset.org/abstracts/search?q=Malika%20El%20Kyal"> Malika El Kyal</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We consider iterative parallel multi-splitting method for differential algebraic equations. The main feature of the proposed idea is to use the asynchronous form. We prove that the multi-splitting technique can effectively accelerate the convergent performance of the iterative process. The main characteristic of an asynchronous mode is that the local algorithm not have to wait at predetermined messages to become available. We allow some processors to communicate more frequently than others, and we allow the communication delays tobe substantial and unpredictable. Note that synchronous algorithms in the computer science sense are particular cases of our formulation of asynchronous one. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=computer" title="computer">computer</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-splitting%20methods" title=" multi-splitting methods"> multi-splitting methods</a>, <a href="https://publications.waset.org/abstracts/search?q=asynchronous%20mode" title=" asynchronous mode"> asynchronous mode</a>, <a href="https://publications.waset.org/abstracts/search?q=differential%20algebraic%20systems" title=" differential algebraic systems "> differential algebraic systems </a> </p> <a href="https://publications.waset.org/abstracts/23813/parallel-multisplitting-methods-for-daes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/23813.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4267</span> Sustainable Design in the Use of Deployable Structures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Umweni%20Osahon%20Joshua">Umweni Osahon Joshua</a>, <a href="https://publications.waset.org/abstracts/search?q=Anton%20Ianakiev"> Anton Ianakiev</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Deployable structures have been used in various scenarios from moving roofs in stadia, space antennae or booms. There has been a lot of literature relating deployable structures but with main focus on space applications. The complexities in the design of deployable structures may be the reason only few have been constructed for earth based solutions. This paper intends to explore the possibilities of integrating sustainable design concepts in deployable structures. Key aspects of sustainable design of structures as applicable to deployable structures have not been explored. Sustainable design of structures have mainly been concerned with static structures in the built environment. However, very little literature, concepts or framework has been drafted as it relates to deployable structures or their integration to static structures as a model for sustainable design. This article seeks to address this flaw in sustainable design for structural engineering and to provide a framework for designing structures in a sustainable manner. This framework will apply to deployable structures for earth-based environments as a form of disaster relief measures and also as part of static structures in the built environment. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=deployable%20structures" title="deployable structures">deployable structures</a>, <a href="https://publications.waset.org/abstracts/search?q=sustainable%20design" title=" sustainable design"> sustainable design</a>, <a href="https://publications.waset.org/abstracts/search?q=framework" title=" framework"> framework</a>, <a href="https://publications.waset.org/abstracts/search?q=earth-based%20environments" title=" earth-based environments "> earth-based environments </a> </p> <a href="https://publications.waset.org/abstracts/15693/sustainable-design-in-the-use-of-deployable-structures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15693.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">541</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4266</span> Q-Efficient Solutions of Vector Optimization via Algebraic Concepts</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20Kiyani">Elham Kiyani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we first introduce the concept of Q-efficient solutions in a real linear space not necessarily endowed with a topology, where Q is some nonempty (not necessarily convex) set. We also used the scalarization technique including the Gerstewitz function generated by a nonconvex set to characterize these Q-efficient solutions. The algebraic concepts of interior and closure are useful to study optimization problems without topology. Studying nonconvex vector optimization is valuable since topological interior is equal to algebraic interior for a convex cone. So, we use the algebraic concepts of interior and closure to define Q-weak efficient solutions and Q-Henig proper efficient solutions of set-valued optimization problems, where Q is not a convex cone. Optimization problems with set-valued maps have a wide range of applications, so it is expected that there will be a useful analytical tool in optimization theory for set-valued maps. These kind of optimization problems are closely related to stochastic programming, control theory, and economic theory. The paper focus on nonconvex problems, the results are obtained by assuming generalized non-convexity assumptions on the data of the problem. In convex problems, main mathematical tools are convex separation theorems, alternative theorems, and algebraic counterparts of some usual topological concepts, while in nonconvex problems, we need a nonconvex separation function. Thus, we consider the Gerstewitz function generated by a general set in a real linear space and re-examine its properties in the more general setting. A useful approach for solving a vector problem is to reduce it to a scalar problem. In general, scalarization means the replacement of a vector optimization problem by a suitable scalar problem which tends to be an optimization problem with a real valued objective function. The Gerstewitz function is well known and widely used in optimization as the basis of the scalarization. The essential properties of the Gerstewitz function, which are well known in the topological framework, are studied by using algebraic counterparts rather than the topological concepts of interior and closure. Therefore, properties of the Gerstewitz function, when it takes values just in a real linear space are studied, and we use it to characterize Q-efficient solutions of vector problems whose image space is not endowed with any particular topology. Therefore, we deal with a constrained vector optimization problem in a real linear space without assuming any topology, and also Q-weak efficient and Q-proper efficient solutions in the senses of Henig are defined. Moreover, by means of the Gerstewitz function, we provide some necessary and sufficient optimality conditions for set-valued vector optimization problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=algebraic%20interior" title="algebraic interior">algebraic interior</a>, <a href="https://publications.waset.org/abstracts/search?q=Gerstewitz%20function" title=" Gerstewitz function"> Gerstewitz function</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20closure" title=" vector closure"> vector closure</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20optimization" title=" vector optimization"> vector optimization</a> </p> <a href="https://publications.waset.org/abstracts/94011/q-efficient-solutions-of-vector-optimization-via-algebraic-concepts" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94011.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">216</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">4265</span> Optimality Conditions for Weak Efficient Solutions Generated by a Set Q in Vector Spaces</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20Kiyani">Elham Kiyani</a>, <a href="https://publications.waset.org/abstracts/search?q=S.%20Mansour%20Vaezpour"> S. Mansour Vaezpour</a>, <a href="https://publications.waset.org/abstracts/search?q=Javad%20Tavakoli"> Javad Tavakoli</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we first introduce a new distance function in a linear space not necessarily endowed with a topology. The algebraic concepts of interior and closure are useful to study optimization problems without topology. So, we define Q-weak efficient solutions generated by the algebraic interior of a set Q, where Q is not necessarily convex. Studying nonconvex vector optimization is valuable since, for a convex cone K in topological spaces, we have int(K)=cor(K), which means that topological interior of a convex cone K is equal to the algebraic interior of K. Moreover, we used the scalarization technique including the distance function generated by the vectorial closure of a set to characterize these Q-weak efficient solutions. Scalarization is a useful approach for solving vector optimization problems. This technique reduces the optimization problem to a scalar problem which tends to be an optimization problem with a real-valued objective function. For instance, Q-weak efficient solutions of vector optimization problems can be characterized and computed as solutions of appropriate scalar optimization problems. In the convex case, linear functionals can be used as objective functionals of the scalar problems. But in the nonconvex case, we should present a suitable objective function. It is the aim of this paper to present a new distance function that be useful to obtain sufficient and necessary conditions for Q-weak efficient solutions of general optimization problems via scalarization. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=weak%20efficient" title="weak efficient">weak efficient</a>, <a href="https://publications.waset.org/abstracts/search?q=algebraic%20interior" title=" algebraic interior"> algebraic interior</a>, <a href="https://publications.waset.org/abstracts/search?q=vector%20closure" title=" vector closure"> vector closure</a>, <a href="https://publications.waset.org/abstracts/search?q=linear%20space" title=" linear space"> linear space</a> </p> <a href="https://publications.waset.org/abstracts/94737/optimality-conditions-for-weak-efficient-solutions-generated-by-a-set-q-in-vector-spaces" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/94737.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">228</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=143">143</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=144">144</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=algebraic%20structures&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>