Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Number Theory (65)
- Algebra (17)
- Other Mathematics (10)
- Discrete Mathematics and Combinatorics (8)
- Analysis (7)
-
- Applied Mathematics (7)
- Education (7)
- Science and Mathematics Education (7)
- Arts and Humanities (6)
- Algebraic Geometry (5)
- Curriculum and Instruction (5)
- Educational Methods (5)
- Higher Education (4)
- Computer Sciences (3)
- Christianity (2)
- Creative Writing (2)
- Dynamical Systems (2)
- Fiction (2)
- Logic and Foundations (2)
- Logic and Foundations of Mathematics (2)
- Philosophy (2)
- Physics (2)
- Probability (2)
- Religion (2)
- Statistics and Probability (2)
- Theory and Algorithms (2)
- Geometry and Topology (1)
- Information Security (1)
- Institution
-
- California State University, San Bernardino (12)
- Claremont Colleges (11)
- City University of New York (CUNY) (5)
- Rose-Hulman Institute of Technology (5)
- University of New Mexico (5)
-
- University of Texas Rio Grande Valley (4)
- University of the Pacific (4)
- Ursinus College (4)
- University of Kentucky (3)
- University of Minnesota Morris Digital Well (3)
- Boise State University (2)
- Butler University (2)
- Dordt University (2)
- East Tennessee State University (2)
- Georgia Southern University (2)
- Gettysburg College (2)
- Old Dominion University (2)
- Portland State University (2)
- University of Connecticut (2)
- University of South Carolina (2)
- Utah State University (2)
- Bemidji State University (1)
- Brigham Young University (1)
- Dartmouth College (1)
- DePauw University (1)
- Eastern Michigan University (1)
- Georgia Academy of Science (1)
- Jacksonville State University (1)
- Kutztown University (1)
- Lawrence University (1)
- Publication Year
- Publication
-
- Theses Digitization Project (9)
- Branch Mathematics and Statistics Faculty and Staff Publications (5)
- Theses and Dissertations (5)
- Euleriana (4)
- Journal of Humanistic Mathematics (4)
-
- Number Theory (4)
- Rose-Hulman Undergraduate Mathematics Journal (4)
- Electronic Theses, Projects, and Dissertations (3)
- Publications and Research (3)
- Boise State University Theses and Dissertations (2)
- CGU Theses & Dissertations (2)
- CMC Senior Theses (2)
- Electronic Theses and Dissertations (2)
- Journal of the Minnesota Academy of Science (2)
- Mathematics & Statistics Faculty Publications (2)
- Pro Rege (2)
- Student Research (2)
- Theses and Dissertations--Mathematics (2)
- Undergraduate Honors Thesis Collection (2)
- A with Honors Projects (1)
- Abraham S. Fischler College of Education and School of Criminal Justice College Archive (1)
- All Graduate Theses and Dissertations, Fall 2023 to Present (1)
- CMC Faculty Publications and Research (1)
- College of Graduate Studies: Theses & Dissertations (1)
- Communications on Number Theory and Combinatorial Theory (1)
- Dartmouth College Ph.D Dissertations (1)
- Dissertations (1)
- Dissertations, Theses, and Capstone Projects (1)
- Funded Research Records (1)
- Georgia Journal of Science (1)
- Publication Type
Articles 31 - 60 of 99
Full-Text Articles in Mathematics
Nessie Notation: A New Tool In Sequential Substitution Systems And Graph Theory For Summarizing Concatenations, Colton Davis
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
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
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 i2 = 3, j2 = 5, such that ij = -ji, I can produce a quaternion algebra over Q. I use this quaternion algebra to find a discrete subgroup of SL2(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 …
Some Properties And Applications Of Spaces Of Modular Forms With Eta-Multiplier, Cuyler Daniel Warnock
Some Properties And Applications Of Spaces Of Modular Forms With Eta-Multiplier, Cuyler Daniel Warnock
Theses and Dissertations
This dissertation considers two topics. In the first part of the dissertation, we prove the existence of fourteen congruences for the $p$-core partition function of the form given by Garvan in \cite{G1}. Different from the congruences given by Garvan, each of the congruences we give yield infinitely many congruences of the form $$a_p(\ell\cdot p^{t+1} \cdot n + p^t \cdot k - \delta_p) \equiv 0 \pmod \ell.$$ For example, if $t \geq 0$ and $\sfrac{m}{n}$ is the Jacobi symbol, then we prove $$a_7(7^t \cdot n - 2) \equiv 0 \pmod 5, \text{ \ \ if $\bfrac{n}{5} = 1$ and $\bfrac{n}{7} = …
Graphs, Local Zeta Functions, Log-Coulomb Gases, And Phase Transitions At Finite Temperature, Wilson A. Zuniga-Galindo, Brian A. Zambrano-Luna, E. León-Cardenal
Graphs, Local Zeta Functions, Log-Coulomb Gases, And Phase Transitions At Finite Temperature, Wilson A. Zuniga-Galindo, Brian A. Zambrano-Luna, E. León-Cardenal
School of Mathematical & Statistical Sciences Faculty Publications
We study a log-gas on a network (a finite, simple graph) confined in a bounded subset of a local field (i.e., R, C, and Qp being the field of p-adic numbers). In this gas, a log-Coulomb interaction between two charged particles occurs only when the sites of the particles are connected by an edge of the network. The partition functions of such gases turn out to be a particular class of multivariate local zeta functions attached to the network and a positive test function, which is determined by the confining potential. The methods and results of the theory of local …
Streaming Down The Stern-Brocot Tree: Finding And Expressing Solutions To Pell's Equation In Sl(2,Z), Marcus L. Shell
Streaming Down The Stern-Brocot Tree: Finding And Expressing Solutions To Pell's Equation In Sl(2,Z), Marcus L. Shell
Theses
This paper explores and elaborates on a method of solving Pell’s equation as introduced by Norman Wildberger. In the first chapters of the paper, foundational topics are introduced in expository style including an explanation of Pell’s equation. An explanation of continued fractions and their ability to express quadratic irrationals is provided as well as a connection to the Stern-Brocot tree and a convenient means of representation for each in terms of 2×2 matrices with integer elements. This representation will provide a useful way of navigating the Stern-Brocot tree computationally and permit us a means of computing continued fractions without the …
The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall
The Generalized Riemann Hypothesis And Applications To Primality Testing, Peter Hall
University Scholar Projects
The Riemann Hypothesis, posed in 1859 by Bernhard Riemann, is about zeros
of the Riemann zeta-function in the complex plane. The zeta-function can be repre-
sented as a sum over positive integers n of terms 1/ns when s is a complex number
with real part greater than 1. It may also be represented in this region as a prod-
uct over the primes called an Euler product. These definitions of the zeta-function
allow us to find other representations that are valid in more of the complex plane,
including a product representation over its zeros. The Riemann Hypothesis says that
all …
Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang
Zeta Function Regularization And Its Relationship To Number Theory, Stephen Wang
Electronic Theses and Dissertations
While the "path integral" formulation of quantum mechanics is both highly intuitive and far reaching, the path integrals themselves often fail to converge in the usual sense. Richard Feynman developed regularization as a solution, such that regularized path integrals could be calculated and analyzed within a strictly physics context. Over the past 50 years, mathematicians and physicists have retroactively introduced schemes for achieving mathematical rigor in the study and application of regularized path integrals. One such scheme was introduced in 2007 by the mathematicians Klaus Kirsten and Paul Loya. In this thesis, we reproduce the Kirsten and Loya approach to …
A Case Study On Hooley's Conditional Proof Of Artin's Primitive Root Conjecture, Shalome Kurian
A Case Study On Hooley's Conditional Proof Of Artin's Primitive Root Conjecture, Shalome Kurian
Rose-Hulman Undergraduate Mathematics Journal
Artin’s Primitive Root Conjecture represents one of many famous problems in elementary number theory that has resisted complete solution thus far. Significant progress was made in 1967, when Christopher Hooley published a conditional proof of the conjecture under the assumption of a certain case of the Generalised Riemann Hypothesis. In this survey we present a description of the conjecture and the underlying algebraic theory, and provide a detailed account of Hooley’s proof which is intended to be accessible to those with only undergraduate level knowledge. We also discuss a result concerning the qx+1 problem, whose proof requires similar techniques to …
On The Local Theory Of Profinite Groups, Mohammad Shatnawi
On The Local Theory Of Profinite Groups, Mohammad Shatnawi
Dissertations
Let G be a finite group, and H be a subgroup of G. The transfer homomorphism emerges from the natural action of G on the cosets of H. The transfer was first introduced by Schur in 1902 [22] as a construction in group theory, which produce a homomorphism from a finite group G into H/H' an abelian group where H is a subgroup of G and H' is the derived group of H. One important first application is Burnside’s normal p-complement theorem [5] in 1911, although he did not use the transfer homomorphism explicitly to prove it. …
The Name Tag Problem, Christian Carley
The Name Tag Problem, Christian Carley
Rose-Hulman Undergraduate Mathematics Journal
The Name Tag Problem is a thought experiment that, when formalized, serves as an introduction to the concept of an orthomorphism of $\Zn$. Orthomorphisms are a type of group permutation and their graphs are used to construct mutually orthogonal Latin squares, affine planes and other objects. This paper walks through the formalization of the Name Tag Problem and its linear solutions, which center around modular arithmetic. The characterization of which linear mappings give rise to these solutions developed in this paper can be used to calculate the exact number of linear orthomorphisms for any additive group Z/nZ, which is demonstrated …
An In-Depth Look At P-Adic Numbers, Xiaona Zhou
An In-Depth Look At P-Adic Numbers, Xiaona Zhou
Publications and Research
In this study, we consider $p$-adic numbers. We will also study the $p$-adic norm representation of real number, which is defined as $\mathbb{Q}_p = \{\sum_{j=m}^{\infty }a_j p^j: a_j \in \mathbb{D}_p, m\in\mathbb{Z}, a_m\neq 0\} \cup \{0\}$, where $p$ is a prime number. We explore properties of the $p$-adics by using examples. In particular, we will show that $\sqrt{6},i \in \mathbb{Q}_5$ and $\sqrt{2} \in \mathbb{Q}_7 $. $p$-adic numbers have a wide range of applicationsnin fields such as string theory, quantum mechanics, and transportation in porous disordered media in geology.
On The Equality Case Of The Ramanujan Conjecture For Hilbert Modular Forms, Liubomir Chiriac
On The Equality Case Of The Ramanujan Conjecture For Hilbert Modular Forms, Liubomir Chiriac
Mathematics and Statistics Faculty Publications and Presentations
The generalized Ramanujan Conjecture for cuspidal unitary automorphic representations π on GL(2) asserts that |av(π)| ≤ 2. We prove that this inequality is strict if π is generated by a CM Hilbert modular form of parallel weight two and v is a finite place of degree one. Equivalently, the Satake parameters of πv are necessarily distinct. We also give examples where the equality case does occur for primes of degree two.
Inquiry In Inquiry: A Classification Of The Learning Theories Underlying Inquiry-Based Undergraduate Number Theory Texts, Rebecca L. Butler
Inquiry In Inquiry: A Classification Of The Learning Theories Underlying Inquiry-Based Undergraduate Number Theory Texts, Rebecca L. Butler
Honors Projects
While undergraduate inquiry-based texts in number theory share similar approaches with respect to learning as the embodiment of professional practice, this does not entail that these texts all operate from the same fundamental understanding of what it means to learn mathematics. In this paper, the instructional design of several texts of the aforementioned types are analyzed to assess the theory of learning under which they operate. From this understanding of the different theories of learning employed in an inquiry-based mathematical setting, one can come to understand the popular model of what it is to learn number theory in a meaningful …
Dedekind Sums: Properties And Applications To Number Theory And Lattice Point Enumeration, Oliver Meldrum
Dedekind Sums: Properties And Applications To Number Theory And Lattice Point Enumeration, Oliver Meldrum
Honors Papers
In this paper, we will explore the origins, applications, and properties of these sums and one of their generalizations. We seek to explain what these sums represent and how they behave by exploring some of their arithmetic properties. In addition, we hope to show the reader why one should care about these sums. We do this by presenting two important areas in which these sums appear: number theory and the study of enumerating lattice points inside of polytopes.
Identities For Partitions Of N With Parts From A Finite Set, Acadia Larsen
Identities For Partitions Of N With Parts From A Finite Set, Acadia Larsen
Theses and Dissertations
We show for a prime power number of parts m that the first differences of partitions into at most m parts can be expressed as a non-negative linear combination of partitions into at most m – 1 parts. To show this relationship, we combine a quasipolynomial construction of p(n,m) with a new partition identity for a finite number of parts. We prove these results by providing combinatorial interpretations of the quasipolynomial of p(n,m) and the new partition identity. We extend these results by establishing conditions for when partitions of n with parts coming from …
Vector Partitions, Jennifer French
Vector Partitions, Jennifer French
Electronic Theses and Dissertations
Integer partitions have been studied by many mathematicians over hundreds of years. Many identities exist between integer partitions, such as Euler’s discovery that every number has the same amount of partitions into distinct parts as into odd parts. These identities can be proven using methods such as conjugation or generating functions. Over the years, mathematicians have worked to expand partition identities to vectors. In 1963, M. S. Cheema proved that every vector has the same number of partitions into distinct vectors as into vectors with at least one component odd. This parallels Euler’s result for integer partitions. The primary purpose …
Pgl2(FL) Number Fields With Rational Companion Forms, David P. Roberts
Pgl2(FL) Number Fields With Rational Companion Forms, David P. Roberts
Mathematics Publications
We give a list of PGL2(Fl) number fields for ℓ ≥ 11 which have rational companion forms. Our list has fifty-three fields and seems likely to be complete. Some of the fields on our list are very lightly ramified for their Galois group.
Number Theory: Niven Numbers, Factorial Triangle, And Erdos' Conjecture, Sarah Riccio
Number Theory: Niven Numbers, Factorial Triangle, And Erdos' Conjecture, Sarah Riccio
Mathematics Undergraduate Publications
In this paper, three topics in number theory will be explored: Niven Numbers, the Factorial Triangle, and Erdos's Conjecture . For each of these topics, the goal is for us to find patterns within the numbers which help us determine all possible values in each category. We will look at two digit Niven Numbers and the set that they belong to, the alternating summation of the rows of the Factorial Triangle, and the unit fractions whose sum is the basis of Erdos' Conjecture.
Generating Pythagorean Triples: A Gnomonic Exploration, Janet Heine Barnett
Generating Pythagorean Triples: A Gnomonic Exploration, Janet Heine Barnett
Number Theory
No abstract provided.
The Pell Equation In India, Toke Knudsen, Keith Jones
The Pell Equation In India, Toke Knudsen, Keith Jones
Number Theory
No abstract provided.
Primes, Divisibility, And Factoring, Dominic Klyve
Primes, Divisibility, And Factoring, Dominic Klyve
Number Theory
No abstract provided.
Generating Pythagorean Triples: The Methods Of Pythagoras And Of Plato Via Gnomons, Janet Heine Barnett
Generating Pythagorean Triples: The Methods Of Pythagoras And Of Plato Via Gnomons, Janet Heine Barnett
Number Theory
No abstract provided.
Properties Enjoyed By The Highest Digit In A Base Other Than The Base 10, Sudhir Goel, Kathy Simons
Properties Enjoyed By The Highest Digit In A Base Other Than The Base 10, Sudhir Goel, Kathy Simons
Georgia Journal of Science
The number nine in base ten enjoys some nice arithmetic properties. In this paper, we show that these properties are not intrinsic to the number nine; in fact, they are true for the largest digit in any base b. Four properties involving the final sums of all the digits of a number in a non-decimal base are explored and proofs of these properties are given in the appendix.
Problem Book On Higher Algebra And Number Theory, Ryanto Putra
Problem Book On Higher Algebra And Number Theory, Ryanto Putra
Theses and Dissertations
This book is an attempt to provide relevant end-of-section exercises, together with their step-by-step solutions, to Dr. Zieschang's classic class notes Higher Algebra and Number Theory. It's written under the notion that active hands-on working on exercises is an important part of learning, whereby students would see the nuance and intricacies of a math concepts which they may miss from passive reading. The problems are selected here to provide background on the text, examples that illuminate the underlying theorems, as well as to fill in the gaps in the notes.
Numbers In Base B That Generate Primes With Help The Luhn Function Of Order Ω, Florentin Smarandache, Octavian Cira
Numbers In Base B That Generate Primes With Help The Luhn Function Of Order Ω, Florentin Smarandache, Octavian Cira
Branch Mathematics and Statistics Faculty and Staff Publications
We put the problem to determine the sets of integers in base b ≥ 2 that generate primes with using a function.
On P-Adic Fields And P-Groups, Luis A. Sordo Vieira
On P-Adic Fields And P-Groups, Luis A. Sordo Vieira
Theses and Dissertations--Mathematics
The dissertation is divided into two parts. The first part mainly treats a conjecture of Emil Artin from the 1930s. Namely, if f = a_1x_1^d + a_2x_2^d +...+ a_{d^2+1}x^d where the coefficients a_i lie in a finite unramified extension of a rational p-adic field, where p is an odd prime, then f is isotropic. We also deal with systems of quadratic forms over finite fields and study the isotropicity of the system relative to the number of variables. We also study a variant of the classical Davenport constant of finite abelian groups and relate it to the isotropicity of diagonal …
Realizing Tournaments As Models For K-Majority Voting, Gina Marie Cheney
Realizing Tournaments As Models For K-Majority Voting, Gina Marie Cheney
Electronic Theses, Projects, and Dissertations
A k-majority tournament is a directed graph that models a k-majority voting scenario, which is realized by 2k - 1 rankings, called linear orderings, of the vertices in the tournament. Every k-majority voting scenario can be modeled by a tournament, but not every tournament is a model for a k-majority voting scenario. In this thesis we show that all acyclic tournaments can be realized as 2-majority tournaments. Further, we develop methods to realize certain quadratic residue tournaments as k-majority tournaments. Thus, each tournament within these classes of tournaments is a model for a k …
A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot
A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot
College of Graduate Studies: Theses & Dissertations
Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition function. Following later improvements by Rademacher, the method was utilized by Niven, Lehner, Iseki, and others to develop rapidly convergent series representations of various restricted partition functions. Following in this tradition, we use the circle method to develop formulas for counting the restricted classes of partitions that arise in the Gollnitz-Gordon identities. We then show that our results are strongly supported by numerical tests. As a side note, we also derive and compare the asymptotic behavior …
A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero
A Computational And Theoretical Exploration Of The St. Petersburg Paradox, Alexander Olivero
Undergraduate Honors Thesis Collection
This thesis displays a sample distribution, generated from both a simulation (for large n) by computer program and explicitly calculated (for smaller n), that is not governed by the Central Limit Theorem and, in fact seems to display chaotic behavior. To our knowledge, the explicit calculation of the sample distribution function is new. This project outlines the results that have found a relation to number theory in a probabilistic game that has perplexed mathematicians for hundreds of years.