Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- California State University, San Bernardino (11)
- Claremont Colleges (9)
- Rose-Hulman Institute of Technology (5)
- University of New Mexico (5)
- University of the Pacific (4)
-
- Ursinus College (4)
- City University of New York (CUNY) (3)
- University of Kentucky (3)
- University of Minnesota Morris Digital Well (3)
- University of Texas Rio Grande Valley (3)
- Bard College (2)
- Dordt University (2)
- East Tennessee State University (2)
- Georgia Southern University (2)
- Gettysburg College (2)
- Portland State University (2)
- Union College (2)
- University of Connecticut (2)
- Boise State University (1)
- Brigham Young University (1)
- Butler University (1)
- DePauw University (1)
- Eastern Michigan University (1)
- Georgia Academy of Science (1)
- Jacksonville State University (1)
- Kutztown University (1)
- Lawrence University (1)
- Oberlin (1)
- Parkland College (1)
- SUNY Geneseo (1)
- Publication Year
- Publication
-
- Theses Digitization Project (9)
- Branch Mathematics and Statistics Faculty and Staff Publications (5)
- Euleriana (4)
- Journal of Humanistic Mathematics (4)
- Number Theory (4)
-
- Rose-Hulman Undergraduate Mathematics Journal (4)
- Theses and Dissertations (4)
- Electronic Theses and Dissertations (3)
- Honors Theses (3)
- Publications and Research (3)
- CMC Senior Theses (2)
- Doctoral Dissertations (2)
- Electronic Theses, Projects, and Dissertations (2)
- Journal of the Minnesota Academy of Science (2)
- Pro Rege (2)
- Student Research (2)
- Theses and Dissertations--Mathematics (2)
- A with Honors Projects (1)
- Boise State University Theses and Dissertations (1)
- CGU Theses & Dissertations (1)
- CMC Faculty Publications and Research (1)
- Communications on Number Theory and Combinatorial Theory (1)
- Dissertations (1)
- Georgia Journal of Science (1)
- Honors College Theses (1)
- Honors Papers (1)
- Honors Projects (1)
- Honors Scholar Theses (1)
- Lawrence University Honors Projects (1)
- Master's Theses and Doctoral Dissertations (1)
Articles 31 - 60 of 91
Full-Text Articles in Entire DC Network
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.
Classification Of Torsion Subgroups For Mordell Curves, Zachary Porat
Classification Of Torsion Subgroups For Mordell Curves, Zachary Porat
Honors Theses
Elliptic curves are an interesting area of study in mathematics, laying at the intersection of algebra, geometry, and number theory. They are a powerful tool, having applications in everything from Andrew Wiles’ proof of Fermat’s Last Theorem to cybersecurity. In this paper, we first provide an introduction to elliptic curves by discussing their geometry and associated group structure. We then narrow our focus, further investigating the torsion subgroups of elliptic curves. In particular, we will examine two methods used to classify these subgroups. We finish by employing these methods to categorize the torsion subgroups for a specific family of elliptic …
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.
The Pell Equation In India, Toke Knudsen, Keith Jones
The Pell Equation In India, Toke Knudsen, Keith Jones
Number Theory
No abstract provided.
Generating Pythagorean Triples: A Gnomonic Exploration, Janet Heine Barnett
Generating Pythagorean Triples: A Gnomonic Exploration, Janet Heine Barnett
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.
Primes, Divisibility, And Factoring, Dominic Klyve
Primes, Divisibility, And Factoring, Dominic Klyve
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 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.
Integer Generalized Splines On The Diamond Graph, Emmet Reza Mahdavi
Integer Generalized Splines On The Diamond Graph, Emmet Reza Mahdavi
Senior Projects Spring 2016
In this project we extend previous research on integer splines on graphs, and we use the methods developed on n-cycles to characterize integer splines on the diamond graph. First, we find an explicit module basis consisting of flow-up classes. Then we develop a determinantal criterion for when a given set of splines forms a basis.
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
Electronic Theses and 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 …
Characterizing The Properties Of Specific Binomial Coefficients In Congruence Relations, Tyler Robert Russ
Characterizing The Properties Of Specific Binomial Coefficients In Congruence Relations, Tyler Robert Russ
Master's Theses and Doctoral Dissertations
The number theoretic conjecture we examine in this paper originates when trying to construct a characterizable generating set for the complex cobordism polynomial ring. To date there is no efficient, universal method for characterizing such a generating set. Wilfong conjectures that smooth projective toric varieties can act as these generators [7]. Toric varieties are related to polytopes by a bijective correspondence. Studying the combinatorial structure of these polytopes is much more manageable than studying properties of toric varieties directly. This gives rise to the number theoretic conjecture considered here. A proof of this number theoretic conjecture would in turn prove …
A Short Note On Sums Of Powers Of Reciprocals Of Polygonal Numbers, Jihang Wang, Suman Balasubramanian
A Short Note On Sums Of Powers Of Reciprocals Of Polygonal Numbers, Jihang Wang, Suman Balasubramanian
Student Research
This paper presents the summation of powers of reciprocals of polygonal numbers. Several summation formulas of the reciprocals of generalized polygonal numbers are presented as examples of specific cases in this paper.
Commutative N-Ary Arithmetic, Aram Bingham
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 …
Explorations Of The Collatz Conjecture (Mod M), Glenn Micah Jackson Jr
Explorations Of The Collatz Conjecture (Mod M), Glenn Micah Jackson Jr
Honors College Theses
The Collatz Conjecture is a deceptively difficult problem recently developed in mathematics. In full, the conjecture states: Begin with any positive integer and generate a sequence as follows: If a number is even, divide it by two. Else, multiply by three and add one. Repetition of this process will eventually reach the value 1. Proof or disproof of this seemingly simple conjecture have remained elusive. However, it is known that if the generated Collatz Sequence reaches a cycle other than 4, 2, 1, the conjecture is disproven. This fact has motivated our search for occurrences of 4, 2, 1, and …
Integral Generalized Binomial Coefficients Of Multiplicative Functions, Imanuel Chen
Integral Generalized Binomial Coefficients Of Multiplicative Functions, Imanuel Chen
Summer Research
The binomial coefficients are interestingly always integral. However, when you generalize the binomial coefficients to any class of function, this is not always the case. Multiplicative functions satisfy the properties: f(ab) = f(a)f(b) when a and b are relatively prime, and f(1) = 1. Tom Edgar of Pacific Lutheran University and Michael Spivey of the University of Puget Sound developed a Corollary that determines which values of n and m will always have integral generalized binomial coefficients for all multiplicative functions. The purpose of this research was to determine as many patterns within this corollary as possible as well as …
On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh
On The Characterization Of Prime Sets Of Polynomials By Congruence Conditions, Arvind Suresh
CMC Senior Theses
This project is concerned with the set of primes modulo which some monic, irreducible polynomial over the integers has a root, called the Prime Set of the polynomial. We completely characterise these sets for degree 2 polynomials, and develop sufficient machinery from algebraic number theory to show that if the Galois group of a monic, irreducible polynomial over the integers is abelian, then its Prime Set can be written as the union of primes in some congruence classes modulo some integer.
Natural Neutrosophic Numbers And Mod Neutrosophic Numbers, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Natural Neutrosophic Numbers And Mod Neutrosophic Numbers, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors answer the question proposed by Florentin Smarandache “Does there exist neutrosophic numbers which are such that they take values differently and behave differently from I; the indeterminate?”. We have constructed a class of natural neutrosophic numbers m 0I , m xI , m yI , m zI where m 0I × m 0I = m 0I , m xI × m xI = m xI and m yI × m yI = m yI and m yI × m xI = m 0I and m zI × m zI = m 0I . Here take m …
Polynomial Factoring Algorithms And Their Computational Complexity, Nicholas Cavanna
Polynomial Factoring Algorithms And Their Computational Complexity, Nicholas Cavanna
Honors Scholar Theses
Finite fields, and the polynomial rings over them, have many neat algebraic properties and identities that are very convenient to work with. In this paper we will start by exploring said properties with the goal in mind of being able to use said properties to efficiently irreducibly factorize polynomials over these fields, an important action in the fields of discrete mathematics and computer science. Necessarily, we must also introduce the concept of an algorithm’s speed as well as particularly speeds of basic modular and integral arithmetic opera- tions. Outlining these concepts will have laid the groundwork for us to introduce …