Number Theory Commons^™

Determinants And Invertibility In Finite Modular Systems, Osasu Omobude

Discovery Day - Daytona Beach

This project investigates determinants and matrix invertibility in finite modular systems, focusing on matrices over Zn. Using the Hill cipher as context, it examines the algebraic conditions under which a matrix is invertible in modular arithmetic. In particular, the project studies how the determinant determines invertibility, showing that a matrix over Zn is invertible if and only if its determinant is coprime with n.   The project further compares invertibility over the real numbers with invertibility over modular systems, highlighting the distinction between prime moduli Zp and composite moduli. In the prime case, matrices behave similarly to those over fields, where …

Gauss Composition And Orthogonal Modular Forms On Binary Lattices, Haochen Wu

Dartmouth College Ph.D Dissertations

We revisit Gauss composition over a general base scheme, with a focus on orthogonal groups. We show that the Clifford and norm functors provide a discriminant-preserving equivalence of categories between binary quadratic modules and pseudoregular modules over quadratic algebras. This perspective synthesizes the constructions of Kneser and Wood, reconciling algebraic and geometric approaches and clarifying the role of orientations and the natural emergence of narrow class groups.

As an application, we restrict to lattices and show that binary orthogonal eigenforms correspond to Hecke characters. Using theta series, we show the explicit connection between Hilbert modular forms and orthogonal modular forms …

Numerical And Harmonic Analysis Of Simplex Number Parity, Hunter Dm Hannula

All NMU Master's Theses

The primary object of this thesis is the study of periodicity in the parity of simplex numbers by number-theoretic and harmonic methods. The regular d-simplex numbers are introduced geometrically, arithmetically, and combinatorially. We demonstrate that all sequences indexing even d-simplex numbers are defined by finitely many congruences in a single modulus, and are thus quasiperiodic. We therefore show that these "even index-sequences" are  particular elements in an affine space of functions, providing a natural decomposition result. We then introduce the discrete Fourier transform to construct the periodic parts of each index sequence, enabling the development of explicit forms for the …

(R2094) On Mds Bisymmetric Rhotrices Using Self-Dual Bases And Conjugate Elements Of Finite Fields, Shalini Gupta, Ruchi Narang, Manpreet Singh

Applications and Applied Mathematics: An International Journal (AAM)

Bisymmetric matrices have wide range of applications in statistics, engineering problems, information theory and computer science including coding theory and cryptography. In cryptography, a rhotrix being a couple matrix doubles the security of the cryptosystem. Here, we construct maximum distance separable (MDS) bisymmetric rhotrices using self-dual bases and conjugate elements of finite fields. MDS rhotrices are very crucial for the designing of block ciphers and hash functions in cryptography.

(Si15-064) Permutation Pentanomials Over Finite Fields With Even Characteristic, Shalini Gupta, Sushil Kumar, Ashima .

Applications and Applied Mathematics: An International Journal (AAM)

Permutation polynomials over finite fields constitute an active area of research and play an important role in diverse domains, including finite geometry, combinatorial design, coding theory, and cryptography. The study of these polynomials has a long history, and many results have been obtained in recent years. This paper presents new classes of permutation pentanomials based on permutation over the unit circle of finite fields with even characteristic that contribute to the theoretical development of permutation polynomials.

Universal Centralizers, Morita Abelianization, And Wonderful Models In Lie Theory, Peter Crooks

Funded Research Records

No abstract provided.

Langlands Reciprocity And The Splitting Behavior Of Primes In Number Fields, Skip E. Moses

Master's Theses

This thesis explores the evolution of reciprocity laws in number theory in order to provide a conceptual bridge between the classical ideas of quadratic reciprocity and the modern framework of the Langlands program. We develop the necessary algebraic background to understand how the splitting behavior of primes in number fields reflects deep arithmetic structure in ℚ. Starting with quadratic fields and cyclotomic extensions, we motivate the development of the Kronecker–Weber theorem and the characterization of abelian extensions of ℚ. We then introduce Artin reciprocity and show how it generalizes quadratic reciprocity through the formalism of Frobenius elements and Artin L-functions. …

