Algebra Commons^™

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

Open Educational Resources

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

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 and Applications of Graphs

The \alpha-Hermitian adjacency matrix H_\alpha 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 \alpha. 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 a …

Generating Polynomials Of Exponential Random Graphs, Mohabat Tarkeshian

Electronic Thesis and Dissertation Repository

The theory of random graphs describes the interplay between probability and graph theory: it is the study of the stochastic process by which graphs form and evolve. In 1959, Erdős and Rényi defined the foundational model of random graphs on n vertices, denoted G(n, p) ([ER84]). Subsequently, Frank and Strauss (1986) added a Markov twist to this story by describing a topological structure on random graphs that encodes dependencies between local pairs of vertices ([FS86]). The general model that describes this framework is called the exponential random graph model (ERGM).

In the past, determining when a probability distribution has strong …

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 …

One Theorem, Two Ways: A Case Study In Geometric Techniques, John B. Little

Journal of Humanistic Mathematics

If the three sides of a triangle ABΓ in the Euclidean plane are cut by points H on AB, Θ on BΓ, and K on ΓA cutting those sides in same ratios:

AH : HB = BΘ : ΘΓ = ΓK : KA,

then Pappus of Alexandria proved that the triangles ABΓ and HΘK have the same centroid (center of mass). We present two proofs of this result: an English translation of Pappus's original synthetic proof and a modern algebraic proof making use of Cartesian coordinates and vector concepts. Comparing the two methods, we can see that while the algebraic …

An Introduction To The Algebra Revolution, Art Bardige

Numeracy

Bardige, Art. 2022. The Algebra Revolution: How Spreadsheets Eliminate Algebra 1 to Transform Education; (Bookbaby) 135 pp. UNSPSC 55111505.

The Algebra Revolution: How Spreadsheets Eliminate Algebra 1 to Transform Education argues that Algebra 1 can be eliminated by teaching mathematics through spreadsheets. Such a change would eliminate the greatest roadblock to student achievement.

Interpolation Problems And The Characterization Of The Hilbert Function, Bryant Xie

Mathematical Sciences Undergraduate Honors Theses

In mathematics, it is often useful to approximate the values of functions that are either too awkward and difficult to evaluate or not readily differentiable or integrable. To approximate its values, we attempt to replace such functions with more well-behaving examples such as polynomials or trigonometric functions. Over the algebraically closed field C, a polynomial passing through r distinct points with multiplicities m1, ..., mr on the affine complex line in one variable is determined by its zeros and the vanishing conditions up to its mi − 1 derivative for each point. A natural question would then be to consider …

Schur Analysis And Discrete Analytic Functions: Rational Functions And Co-Isometric Realizations, Daniel Alpay, Dan Volok

Mathematics, Physics, and Computer Science Faculty Articles and Research

We define and study rational discrete analytic functions and prove the existence of a coisometric realization for discrete analytic Schur multipliers.

Discrete Wiener Algebra In The Bicomplex Setting, Spectral Factorization With Symmetry, And Superoscillations, Daniel Alpay, Izchak Lewkowicz, Mihaela Vajiac

Mathematics, Physics, and Computer Science Faculty Articles and Research

In this paper we present parallel theories on constructing Wiener algebras in the bicomplex setting. With the appropriate symmetry condition, the bicomplex matrix valued case can be seen as a complex valued case and, in this matrix valued case, we make the necessary connection between bicomplex analysis and complex analysis with symmetry. We also write an application to superoscillations in this case.

An Algebraic Characterization Of Total Input Strictly Local Functions, Dakotah Lambert, Jeffrey Heinz

Proceedings of the Society for Computation in Linguistics

This paper provides an algebraic characteriza- tion of the total input strictly local functions. Simultaneous, noniterative rules of the form A→B/C D, common in phonology, are defin- able as functions in this class whenever CAD represents a finite set of strings. The algebraic characterization highlights a fundamental con- nection between input strictly local functions and the simple class of definite string languages, as well as connections to string functions stud- ied in the computer science literature, the def- inite functions and local functions. No effec- tive decision procedure for the input strictly local maps was previously available, but one arises …

Pairings In A Ring Spectrum-Based Bousfield-Kan Spectral Sequence, Jonathan Toledo

Dissertations, Theses, and Capstone Projects

Bousfield and Kan traditionally formulated their homotopy spectral sequence over a simplicial set X resolved with respect to a ring R. By considering an adequate category of ring spectra, one can take a ring spectrum E, create from it a functor of a triple on the category of simplicial sets, and build a cosimplicial simplicial set EX. The homotopy spectral sequence can then be formed over such cosimplicial spaces by a similar construction to the original. Pairings can be established on these spectral sequences, and, for nice enough spaces, these pairings on the E₂-terms coincide with certain …

