Algebra Commons^™

GröBner Bases With An Application To Tame Functions, Jessica D. Marconi

UNF Graduate Theses and Dissertations

Grobner bases are essential tools in algebraic geometry, used to simplify and solve systems of polynomial equations. These bases revolutionized computational methods in various branches of mathematics after being introduced in 1965 by Bruno Buchberger. This thesis explores the foundational concepts of Grobner bases, including their formation and properties. It also demonstrates their use in solving mathematical problems in algebraic geometry, including the ideal membership problem. As an application, we show how Grobner bases can be used to determine whether a polynomial mapping is tame. This concept is crucial for analyzing the topology near singular points and establishing whether a …

Generalized Functions In The Study Of Signals And Systems, Erik I. Verriest, Gunther Dirr, W. Steven Gray

Electrical & Computer Engineering Faculty Publications

We collect three instances where the theory of generalized functions may still make contributions to the study of signals and systems. In the first, a purely algebraic approach is presented for LTI-ODE's, in terms of two operators, D and T, respectively the differentiation operator and the multiplication-by-the-independent-variable operator. This formalism adds simplicity, a duality theory, and nicely generalizes to other classes of operator equations and their solutions. In the second part we extend the classical bilateral Laplace transform to include Bohl functions with support in ℝ by invoking Sato's hyperfunctions. Finally, in the third case we use the Colombeau algebra …

Frieze And Tiling Groups In The Lorentz-Minkowski Plane, Michael O. Lynch

Honors Undergraduate Theses

In this thesis, there is a presentation of the isometries from the Lorentz-Minkowski Plane and a solution to the Frieze Patterns. There is a suggestion for a solution for the Tiling Patterns. Since the construction of these mathematical structures is well understood in the Euclidean plane, one can follow a similar approach to the construction of such objects to find the unique number of groups that describe all possible frieze patterns while there is a suggestion of the number for the tiling case. There is a reflection of these results in a computational and cosmological context.

Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia

Journal of Nonprofit Innovation

Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.

Imagine Doris, who is …

The Vulnerabilities To The Rsa Algorithm And Future Alternative Algorithms To Improve Security, James Johnson

Cybersecurity Undergraduate Research Showcase

The RSA encryption algorithm has secured many large systems, including bank systems, data encryption in emails, several online transactions, etc. Benefiting from the use of asymmetric cryptography and properties of number theory, RSA was widely regarded as one of most difficult algorithms to decrypt without a key, especially since by brute force, breaking the algorithm would take thousands of years. However, in recent times, research has shown that RSA is getting closer to being efficiently decrypted classically, using algebraic methods, (fully cracked through limited bits) in which elliptic-curve cryptography has been thought of as the alternative that is stronger than …

A Survey On Varieties Generated By Small Semigroups And A Companion Website, João Araújo, João Pedro Araújo, Peter J. Cameron, Edmond W. H. Lee, Jorge Raminhos

Mathematics Faculty Articles

This paper presents new findings on varieties generated by small semigroups and groups, and offers a survey of existing results. A companion website is provided which hosts a computational system integrating automated reasoning tools, finite model builders, SAT solvers, and GAP. This platform is a living guide to the literature. In addition, the first complete and justified list of identity bases for all varieties generated by a semigroup of order up to 4 is provided as supplementary material. The paper concludes with an extensive list of open problems.

A History Of Complex Simple Lie Algebras, Avrila Frazier

Electronic Theses and Dissertations

In 1869, prompted by his work in differential equations, Sophus Lie wondered about categorizing what he called “closed systems of commutative transformations,” while around the same time, Wilhelm Killing’s work on non-Euclidean geometry encountered related topics. As mathematicians recognized this as a division of abstract algebra, the area became known as “continuous transformation groups," but we now refer to them as Lie groups.

Patterns and structures emerged from their work, such as describing Lie groups in connection with their associated Lie algebras, which can be categorized in many important ways. In this paper, we focus on Lie algebras over the …

Unexpectedness Stratified By Codimension, Frank Zimmitti

Department of Mathematics: Dissertations, Theses, and Student Research

A recent series of papers, starting with the paper of Cook, Harbourne, Migliore, and Nagel on the projective plane in 2018, studies a notion of unexpectedness for finite sets Z of points in N-dimensional projective space. Say the complete linear system L of forms of degree d vanishing on Z has dimension t yet for any general point P the linear system of forms vanishing on Z with multiplicity m at P is nonempty. If the dimension of L is more than the expected dimension of t−r, where r is N+m−1 choose …

Lie Algebras And Lie Groups, Nhi Nguyen

Algebra Seminar

No abstract provided.

The Heisenberg Lie Algebra And Its Role In The Quantum Mechanical Harmonic Oscillator, Angelina Georg

Algebra Seminar

No abstract provided.

Irreducible Representations Of Sl(2,C), Della Medovoy

Algebra Seminar

No abstract provided.

⊕-Supplemented Semimodules, Ahmed H. Alwan

Al-Bahir

