Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (105)
- Mathematics (91)
- Number Theory (64)
- Algebra (16)
- Analysis (9)
-
- Applied Mathematics (9)
- Arts and Humanities (9)
- Other Mathematics (9)
- Discrete Mathematics and Combinatorics (7)
- Education (6)
- Science and Mathematics Education (6)
- Algebraic Geometry (5)
- Curriculum and Instruction (5)
- Computer Sciences (4)
- Educational Methods (4)
- Higher Education (4)
- Religion (4)
- Christianity (3)
- Engineering (3)
- Creative Writing (2)
- Dynamical Systems (2)
- Electrical and Computer Engineering (2)
- Fiction (2)
- Geometry and Topology (2)
- Logic and Foundations (2)
- Logic and Foundations of Mathematics (2)
- Philosophy (2)
- Physics (2)
- Statistics and Probability (2)
- Business (1)
- Institution
-
- California State University, San Bernardino (11)
- Claremont Colleges (10)
- University of New Mexico (7)
- Rose-Hulman Institute of Technology (6)
- Portland State University (5)
-
- University of Minnesota Morris Digital Well (5)
- City University of New York (CUNY) (4)
- East Tennessee State University (4)
- University of the Pacific (4)
- Ursinus College (4)
- Brigham Young University (3)
- Dordt University (3)
- University of Kentucky (3)
- University of Texas Rio Grande Valley (3)
- Bard College (2)
- Georgia Southern University (2)
- Gettysburg College (2)
- Rochester Institute of Technology (2)
- Union College (2)
- University of Connecticut (2)
- University of Tennessee, Knoxville (2)
- Association of Arab Universities (1)
- Beirut Arab University (1)
- Boise State University (1)
- Butler University (1)
- DePauw University (1)
- Eastern Michigan University (1)
- Eastern Washington University (1)
- Embry-Riddle Aeronautical University (1)
- Gardner-Webb University (1)
- Publication Year
- Publication
-
- Theses Digitization Project (9)
- Electronic Theses and Dissertations (6)
- Theses and Dissertations (6)
- Branch Mathematics and Statistics Faculty and Staff Publications (5)
- Journal of Humanistic Mathematics (5)
-
- Rose-Hulman Undergraduate Mathematics Journal (5)
- Euleriana (4)
- Journal of the Minnesota Academy of Science (4)
- Number Theory (4)
- Doctoral Dissertations (3)
- Honors Theses (3)
- Publications and Research (3)
- Theses (3)
- CMC Senior Theses (2)
- Electronic Theses, Projects, and Dissertations (2)
- Pro Rege (2)
- Student Research (2)
- Theses and Dissertations--Mathematics (2)
- University Honors Theses (2)
- A with Honors Projects (1)
- Applied Mathematics & Information Sciences (1)
- BAU Journal - Science and Technology (1)
- Before the Textbook (1)
- Boise State University Theses and Dissertations (1)
- CGU Theses & Dissertations (1)
- CMC Faculty Publications and Research (1)
- Chemistry Faculty Research and Publications (1)
- Communications on Number Theory and Combinatorial Theory (1)
- Computer Science Faculty Research & Creative Works (1)
- Computer Science Faculty and Staff Publications (1)
Articles 1 - 30 of 122
Full-Text Articles in Entire DC Network
Birkhoff Summation Of Irrational Rotation: A Surprising Result For The Golden Mean, Heather L. Moore
Birkhoff Summation Of Irrational Rotation: A Surprising Result For The Golden Mean, Heather L. Moore
Student Research Symposium
This research lies at the intersection of number theory and dynamical systems. We study the statistics of constant rotations by irrational numbers and investigate the relations between those statistics and the continued fraction approximates of a given irrational number.
This poster, which accompanies a written thesis, presents a surprising result that the difference in a certain sums of constant rotations by the golden mean approaches exactly 1/5. Specifically, we focus on the Birkhoff sums of these rotations, with the number of terms equal to squared Fibonacci numbers. The proof relies on the properties of continued fraction approximants, Vajda's identity and …
Research On Arithmetic, Erik R. Tou
Research On Arithmetic, Erik R. Tou
Euleriana
In this English translation, some of Joseph-Louis Lagrange's early number theory is presented. Here, he laid out a theory of binary quadratic forms with special attention to the representation problem: determining those integers which may be represented by a given form, and cataloguing the possible forms of their divisors.
Birkhoff Summation Of Irrational Rotations: A Surprising Result For The Golden Mean, Heather Moore
Birkhoff Summation Of Irrational Rotations: A Surprising Result For The Golden Mean, Heather Moore
University Honors Theses
This thesis presents a surprising result that the difference in a certain sums of constant rotations by the golden mean approaches exactly 1/5. Specifically, we focus on the Birkhoff sums of these rotations, with the number of terms equal to squared Fibonacci numbers. The proof relies on the properties of continued fraction approximants, Vajda's identity and the explicit formula for the Fibonacci numbers.
A Spiral Workbook For Discrete Mathematics 2nd Edition, Harris Kwong
A Spiral Workbook For Discrete Mathematics 2nd Edition, Harris Kwong
Milne Open Textbooks
This updated text covers the standard topics in a sophomore-level course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics, with an emphasis on motivation. It explains and clarifies the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a final polished form. Hands-on exercises help students understand a concept soon after learning it. The text adopts a spiral approach: many topics are revisited multiple times, sometimes from a different perspective or at a higher level of complexity. The goal is …
Pairs Of Quadratic Forms Over P-Adic Fields, John Hall
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$.
Further Generalizations Of Happy Numbers, E. Simonton Williams
Further Generalizations Of Happy Numbers, E. Simonton Williams
Rose-Hulman Undergraduate Mathematics Journal
A positive integer n is defined to be happy if iteration of the function taking the sum of the squares of the digits of n eventually reaches 1. In this paper we generalize the concept of happy numbers in several ways. First we confirm known results of Grundman and Teeple and establish further results extending the known structure of happy numbers to higher powers. Then we construct a similar function expanding the definition of happy numbers to negative integers. Working with this function, we prove a range of results paralleling those already proven for traditional and generalized happy numbers. Finally, …
Solution Of The Diophantine Equation (Maa+Nbb)=Cd(Mcc+Ndd) Using Rational Numbers, Georg Ehlers
Solution Of The Diophantine Equation (Maa+Nbb)=Cd(Mcc+Ndd) Using Rational Numbers, Georg Ehlers
Euleriana
This paper (E716) was published in Nova acta Academiae scientiarum imperialis petropolitanae, Volume 13 (1795/96), pp. 45-63. It was also included in Commentationes Arithmeticae, Volume II, as Number LXVIII, pp. 281-293 (E791). Euler starts with Fermat's Last Theorem and mentions the proofs for the cases n=3 and n=4 which he had completed himself earlier. He then moves on to make the sum of powers conjecture, which was later disproved in the second half of the 20th century. In this context he discusses his discovery of 134^4+133^4=158^4+59^4, which he calls unexpected. Euler derives the title equation from A^4+B^4=C^4+D^4, generalizing it to …
Approaches To The Erdős–Straus Conjecture, Ivan V. Morozov
Approaches To The Erdős–Straus Conjecture, Ivan V. Morozov
Publications and Research
The Erdős–Straus conjecture, initially proposed in 1948 by Paul Erdős and Ernst G. Straus, asks whether the equation 4/n = 1/x + 1/y + 1/z is solvable for all n ∈ N and some x, y, z ∈ N. This problem touches on properties of Egyptian fractions, which had been used in ancient Egyptian mathematics. There exist many partial solutions, mainly in the form of arithmetic progressions and therefore residue classes. In this work we explore partial solutions and aim to expand them.
Some Thoughts On The 3 × 3 Magic Square Of Squares Problem, Desmond Weisenberg
Some Thoughts On The 3 × 3 Magic Square Of Squares Problem, Desmond Weisenberg
Rose-Hulman Undergraduate Mathematics Journal
A magic square is a square grid of numbers where each row, column, and long diagonal has the same sum (called the magic sum). An open problem popularized by Martin Gardner asks whether there exists a 3×3 magic square of distinct positive square numbers. In this paper, we expand on existing results about the prime factors of elements of such a square, and then provide a full list of the ways a prime factor could appear in one. We also suggest a separate possible computational approach based on the prime signature of the center entry of the square.
On Correspondences Between Feedforward Artificial Neural Networks On Finite Memory Automata And Classes Of Primitive Recursive Functions, Vladimir A. Kulyukin
On Correspondences Between Feedforward Artificial Neural Networks On Finite Memory Automata And Classes Of Primitive Recursive Functions, Vladimir A. Kulyukin
Computer Science Faculty and Staff Publications
When realized on computational devices with finite quantities of memory, feedforward artificial neural networks and the functions they compute cease being abstract mathematical objects and turn into executable programs generating concrete computations. To differentiate between feedforward artificial neural networks and their functions as abstract mathematical objects and the realizations of these networks and functions on finite memory devices, we introduce the categories of general and actual computabilities and show that there exist correspondences, i.e., bijections, between functions computable by trained feedforward artificial neural networks on finite memory automata and classes of primitive recursive functions.
The P-Adic Numbers And Conic Sections, Abdelhadi Zaoui
The P-Adic Numbers And Conic Sections, Abdelhadi Zaoui
Electronic Theses and Dissertations
This thesis introduces the p-adic metric on the rational numbers. We then present the basic properties of this metric. Using this metric, we explore conic sections, viewed as equidistant sets. Lastly, we move on the sequences and series, and from there, we define p-adic expansions and the analytic completion of Q with respect to the p-adic metric, which leads to exploring some arithmetic properties of Qp.
Coefficients Of Modular Forms And Applications To Partition Theory, Michael Anthony Hanson
Coefficients Of Modular Forms And Applications To Partition Theory, Michael Anthony Hanson
Doctoral Dissertations
We begin with an overview of the theory of modular forms as well as some relevant sub-topics in order to discuss three results: the first result concerns positivity of self-conjugate t-core partitions under the assumption of the Generalized Riemann Hypothesis; the second result bounds certain types of congruences called "Ramanujan congruences" for an infinite class of eta-quotients - this has an immediate application to a certain restricted partition function whose congruences have been studied in the past; the third result strengthens a previous result that relates weakly holomorphic modular forms to newforms via p-adic limits.
Number Theoretic Arithmetic Functions And Dirichlet Series, Ivan V. Morozov
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.
Euler Archive Spotlight, Erik R. Tou
Euler Archive Spotlight, Erik R. Tou
Euleriana
A survey of two translations posted to the Euler Archive in 2022.
Euler's Anticipations, Christopher Goff, Erik Tou
Euler's Anticipations, Christopher Goff, Erik Tou
Euleriana
Welcome to Volume 3 of Euleriana. This issue highlights occasions where Euler's work anticipated future results from other others, sometimes by decades or even centuries!
Unsolved Haiku, Scott W. Williams
Unsolved Haiku, Scott W. Williams
Journal of Humanistic Mathematics
This poem describes the still unsolved 1937 conjecture of Lloyd Collatz: Do repeated applications of the algorithm described yield the number 1?
The Genesis Of A Theorem, Osvaldo Marrero
The Genesis Of A Theorem, Osvaldo Marrero
Journal of Humanistic Mathematics
We present the story of a theorem's conception and birth. The tale begins with the circumstances in which the idea sprouted; then is the question's origin; next comes the preliminary investigation, which led to the conjecture and the proof; finally, we state the theorem. Our discussion is accessible to anyone who knows mathematical induction. Therefore, this material can be used for instruction in a variety of courses. In particular, this story may be used in undergraduate courses as an example of how mathematicians do research. As a bonus, the proof by induction is not of the simplest kind, because it …
Lattice Extensions And Zeros Of Multilinear Polynomials, Maxwell Forst
Lattice Extensions And Zeros Of Multilinear Polynomials, Maxwell Forst
CGU Theses & Dissertations
We treat several problems related to the existence of lattice extensions preserving certain geometric properties and small-height zeros of various multilinear polynomials. An extension of a Euclidean lattice $L_1$ is a lattice $L_2$ of higher rank containing $L_1$ so that the intersection of $L_2$ with the subspace spanned by $L_1$ is equal to $L_1$. Our first result provides a counting estimate on the number of ways a primitive collection of vectors in a lattice can be extended to a basis for this lattice. Next, we discuss the existence of lattice extensions with controlled determinant, successive minima and covering radius. In …
Mathematical Structure Of Musical Tuning Systems, Shay Joel Francis Spitzer
Mathematical Structure Of Musical Tuning Systems, Shay Joel Francis Spitzer
Senior Projects Spring 2023
Over the course of history, western music has created a unique mathematical problem for itself. From acoustics, we know that two notes sound good together when they are related by simple ratios consisting of low primes. The problem arises when we try to build a finite set of pitches, like the 12 notes on a piano, that are all related by such ratios. We approach the problem by laying out definitions and axioms that seek to identify and generalize desirable properties. We can then apply these ideas to a broadened algebraic framework. Rings in which low prime integers can be …
Elliptic Functions And Iterative Algorithms For Π, Eduardo Jose Evans
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 …
Meertens Number And Its Variations, Chai Wah Wu
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.
Proving Dirichlet's Theorem On Arithmetic Progressions, Owen T. Abma
Proving Dirichlet's Theorem On Arithmetic Progressions, Owen T. Abma
Undergraduate Student Research Internships Conference
First proved by German mathematician Dirichlet in 1837, this important theorem states that for coprime integers a, m, there are an infinite number of primes p such that p = a (mod m). This is one of many extensions of Euclid’s theorem that there are infinitely many prime numbers. In this paper, we will formulate a rather elegant proof of Dirichlet’s theorem using ideas from complex analysis and group theory.
Squate, Tom Blackford
Squate, Tom Blackford
Journal of Humanistic Mathematics
This is the story of a middle school student who befriends an irrational number, the square root of eight.
On The Iwasawa Invariants Of Nonordinary Modular Forms, Rylan J. Gajek-Leonard
On The Iwasawa Invariants Of Nonordinary Modular Forms, Rylan J. Gajek-Leonard
Doctoral Dissertations
We extend known results on the behavior of Iwasawa invariants attached to Mazur-Tate elements for p-nonordinary modular forms of weight k=2 to higher weight modular forms with a_p=0. This is done by using a decomposition of the p-adic L-function due to R. Pollack in order to construct explicit lifts of Mazur-Tate elements to the full Iwasawa algebra. We then study the behavior of Iwasawa invariants upon projection to finite layers, allowing us to express the invariants of Mazur-Tate elements in terms of those coming from plus/minus p-adic L-functions. Our results combine with work of Pollack and Weston to relate the …
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 …
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 …
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} = …
Pentagonal Extensions Of The Rationals Ramified At A Single Prime, Pablo Miguel Rodriguez
Pentagonal Extensions Of The Rationals Ramified At A Single Prime, Pablo Miguel Rodriguez
Theses and Dissertations
In this thesis, we define a certain group of order 160, which we call a hyperpentagonal group, and we prove that every totally real D5-extension of the rationals ramified at only one prime is contained in a hyperpentagonal extension of the rationals. This generalizes a result of Doud and Childers (originally conjectured by Wong) that every totally real S3 extension of the rationals ramified at only one prime is contained in an S4 extension.
The Cost Of A Positive Integer, Maxwell Norfolk
The Cost Of A Positive Integer, Maxwell Norfolk
Rose-Hulman Undergraduate Mathematics Journal
The cost CS of a positive integer m relative to a set S of binary operations is defined to be the lesser of m and the minimum of CS(a) + CS(b) where a and b are positive integers and m = a ◦ b for some binary operation ◦ ∈ S. The cost of a positive integer measures the complexity of expressing m using the operations in S, and is intended to be a simplification of Kolmogrov compelexity. We show that, unlike Kolmolgorov complexity, CS is computable for any finite set S …