Explicit Modularity And Moments For Certain Hypergeometric Character Sums, Brian Grove

LSU Doctoral Dissertations

A great deal of progress in number theory throughout history has been motivated by trying to solve equations. One of the most famous challenges is to show there are no positive integer solutions to $x^{n}+y^{n} = z^{n}$ for $n > 2$, posed by Fermat around 1637. Special cases, such as the $n = 3$ and $n = 4$ cases, can be established using various algebraic manipulations. However, a general solution was elusive until the late 1990s when the combined work of Wiles \cite{Wiles} and Taylor--Wiles \cite{TaylorWiles} give a full proof.

One of the key insights used in proving Fermat's conjecture involves …

Proportion Of P-Adic Polynomials Which Are Irreducible, Isaac Rajagopal

Rose-Hulman Undergraduate Mathematics Journal

We attempt to quantify the exact proportion of p-adic polynomials of degree n which are irreducible. We find an exact answer to this when n is prime and p != n, and also when n = 4 and p != 2. Our answers are rational functions in p. This relates to previous work done to find exact proportions of p-adic polynomials of degree n which have k roots.

Prime Factorization And Unit Calculations Of Quadratic Integer Rings, Gabriel F. Roca

Honors Undergraduate Theses

The failure of unique factorization in a ring leads to the investigation of the closest algebraic structure, which are prime ideals. Using generalizations that have helped solve questions such as Fermat's Last Theorem, there is interest to study the elements with a multiplicative inverse (units) via the geometry and arithmetic patterns that arise in quadratic integer rings, since they provide tools for other questions in mathematics, ranging from pure algebra to applications in cryptography, and more. Overall, the following thesis provides a small exposition on the theory of integral domains and some specific calculations.

Noncrystallographic Tail-Triangle C-Groups Of Rank 4 And Interlacing Number 2, Mark L. Loyola, Nonie Elvin S. Leyrita, Ma. Louise Antonette N. De Las Peñas

Mathematics Faculty Publications

This work applies the modular reduction technique to the Coxeter group of rank 4 having a star diagram with labels 5, 3, and k = 3,4,5, or 6. As moduli, we use the primes in the quadratic integer ring Z[τ], where τ = (1+√5)/2, the golden ratio. We prove that each reduced group is a C-group, regardless of the prime used in the reduction. We also classify each reduced group as a reflection group over a finite field, whenever applicable.

Diagrams In Involutive Residuated Lattices, Isis A. Gallardo

Electronic Theses and Dissertations

First, we show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thereby improving the existing Cayley/Holland style embedding theorem. Using this result, we demonstrate that the variety of all dis tributive lattice-ordered pregroups is generated by the functional algebra on the integers. Additionally, we prove that the equational theory of this variety is decidable.

Next, we establish that DLP is equal to the join of its subvarieties LP_n, where 𝑛 ∈ ℤ⁺, consisting of 𝑛-periodic ℓ-pregroups. We also prove that every algebra in LP_n can be embedded …

Relating Elasticity And Other Multiplicative Properties Among Orders In Number Fields And Related Rings, Grant Moles

All Dissertations

This dissertation will explore factorization within orders in a number ring. By far the most well-understood of these orders are rings of algebraic integers. We will begin by examining how certain types of subrings may relate to the larger rings in which they are contained. We will then apply this knowledge, along with additional techniques, to determine how the elasticity in an order relates to the elasticity of the full ring of algebraic integers. Using many of the same strategies, we will develop a corresponding result in the rings of formal power series. Finally, we will explore a number of …

Explicit Composition Identities For Higher Composition Laws In The Quadratic Case, Ajith A. Nair

Dissertations, Theses, and Capstone Projects

The theory of Gauss composition of integer binary quadratic forms provides a very useful way to compute the structure of ideal class groups in quadratic number fields. In addition to that, Gauss composition is also important in the problem of representations of integers by binary quadratic forms. In 2001, Bhargava discovered a new approach to Gauss composition which uses 2x2x2 integer cubes, and he proved a composition law for such cubes. Furthermore, from the higher composition law on cubes, he derived four new higher composition laws on the following spaces - 1) binary cubic forms, 2) pairs of binary quadratic …

