Number Theory Commons^™

Number Theoretic Arithmetic Functions And Dirichlet Series, Ivan V. Morozov

Publications and Research

In this study, we will study number theoretic functions and their associated Dirichlet series. This study lay the foundation for deep research that has applications in cryptography and theoretical studies. Our work will expand known results and venture into the complex plane.

Structure Of Extremal Unit Distance Graphs, Kaylee Weatherspoon

Senior Theses

This thesis begins with a selective overview of problems in geometric graph theory, a rapidly evolving subfield of discrete mathematics. We then narrow our focus to the study of unit-distance graphs, Euclidean coloring problems, rigidity theory and the interplay among these topics. After expounding on the limitations we face when attempting to characterize finite, separable edge-maximal unit-distance graphs, we engage an interesting Diophantine problem arising in this endeavor. Finally, we present a novel subclass of finite, separable edge-maximal unit distance graphs obtained as part of the author's undergraduate research experience.

Ramanujan–Sato Series For 1/Π, Timothy Huber, Daniel Schultz, Dongxi Ye

School of Mathematical & Statistical Sciences Faculty Publications

We compute Ramanujan–Sato series systematically in terms of Thompson series and their modular equations. A complete list of rational and quadratic series corresponding to singular values of the parameters is derived.

Euler Archive Spotlight, Erik R. Tou

Euleriana

A survey of two translations posted to the Euler Archive in 2022.

Using Bloom's Taxonomy For Math Outreach Within And Outside The Classroom, Manmohan Kaur

Journal of Humanistic Mathematics

Not everyone is a great artist, but we don’t often hear, “I dislike art.” Most people are able to appreciate visual arts, music and sports, without necessarily excelling in it themselves. On the other hand, the phrase “I dislike math” is widely prevalent. This is especially ironic in our current society, where mathematics affects our day-to-day activities in essential ways such as e-commerce and e-mail. This paper describes the opportunity to popularize mathematics by focusing on its fun and creative aspects, and illustrates this opportunity through a brief discussion of interdisciplinary topics that expose the beauty, elegance and value of …

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 …

Generalized Far-Difference Representations, Prakod Ngamlamai

HMC Senior Theses

Integers are often represented as a base-$b$ representation by the sum $\sum c_ib^i$. Lekkerkerker and Zeckendorf later provided the rules for representing integers as the sum of Fibonacci numbers. Hannah Alpert then introduced the far-difference representation by providing rules for writing an integer with both positive and negative multiples of Fibonacci numbers. Our work aims to generalize her work to a broader family of linear recurrences. To do so, we describe desired properties of the representations, such as lexicographic ordering, and provide a family of algorithms for each linear recurrence that generate unique representations for any integer. We then prove …

Triangular Modular Curves Of Low Genus And Geometric Quadratic Chabauty, Juanita Duque Rosero

Dartmouth College Ph.D Dissertations

This manuscript consists of two parts. In the first part, we study generalizations of modular curves: triangular modular curves. These curves have played an important role in recent developments in number theory, particularly concerning hypergeometric abelian varieties and approaches to solving generalized Fermat equations. We provide a new result that shows that there are only finitely many Borel-type triangular modular curves of any fixed genus, and we present an algorithm to list all such curves of a given genus.

In the second part of the manuscript, we explore the problem of computing the set of rational points on a smooth, …

Elliptic Functions And Iterative Algorithms For Π, Eduardo Jose Evans

UNF Graduate Theses and Dissertations

