Steven J. Miller
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Steven J. Miller has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
- Adam Lott
Department of Mathematics, University of California, Los Angeles, Los Angeles, CA 90095, USA
2 shared publications - Alyssa Epstein
Stanford Law School Stanford, CA 94305, U.S.A.
2 shared publications - Chung-Hang Kwan
Department of Mathematics Columbia University in the City of New York New York, NY 10027. U.S.A.
2 shared publications - Katherine Cordwell
University of Iowa
2 shared publications - Peter Cohen
Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139, U.S.A.
2 shared publications - Ajmain Yamin
Department of Mathematics CUNY Graduate Center 10016 New York NY USA
1 shared publication
Latest Publications
- Open Access
- 21 October 2024
- Published by Oxford University Press (OUP) in The Quarterly Journal of Mathematics
- Vol. 75 (4) , 1415-1427
On the Within-Perfect Numbers
Motivated by the works of Erdös, Wirsing, Pomerance, Wolke and Harman on the sum-of-divisor function $\sigma(n)$, we study the distribution of a special class of natural numbers closely related to (multiply) perfect numbers which we term ‘$(\ell;k)$-within-perfect numbers’, where $\ell \gt 1$ is a real number and $k: [1, \infty) \rightarrow (0, \infty)$ is an increasing and unbounded function.- 21 October 2024
- Published by Oxford University Press (OUP) in The Quarterly Journal of Mathematics
- Vol. 75 (4) , 1415-1427
Open AccessOn the Within-Perfect Numbers
Motivated by the works of Erdös, Wirsing, Pomerance, Wolke and Harman on the sum-of-divisor function $\sigma(n)$, we study the distribution of a special class of natural numbers closely related to (multiply) perfect numbers which we term ‘$(\ell;k)$-within-perfect numbers’, where $\ell \gt 1$ is a real number and $k: [1, \infty) \rightarrow (0, \infty)$ is an increasing and unbounded function. - Open Access
Avoiding 3-Term Geometric Progressions in Hurwitz Quaternions
Several recent papers have considered the problem of how large a subset of integers can be without containing any 3-term geometric progressions. This problem has also recently been generalized to rings of integers in quadratic number fields and polynomial rings over finite fields. We study the analogous problem in the Hurwitz quaternion order to see how non-commutativity affects the problem. We compute an exact formula for the density of a 3-term geometric-progression-free set of Hurwitz quaternions arising from a greedy algorithm and derive upper and lower bounds for the supremum of upper densities of 3-term geometric-progression-free sets of Hurwitz quaternions.
Open AccessAvoiding 3-Term Geometric Progressions in Hurwitz Quaternions
Several recent papers have considered the problem of how large a subset of integers can be without containing any 3-term geometric progressions. This problem has also recently been generalized to rings of integers in quadratic number fields and polynomial rings over finite fields. We study the analogous problem in the Hurwitz quaternion order to see how non-commutativity affects the problem. We compute an exact formula for the density of a 3-term geometric-progression-free set of Hurwitz quaternions arising from a greedy algorithm and derive upper and lower bounds for the supremum of upper densities of 3-term geometric-progression-free sets of Hurwitz quaternions.
- Open Access
From Quantum Systems to L-Functions: Pair Correlation Statistics and Beyond
The discovery of connections between the distribution of energy levels of heavy nuclei and spacings between prime numbers has been one of the most surprising and fruitful observations in the twentieth century. The connection between the two areas was first observed through Montgomery's work on the pair correlation of zeros of the Riemann zeta function. As its generalizations and consequences have motivated much of the following work, and to this day remains one of the most important outstanding conjectures in the field, it occupies a central role in our discussion below. We describe some of the many techniques and results from the past sixty years, especially the important roles played by numerical and experimental investigations, that led to the discovery of the connections and progress towards understanding the behaviors. In our survey of these two areas, we describe the common mathematics that explains the remarkable universality. We conclude with some thoughts on what might lie ahead in the pair correlation of zeros of the zeta function, and other similar quantities.
Open AccessFrom Quantum Systems to L-Functions: Pair Correlation Statistics and Beyond
The discovery of connections between the distribution of energy levels of heavy nuclei and spacings between prime numbers has been one of the most surprising and fruitful observations in the twentieth century. The connection between the two areas was first observed through Montgomery's work on the pair correlation of zeros of the Riemann zeta function. As its generalizations and consequences have motivated much of the following work, and to this day remains one of the most important outstanding conjectures in the field, it occupies a central role in our discussion below. We describe some of the many techniques and results from the past sixty years, especially the important roles played by numerical and experimental investigations, that led to the discovery of the connections and progress towards understanding the behaviors. In our survey of these two areas, we describe the common mathematics that explains the remarkable universality. We conclude with some thoughts on what might lie ahead in the pair correlation of zeros of the zeta function, and other similar quantities.
- Open Access
Schreier Multisets and the $s$-step Fibonacci Sequences
Inspired by the surprising relationship (due to A. Bird) between Schreier sets and the Fibonacci sequence, we introduce Schreier multisets and connect these multisets with the $s$-step Fibonacci sequences, defined, for each $s\geqslant 2$, as: $F^{(s)}_{2-s} = \cdots = F^{(s)}_0 = 0$, $F^{(s)}_1 = 1$, and $F^{(s)}_{n} = F^{(s)}_{n-1} + \cdots + F^{(s)}_{n-s}, \mbox{ for } n\geqslant 2$. Next, we use Schreier-type conditions on multisets to retrieve a family of sequences which satisfy a recurrence of the form $a(n) = a(n-1) + a(n-u)$, with $a(n) = 1$ for $n = 1,\ldots, u$. Finally, we study nonlinear Schreier conditions and show that these conditions are related to integer decompositions, each part of which is greater than the number of parts raised to some power.Open AccessSchreier Multisets and the $s$-step Fibonacci Sequences
Inspired by the surprising relationship (due to A. Bird) between Schreier sets and the Fibonacci sequence, we introduce Schreier multisets and connect these multisets with the $s$-step Fibonacci sequences, defined, for each $s\geqslant 2$, as: $F^{(s)}_{2-s} = \cdots = F^{(s)}_0 = 0$, $F^{(s)}_1 = 1$, and $F^{(s)}_{n} = F^{(s)}_{n-1} + \cdots + F^{(s)}_{n-s}, \mbox{ for } n\geqslant 2$. Next, we use Schreier-type conditions on multisets to retrieve a family of sequences which satisfy a recurrence of the form $a(n) = a(n-1) + a(n-u)$, with $a(n) = 1$ for $n = 1,\ldots, u$. Finally, we study nonlinear Schreier conditions and show that these conditions are related to integer decompositions, each part of which is greater than the number of parts raised to some power. - Open Access
Combinatorial and Additive Number Theory Problem Sessions: '09--'23
These notes are a summary of the problem session discussions at various CANT (Combinatorial and Additive Number Theory Conferences). Currently they include all years from 2009 through 2019 (inclusive); the goal is to supplement this file each year. These additions will include the problem session notes from that year, and occasionally discussions on progress on previous problems. If you are interested in pursuing any of these problems and want additional information as to progress, please email the author. See http://www.theoryofnumbers.com/ for the conference homepage.
Open AccessCombinatorial and Additive Number Theory Problem Sessions: '09--'23
These notes are a summary of the problem session discussions at various CANT (Combinatorial and Additive Number Theory Conferences). Currently they include all years from 2009 through 2019 (inclusive); the goal is to supplement this file each year. These additions will include the problem session notes from that year, and occasionally discussions on progress on previous problems. If you are interested in pursuing any of these problems and want additional information as to progress, please email the author. See http://www.theoryofnumbers.com/ for the conference homepage.
- 1 January 2020
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- Vol. 194 (4) , 341-366
On near-perfect numbers
The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures in number theory. We investigate a generalization introduced by Pollack and
- 1 January 2020
- Published by Institute of Mathematics, Polish Academy of Sciences in Acta Arithmetica
- Vol. 194 (4) , 341-366
On near-perfect numbers
The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures in number theory. We investigate a generalization introduced by Pollack and
- Open Access
On Near Perfect Numbers
The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures in number theory. We investigate a generalization introduced by Pollack and Shevelev: $k$-near-perfect numbers. These are examples to the well-known pseudoperfect numbers first defined by Sierpi\'nski, and are numbers such that the sum of all but at most $k$ of its proper divisors equals the number. We establish their asymptotic order for all integers $k\ge 4$, as well as some properties of related quantities.Open AccessOn Near Perfect Numbers
The study of perfect numbers (numbers which equal the sum of their proper divisors) goes back to antiquity, and is responsible for some of the oldest and most popular conjectures in number theory. We investigate a generalization introduced by Pollack and Shevelev: $k$-near-perfect numbers. These are examples to the well-known pseudoperfect numbers first defined by Sierpi\'nski, and are numbers such that the sum of all but at most $k$ of its proper divisors equals the number. We establish their asymptotic order for all integers $k\ge 4$, as well as some properties of related quantities. - Open Access
Classification of crescent configurations
Let $n$ points be in crescent configurations in $\mathbb{R}^d$ if they lie in general position in $\mathbb{R}^d$ and determine $n-1$ distinct distances, such that for every $1 \leq i \leq n-1$ there is a distance that occurs exactly $i$ times. Since Erd\H{o}s' conjecture in 1989 on the existence of $N$ sufficiently large such that no crescent configurations exist on $N$ or more points, he, Pomerance, and Pal\'asti have given constructions for $n$ up to $8$ but nothing is yet known for $n \geq 9$. Most recently, Burt et. al. had proven that a crescent configuration on $n$ points exists in $\mathbb{R}^{n-2}$ for $n \geq 3$. In this paper, we study the classification of these configurations on $4$ and $5$ points through graph isomorphism and rigidity. Our techniques, which can be generalized to higher dimensions, offer a new viewpoint on the problem through the lens of distance geometry and provide a systematic way to construct crescent configurations.Open AccessClassification of crescent configurations
Let $n$ points be in crescent configurations in $\mathbb{R}^d$ if they lie in general position in $\mathbb{R}^d$ and determine $n-1$ distinct distances, such that for every $1 \leq i \leq n-1$ there is a distance that occurs exactly $i$ times. Since Erd\H{o}s' conjecture in 1989 on the existence of $N$ sufficiently large such that no crescent configurations exist on $N$ or more points, he, Pomerance, and Pal\'asti have given constructions for $n$ up to $8$ but nothing is yet known for $n \geq 9$. Most recently, Burt et. al. had proven that a crescent configuration on $n$ points exists in $\mathbb{R}^{n-2}$ for $n \geq 3$. In this paper, we study the classification of these configurations on $4$ and $5$ points through graph isomorphism and rigidity. Our techniques, which can be generalized to higher dimensions, offer a new viewpoint on the problem through the lens of distance geometry and provide a systematic way to construct crescent configurations. - Open Access
The bidirectional ballot polytope
A bidirectional ballot sequence (BBS) is a finite binary sequence with the property that every prefix and suffix contains strictly more ones than zeros. BBS's were introduced by Zhao, and independently by Bosquet-M{\'e}lou and Ponty as $(1,1)$-culminating paths. Both sets of authors noted the difficulty in counting these objects, and to date research on bidirectional ballot sequences has been concerned with asymptotics. We introduce a continuous analogue of bidirectional ballot sequences which we call bidirectional gerrymanders, and show that the set of bidirectional gerrymanders form a convex polytope sitting inside the unit cube, which we refer to as the bidirectional ballot polytope. We prove that every $(2n-1)$-dimensional unit cube can be partitioned into $2n-1$ isometric copies of the $(2n-1)$-dimensional bidirectional ballot polytope. Furthermore, we show that the vertices of this polytope are all also vertices of the cube, and that the vertices are in bijection with BBS's. An immediate corollary is a geometric explanation of the result of Zhao and of Bosquet-M{\'e}lou and Ponty that the number of BBS's of length $n$ is $\Theta(2^n/n)$.Open AccessThe bidirectional ballot polytope
A bidirectional ballot sequence (BBS) is a finite binary sequence with the property that every prefix and suffix contains strictly more ones than zeros. BBS's were introduced by Zhao, and independently by Bosquet-M{\'e}lou and Ponty as $(1,1)$-culminating paths. Both sets of authors noted the difficulty in counting these objects, and to date research on bidirectional ballot sequences has been concerned with asymptotics. We introduce a continuous analogue of bidirectional ballot sequences which we call bidirectional gerrymanders, and show that the set of bidirectional gerrymanders form a convex polytope sitting inside the unit cube, which we refer to as the bidirectional ballot polytope. We prove that every $(2n-1)$-dimensional unit cube can be partitioned into $2n-1$ isometric copies of the $(2n-1)$-dimensional bidirectional ballot polytope. Furthermore, we show that the vertices of this polytope are all also vertices of the cube, and that the vertices are in bijection with BBS's. An immediate corollary is a geometric explanation of the result of Zhao and of Bosquet-M{\'e}lou and Ponty that the number of BBS's of length $n$ is $\Theta(2^n/n)$. - Open Access
Low-lying zeros for L-functions associated to Hilbert modular forms of large level
We determine the 1-level density of families of Hilbert modular forms, and show the answer agrees only with orthogonal random matrix ensembles.
Open AccessLow-lying zeros for L-functions associated to Hilbert modular forms of large level
We determine the 1-level density of families of Hilbert modular forms, and show the answer agrees only with orthogonal random matrix ensembles.