Boolean Group Structure In Class Groups Of Positive Definite Quadratic Forms Of Primitive Discriminant, Christopher Albert Hudert Jr.

Departmental Honors & Graduate Capstone Projects

It is possible to completely describe the representation of any integer by binary quadratic forms of a given discriminant when the discriminant’s class group is a Boolean group (also known as an elementary abelian 2-group). For other discriminants, we can partially describe the representation using the structure of the class group. The goal of the present project is to find whether any class group with 32 elements and a primitive positive definite discriminant is a Boolean group. We find that no such class group is Boolean.

Rsa Algorithm, Evalisbeth Garcia Diazbarriga

ATU Scholars Symposium

I will be presenting about the RSA method in cryptology which is the coding and decoding of messages. My research will focus on proving that the method works and how it is used to communicate secretly.

Pairs Of Quadratic Forms Over P-Adic Fields, John Hall

Theses and Dissertations--Mathematics

Given two quadratic forms $Q_1, Q_2$ over a $p$-adic field $K$ in $n$ variables, we consider the pencil $\mathcal{P}_K(Q_1, Q_2)$, which contains all nontrivial $K$-linear combinations of $Q_1$ and $Q_2$. We define $D$ to be the maximal dimension of a subspace in $K^n$ on which $Q_1$ and $Q_2$ both vanish. We define $H$ to be the maximal number of hyperbolic planes that a form in $\mathcal{P}_K(Q_1, Q_2)$ splits off over $K$. We will determine which values for $(D, H)$ are possible for a nonsingular pair of quadratic forms over a $p$-adic field $K$.

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 …

Algebraic And Integral Closure Of A Polynomial Ring In Its Power Series Ring, Joseph Swanson

All Dissertations

Let R be a domain. We look at the algebraic and integral closure of a polynomial ring, R[x], in its power series ring, R[[x]]. A power series α(x) ∈ R[[x]] is said to be an algebraic power series if there exists F (x, y) ∈ R[x][y] such that F (x, α(x)) = 0, where F (x, y) ̸ = 0. If F (x, y) is monic, then α(x) is said to be an integral power series. We characterize the units of algebraic and integral power series. We show that the only algebraic power series with infinite radii of convergence are …

(R2050) Dual Quaternion Matrices And Matlab Applications, Kemal Gökhan Nalbant, Salim Yüce

Applications and Applied Mathematics: An International Journal (AAM)

There are many studies in the literature on real quaternions and real quaternion matrices. There are few studies in the literature on dual quaternions. Definitions of the matrices of dual quaternions used in this study will be given. The originality of our research, the set of dual quaternion matrix we studied, will be defined for the first time in this study, and its properties will be given. Moreover, this study is critical because it is an applied study related to dual quaternion matrices. It will be easier to solve examples with large matrix sizes with MATLAB. People who use different …

Unique Factorization In The Rings Of Integers Of Quadratic Fields: A Method Of Proof, Zachary Warren

Senior Honors Theses

It is a well-known property of the integers, that given any nonzero a ∈ Z, where a is not a unit, we are able to write a as a unique product of prime numbers. This is because the Fundamental Theorem of Arithmetic (FTA) holds in the integers and guarantees (1) that such a factorization exists, and (2) that it is unique. As we look at other domains, however, specifically those of the form O(√D) = {a + b√D | a, b ∈ Z, D a negative, squarefree integer}, we find that …

A Visual Tour Of Dynamical Systems On Color Space, Jonathan Maltsman

HMC Senior Theses

We can think of a pixel as a particle in three dimensional space, where its x, y and z coordinates correspond to its level of red, green, and blue, respectively. Just as a particle’s motion is guided by physical rules like gravity, we can construct rules to guide a pixel’s motion through color space. We can develop striking visuals by applying these rules, called dynamical systems, onto images using animation engines. This project explores a number of these systems while exposing the underlying algebraic structure of color space. We also build and demonstrate a Visual DJ circuit board for …

Elliptic Curves Over Finite Fields, Christopher S. Calger

Honors Theses