In this paper, ⊕-Supplemented Semimodules are defined as generalizations of ⊕-Supplemented modules. Let S be a semiring. An S-semimodule A is named a ⊕-supplemented semimodule, if every subsemimodule of A has a supplement which is a direct summand of A. In this paper, we investigate some properties of ⊕-supplemented semimodules besides generalize certain results on ⊕-supplemented modules to semimodules.

Unexpectedness Stratified By Codimension, Frank Zimmitti

Dissertations and Doctoral Documents, University of Nebraska-Lincoln, 2023–

A recent series of papers, starting with the paper of Cook, Harbourne, Migliore and Nagel on the projective plane in 2018, studies a notion of unexpectedness for finite sets Z of points in N-dimensional projective space. Say the complete linear system L of forms of degree d vanishing on Z has dimension t yet for any general point P the linear system of forms vanishing on Z with multiplicity m at P is nonempty. If the dimension of L is more than the expected dimension of t−r, where r is N+m−1 choose N …

Certain Invertible Operator-Block Matrices Induced By C*-Algebras And Scaled Hypercomplex Numbers, Daniel Alpay, Ilwoo Choo

Mathematics, Physics, and Computer Science Faculty Articles and Research

The main purposes of this paper are (i) to enlarge scaled hypercomplex structures to operator-valued cases, where the operators are taken from a C*-subalgebra of an operator algebra on a separable Hilbert space, (ii) to characterize the invertibility conditions on the operator-valued scaled-hypercomplex structures of (i), (iii) to study relations between the invertibility of scaled hypercomplex numbers, and that of operator-valued cases of (ii), and (iv) to confirm our invertibility of (ii) and (iii) are equivalent to the general invertibility of (2×2)-block operator matrices.

Math 115: College Algebra For Pre-Calculus, Seth Lehman

Open Educational Resources

OER course syllabus for Math 115, College Algebra, at Queens College

Umbilic Points On The Finite And Infinite Parts Of Certain Algebraic Surfaces, Brendan Guilfoyle, Adriana Ortiz-Rodríguez

Department of Mathematics Publications

The global qualitative behaviour of fields of principal directions for the graph of a real valued polynomial function f on the plane is studied. We determine and analyze the projective extension of these fields and show that they are defined by an analytic quadratic form on the whole unit 2-sphere. We prove that every umbilic point at infinity of this extension has a Poincaré-Hopf index equal to 1/2, and the topological type of a Lemon when the degree of f is 2 and the topological type of a Monstar for higher degrees. As a consequence we prove a Poincaré-Hopf type …

New Perspectives On Semi-Primal Varieties, Alexander Kurz, Wolfgang Poiger, Bruno Teheux

Engineering Faculty Articles and Research

We study varieties generated by semi-primal lattice-expansions by means of category theory. We provide a new proof of the Keimel-Werner topological duality for such varieties and, using similar methods, establish its discrete version. We describe multiple adjunctions between the variety of Boolean algebras and the variety generated by a semi-primal lattice-expansion, both on the topological side and explicitly algebraic. In particular, we show that the Boolean skeleton functor has two adjoints, both defined by taking certain Boolean powers, and we identify properties of these adjunctions which fully characterize semi-primality of an algebra. Lastly, we give a new characterization of canonical …

Many-Valued Coalgebraic Logic: From Boolean Algebras To Primal Varieties, Alexander Kurz, Wolfgang Poiger

Engineering Faculty Articles and Research

We study many-valued coalgebraic logics with primal algebras of truth-degrees. We describe a way to lift algebraic semantics of classical coalgebraic logics, given by an endofunctor on the variety of Boolean algebras, to this many-valued setting, and we show that many important properties of the original logic are inherited by its lifting. Then, we deal with the problem of obtaining a concrete axiomatic presentation of the variety of algebras for this lifted logic, given that we know one for the original one. We solve this problem for a class of presentations which behaves well with respect to a lattice structure …

The Gamma-Signless Laplacian Adjacency Matrix Of Mixed Graphs, Omar Alomari, Mohammad Abudayah, Manal Ghanem

Theory & Applications of Graphs

The α-Hermitian adjacency matrix H_α of a mixed graph X has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number α. This enables us to define an incidence matrix of mixed graphs. Consequently, we define a generalization of line graphs as well as a generalization of the signless Laplacian adjacency matrix of graphs. We then study the spectral properties of the gamma-signless Laplacian adjacency matrix of a mixed graph. Lastly, we characterize when the signless Laplacian adjacency matrix of …

Efficient And Secure Digital Signature Algorithm (Dsa), Nissa Mehibel, M'Hamed Hamadouche

Emirates Journal for Engineering Research

The digital signature is used to ensure the integrity of messages as well as the authentication and non-repudiation of users. Today it has a very important role in information security. Digital signature is used in various fields such as e-commerce and e-voting, health, internet of things (IOT). Many digital signature schemes have been proposed, depending on the computational cost and security level. In this paper, we analyzed a recently proposed digital signature scheme based on the discrete logarithm problem (DLP). Our analysis shows that the scheme is not secure against the repeated random number attack to determine the secret keys …