An Application Of The Pagerank Algorithm To Ncaa Football Team Rankings, Morgan Majors

Honors Theses

We investigate the use of Google’s PageRank algorithm to rank sports teams. The PageRank algorithm is used in web searches to return a list of the websites that are of most interest to the user. The structure of the NCAA FBS football schedule is used to construct a network with a similar structure to the world wide web. Parallels are drawn between pages that are linked in the world wide web with the results of a contest between two sports teams. The teams under consideration here are the members of the 2021 Football Bowl Subdivision. We achieve a total ordering …

G-Coatomic Modules, Ahmed H. Alwan

Al-Bahir Journal for Engineering and Pure Sciences

Let R be a ring and M be a right R-module. A submodule of is said to be g-small in , if for every submodule , with implies that . Then is a g-small submodule of . We call g-coatomic module whenever and then . Also, is called right (left) g-coatomic ring if the right (left) -module (R) is g-coatomic. In this work, we study g-coatomic modules and ring. We investigate some properties of these modules. We prove is g-coatomic if and only if each is g-coatomic. It is proved that if is a g-semiperfect ring with , then …

On The Superabundance Of Singular Varieties In Positive Characteristic, Jake Kettinger

Dissertations, Theses, and Student Research Papers in Mathematics

The geproci property is a recent development in the world of geometry. We call a set of points Z\subseq\P_k^3 an (a,b)-geproci set (for GEneral PROjection is a Complete Intersection) if its projection from a general point P to a plane is a complete intersection of curves of degrees a and b. Examples known as grids have been known since 2011. Previously, the study of the geproci property has taken place within the characteristic 0 setting; prior to the work in this thesis, a procedure has been known for creating an (a,b)-geproci half-grid for 4\leq a\leq b, but it was not …

Let’S Make Patterns!: Symmetric Rubik’S Cube Permutations, Danny Anderson

Theses/Capstones/Creative Projects

Rubik’s cubes are well-known for having several different patterns, or permutations, that can be made from them. Meanwhile, cubes generally display a wide variety of symmetries. Naturally, these ideas can be combined to form a notion of "symmetric Rubik's cube patterns." The goal of this paper is to find an algorithm that can produce all of the permutations that display symmetries.

The Hilbert Sequence And Its Associated Jacobi Matrix, Caleb Beckler

Honors Theses

In this project, we investigate positive definite sequences and their associated Jacobi matrices in Hilbert space. We set out to determine the Jacobi matrix associated to the Hilbert sequence by methods described in Akhiezer’s book The Classical Moment Problem. Using methods in Teschl’s book Jacobi Operators and Completely Integrable Nonlinear Lattice, we determine the essential spectrum of the corresponding Jacobi matrix.

Automorphisms Of A Generalized Quadrangle Of Order 6, Ryan Pesak

Undergraduate Honors Theses

In this thesis, we study the symmetries of the putative generalized quadrangle of order 6. Although it is unknown whether such a quadrangle Q can exist, we show that if it does, that Q cannot be transitive on either points or lines. We first cover the background necessary for studying this problem. Namely, the theory of groups and group actions, the theory of generalized quadrangles, and automorphisms of GQs. We then prove that a generalized quadrangle Q of order 6 cannot have a point- or line-transitive automorphism group, and we also prove that if a group G acts faithfully on …

Cohen-Macaulay Properties Of Closed Neighborhood Ideals, Jackson Leaman

All Theses

This thesis investigates Cohen-Macaulay properties of squarefree monomial ideals, which is an important line of inquiry in the field of combinatorial commutative algebra. A famous example of this is Villareal’s edge ideal [11]: given a finite simple graph G with vertices x1, . . . , xn, the edge ideal of G is generated by all the monomials of the form xixj where xi and xj are adjacent in G. Villareal’s characterization of Cohen-Macaulay edge ideals associated to trees is an often-cited result in the literature. This was extended to chordal and bipartite graphs by Herzog, Hibi, and Zheng in …

Invariants Of 3-Braid And 4-Braid Links, Mark Essa Sukaiti

Theses

In this study, we established a connection between the Chebyshev polynomial of the first kind and the Jones polynomial of generalized weaving knots of type W(3,n,m).
Through our analysis, we demonstrated that the coefficients of the Jones polynomial of weaving knots are essentially the Whitney numbers of Lucas lattices which allowed us to find an explicit formula for the Alexander polynomial of weaving knots of typeW(3,n).
In addition to confirming Fox’s trapezoidal conjecture, we also discussed the zeroes of the Alexander Polynomial of weaving knots of type W(3,n) as they relate to Hoste’s conjecture. In addition, …