Preliminary identities in the theory of basic hypergeometric series, or `q-series', are proven. These include q-analogues of the exponential function, which lead to a fairly simple proof of Jacobi's celebrated triple product identity due to Andrews. The Dedekind eta function is introduced and a few identities of it derived. Euler's pentagonal number theorem is shown as a special case of Ramanujan's theta function and Watson's quintuple product identity is proved in a manner given by Carlitz and Subbarao. The Jacobian theta functions are introduced as special kinds of basic hypergeometric series and various relations between them derived using the triple …

Ambientes De Inclusión Para El Desarrollo Del Pensamiento Numérico Con Población Con Síndrome De Down, Luisa Valeria Escobar Buitrago, Ingry Yuliana Torres Garzón, Juan David Firigua Bejarano

Educación

La importancia de tratar sobre una educación inclusiva es hacer que la humanidad obtenga la aceptación hacia la diversidad, donde se encuentre un mundo lleno de posibilidades reconociendo todos los tipos de población entre ella las personas con Síndrome de Down, lo cual consiste en que la educación esté centrado en el respeto y la valoración de la diversidad, haciendo un enfoque general en las necesidades que esta población tiene, desarrollando habilidades para su desenvolvimiento tanto personal como laboral en determinada sociedad, por lo tanto el objetivo principal de este trabajo es desarrollar el pensamiento numérico de los estudiantes de …

Meertens Number And Its Variations, Chai Wah Wu

Communications on Number Theory and Combinatorial Theory

In 1998, Bird introduced Meertens numbers as numbers that are invariant under a map similar to the Gödel encoding. In base 10, the only known Meertens number is 81312000. We look at some properties of Meertens numbers and consider variations of this concept. In particular, we consider variations of Meertens numbers where there is a finite time algorithm to decide whether such numbers exist, exhibit infinite families of these variations and provide bounds on parameters needed for their existence.

(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.

A Comparison Of Cryptographic Methods, Christopher Gilmore

Senior Honors Theses

While elliptic curve cryptography and quantum cryptography are significantly different branches of cryptography, they provide a suitable reference point for comparison of the value of developing methods used in the present and investing in methods to be used in the future. Elliptic curve cryptography is quite common today, as it is generally secure and efficient. However, as the field of cryptography advances, the value of quantum cryptography’s inherent security from its basic properties should be considered, as a fully realized quantum cryptosystem has the potential to be quite powerful. Ultimately, it is of critical importance to determine the value of …

(Si10-062) Comprehensive Study On Methodology Of Orthogonal Interleavers, Priyanka Agarwal, Shivani Dixit, M. Shukla, Gaurish Joshi

Applications and Applied Mathematics: An International Journal (AAM)

Interleaving permutes the data bits by employing a user defined sequence to reduce burst error which at times exceeds the minimum hamming distance. It serves as the sole medium to distinguish user data in the overlapping channel and is the heart of Interleave Division Multiple Access (IDMA) scheme. Versatility of interleavers relies on various design parameters such as orthogonality, correlation, latency and performance parameters like bit error rate (BER), memory occupancy and computation complexity. In this paper, a comprehensive study of interleaving phenomenon and discussion on numerous interleavers is presented. Also, the BER performance of interleavers using IDMA scheme is …

The Local Lifting Problem For Curves With Quaternion Actions, George Mitchell

Dissertations, Theses, and Capstone Projects

The lifting problem asks whether one can lift Galois covers of curves defined over positive characteristic to Galois covers of curves over characteristic zero. The lifting problem has an equivalent local variant, which asks if a Galois extension of complete discrete valuation rings over positive characteristic, with algebraically closed residue field, can be lifted to characteristic zero. In this dissertation, we content ourselves with the study of the local lifting problem when the prime is 2, and the Galois group of the extension is the group of quaternions. In this case, it is known that certain quaternion extensions cannot be …

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 …

Nessie Notation: A New Tool In Sequential Substitution Systems And Graph Theory For Summarizing Concatenations, Colton Davis

Student Research

While doing research looking for ways to categorize causal networks generated by Sequential Substitution Systems, I created a new notation to compactly summarize concatenations of integers or strings of integers, including infinite sequences of these, in the same way that sums, products, and unions of sets can be summarized. Using my method, any sequence of integers or strings of integers with a closed-form iterative pattern can be compactly summarized in just one line of mathematical notation, including graphs generated by Sequential Substitution Systems, many Primitive Pythagorean Triplets, and various Lucas sequences including the Fibonacci sequence and the sequence of square …

Structure Of Number Theoretic Graphs, Lee Trent

Mathematical Sciences Technical Reports (MSTR)

The tools of graph theory can be used to investigate the structure
imposed on the integers by various relations. Here we investigate two
kinds of graphs. The first, a square product graph, takes for its vertices
the integers 1 through n, and draws edges between numbers whose product
is a square. The second, a square product graph, has the same vertex set,
and draws edges between numbers whose sum is a square.
We investigate the structure of these graphs. For square product
graphs, we provide a rather complete characterization of their structure as
a union of disjoint complete graphs. For …

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 …

Symmetric Presentations Of Finite Groups And Related Topics, Samar Mikhail Kasouha

Electronic Theses, Projects, and Dissertations

A progenitor is an infinite semi-direct product of the form m∗n : N, where N ≤ Sn and m∗n : N is a free product of n copies of a cyclic group of order m. A progenitor of this type, in particular 2∗n : N, gives finite non-abelian simple groups and groups involving these, including alternating groups, classical groups, and the sporadic group. We have conducted a systematic search of finite homomorphic images of numerous progenitors. In this thesis we have presented original symmetric presentations of the sporadic simple groups, M12, J1 as homomorphic images of the progenitor 2∗12 : …

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.

A Study Of Semiprime Arithmetic Sequences, Sam C. Uselton

Honors Scholars Collaborative Projects

Semiprimes are positive integers of the form n = p*q where p and q are primes that are not necessarily distinct. Semiprimes can occur in arithmetic sequence, and the upper bound changes depending on the distance, d, between semiprimes in the sequence. The goal of this work is to present and prove theorems for different cases of semiprime arithmetic sequences, including d = 2k+1 where k is greater than or equal to 0 and d=2k where k is positive and not a multiple of 3, as well as a general case for finding upper bounds for varying distances. The building …

A Strange Attractor Of Primes, Alexander Hare

ONU Student Research Colloquium

The greatest prime factor sequences (GPF sequences), born at ONU in 2005, are integer sequences satisfying recursions in which every term is the greatest prime factor of a linear combination with positive integer coefficients of the preceding k terms (where k is the order of the sequence), possibly including a positive constant. The very first GPF sequence that was introduced satisfies the recursion x(n+1)=GPF(2*x(n)+1). In 2005 it was conjectured that no matter the seed, this particular GPF sequence enters the limit cycle (attractor) 3-7-5-11-23-47-19-13. In our current work, of a computational nature, we introduce the functions “depth” – where depth(n) …

An Introduction To Number Theory, J. J. P. Veerman

PDXOpen: Open Educational Resources

These notes are a preliminary text intended for a graduate course in Number Theory. A thoroughly improved, revised, and expanded version of this book will be published in 2026 through Springer under the title Numbers from All Angles.

Chapters 1-14 of this preliminary text represent almost 3 trimesters of the course. No prior familiarity with number theory is assumed. The current content represents courses the author taught in the academic years 2020-2021 and 2021-2022.

Provably Weak Instances Of Plwe Revisited, Again, Katherine Mendel

CSB and SJU Distinguished Thesis

Learning with Errors has emerged as a promising possibility for postquantum cryptography. Variants known as RLWE and PLWE have been shown to be more efficient, but the increased structure can leave them vulnerable to attacks for certain instantiations. This work aims to identify specific cases where proposed cryptographic schemes based on PLWE work particularly poorly under a specific attack.

Plane Figurate Number Proofs Without Words Explained With Pattern Blocks, Gunhan Caglayan

Journal of Humanistic Mathematics

This article focuses on an artistic interpretation of pattern block designs with primary focus on the connection between pattern blocks and plane figurate numbers. Through this interpretation, it tells the story behind a handful of proofs without words (PWWs) that are inspired by such pattern block designs.