Physical Sciences and Mathematics Commons^™

Factorization Lengths In Numerical Monoids, Maya Samantha Schwartz

Senior Projects Spring 2019

A numerical monoid M generated by the natural numbers n_1, ..., n_k is a subset of {0, 1, 2, ...} whose elements are non-negative linear combinations of the generators n_1, ..., n_k. The set of factorizations of an element in M is the set of all the different ways to write that element as a linear combination of the generators. The length of a factorization of an element is the sum of the coefficients of that factorization. Since an element in a monoid can be written in different ways in terms of the generators, its set of factorization lengths may …

Factorization In Integral Domains., Ryan H. Gipson

Electronic Theses and Dissertations

We investigate the atomicity and the AP property of the semigroup rings F[X; M], where F is a field, X is a variable and M is a submonoid of the additive monoid of nonnegative rational numbers. In this endeavor, we introduce the following notions: essential generators of M and elements of height (0, 0, 0, . . .) within a cancellative torsion-free monoid Γ. By considering the latter, we are able to determine the irreducibility of certain binomials of the form Xπ − 1, where π is of height (0, 0, 0, . . .), in the monoid domain. Finally, …

Commutative N-Ary Arithmetic, Aram Bingham

University of New Orleans Theses and Dissertations

Motivated by primality and integer factorization, this thesis introduces generalizations of standard binary multiplication to commutative n-ary operations based upon geometric construction and representation. This class of operations are constructed to preserve commutativity and identity so that binary multiplication is included as a special case, in order to preserve relationships with ordinary multiplicative number theory. This leads to a study of their expression in terms of elementary symmetric polynomials, and connections are made to results from the theory of polyadic (n-ary) groups. Higher order operations yield wider factorization and representation possibilities which correspond to reductions in the set of primes …

Multiplicative Sets Of Atoms, Ashley Nicole Rand

Doctoral Dissertations

It is possible for an element to have both an atom factorization and a factorization that will always contain a reducible element. This leads us to consider the multiplicatively closed set generated by the atoms and units of an integral domain. We start by showing that for a nice subset S of the atoms of R, there exists an integral domain containing R with set of atoms S. A multiplicatively closed set is saturated if the factors of each element in the set are also elements in the set. Considering polynomial and power series subrings, we find necessary and sufficient …

On The Irreducibility Of The Cauchy-Mirimanoff Polynomials, Brian C. Irick

Doctoral Dissertations

The Cauchy-Mirimanoff Polynomials are a class of polynomials that naturally arise in various classical studies of Fermat's Last Theorem. Originally conjectured to be irreducible over 100 years ago, the irreducibility of the Cauchy-Mirimanoff polynomials is still an open conjecture.

This dissertation takes a new approach to the study of the Cauchy-Mirimanoff Polynomials. The reciprocal transform of a self-reciprocal polynomial is defined, and the reciprocal transforms of the Cauchy-Mirimanoff Polynomials are found and studied. Particular attention is given to the Cauchy-Mirimanoff Polynomials with index three times a power of a prime, and it is shown that the Cauchy-Mirimanoff Polynomials of index …

Wavelet Factorization Via A Homogenization Analogy For Solutions Of Linear Systems, Andrea Van Sickle

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

A system of linear equations can be solved using a factorization method that produces a wavelet structure and is akin to a homogenization process used in determining the solution of differential equations. The method is dependant on the particular structure of Hadamard matrices and their implementation in a similarity transform. This paper details the development of such a method for systems of size 2n x 2n, including establishing the theoretical underpinnings necessary to define an orthogonal transform. Also, we present the development of an algorithm to implement the method for a simple 2 x 2 system, which will then be …