The goal of this thesis is to give an expository report on elliptic curves over finite fields. We begin by giving an overview of the necessary background in algebraic geometry to understand the definition of an elliptic curve. We then explore the general theory of elliptic curves over arbitrary fields, such as the group structure, isogenies, and the endomorphism ring. We then study elliptic curves over finite fields. We focus on the number of F_q-rational solutions, Tate modules, supersingular curves, and applications to elliptic curves over Q. In particular, we approach the topic largely through the use …

(R1979) Permanent Of Toeplitz-Hessenberg Matrices With Generalized Fibonacci And Lucas Entries, Hacène Belbachir, Amine Belkhir, Ihab-Eddine Djellas

Applications and Applied Mathematics: An International Journal (AAM)

In the present paper, we evaluate the permanent and determinant of some Toeplitz-Hessenberg matrices with generalized Fibonacci and generalized Lucas numbers as entries.We develop identities involving sums of products of generalized Fibonacci numbers and generalized Lucas numbers with multinomial coefficients using the matrix structure, and then we present an application of the determinant of such matrices.

The Hfd Property In Orders Of A Number Field, Grant Moles

All Theses

We will examine orders R in a number field K. In particular, we will look at how the generalized class number of R relates to the class number of its integral closure R. We will then apply this to the case when K is a quadratic field to produce a more specific relation. After this, we will focus on orders R which are half-factorial domains (HFDs), in which the irreducible factorization of any element α∈R has fixed length. We will determine two cases in which R is an HFD if and only if its ring of …

Efficiency Of Homomorphic Encryption Schemes, Kyle Yates

All Theses

In 2009, Craig Gentry introduced the first fully homomorphic encryption scheme using bootstrapping. In the 13 years since, a large amount of research has gone into improving efficiency of homomorphic encryption schemes. This includes implementing leveled homomorphic encryption schemes for practical use, which are schemes that allow for some predetermined amount of additions and multiplications that can be performed on ciphertexts. These leveled schemes have been found to be very efficient in practice. In this thesis, we will discuss the efficiency of various homomorphic encryption schemes. In particular, we will see how to improve sizes of parameter choices in homomorphic …

Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.

Now there are three difficulty tiers to POW problems, roughly corresponding to …

On Isomorphic K-Rational Groups Of Isogenous Elliptic Curves Over Finite Fields, Ben Kuehnert, Geneva Schlafly, Zecheng Yi

Rose-Hulman Undergraduate Mathematics Journal

It is well known that two elliptic curves are isogenous if and only if they have same number of rational points. In fact, isogenous curves can even have isomorphic groups of rational points in certain cases. In this paper, we consolidate all the current literature on this relationship and give a extensive classification of the conditions in which this relationship arises. First we prove two ordinary isogenous elliptic curves have isomorphic groups of rational points when they have the same $j$-invariant. Then, we extend this result to certain isogenous supersingular elliptic curves, namely those with equal $j$-invariant of either 0 …

The Examination Of The Arithmetic Surface (3, 5) Over Q, Rachel J. Arguelles

Electronic Theses, Projects, and Dissertations

This thesis is centered around the construction and analysis of the principal arithmetic surface (3, 5) over Q. By adjoining the two symbols i,j, where i² = 3, j² = 5, such that ij = -ji, I can produce a quaternion algebra over Q. I use this quaternion algebra to find a discrete subgroup of SL₂(R), which I identify with isometries of the hyperbolic plane. From this quaternion algebra, I produce a large list of matrices and apply them via Mobius transformations to the point (0, 2), which is the center of my Dirichlet domain. This …

John Horton Conway: The Man And His Knot Theory, Dillon Ketron

Electronic Theses and Dissertations

John Horton Conway was a British mathematician in the twentieth century. He made notable achievements in fields such as algebra, number theory, and knot theory. He was a renowned professor at Cambridge University and later Princeton. His contributions to algebra include his discovery of the Conway group, a group in twenty-four dimensions, and the Conway Constellation. He contributed to number theory with his development of the surreal numbers. His Game of Life earned him long-lasting fame. He contributed to knot theory with his developments of the Conway polynomial, Conway sphere, and Conway notation.