SearcharxivSearch

arXiv subjects

Peter Cohen

Publications and source records attributed to Peter Cohen.

4 recordsLinked to original sources

On the moments of one-level densities in families of holomorphic cusp forms in the level aspect

We study the $n^{\rm th}$ centered moments of the $1$-level density for the low-lying zeros of $L$-functions attached to holomorphic cuspidal newforms of large prime level and fixed weight. Assuming the Generalized Riemann Hypotheses, we compute this statistic for any $n\ge 1$ and for all test functions whose Fourier transforms are supported in $\left(-2/n, \, 2/n\right)$. This is believed to be the natural limit of the current technology. Our work significantly extends beyond the trivial range $(-1/n, \, 1/n)$ and surpasses the previous record of $(-1/(n-1),\, 1/(n-1))$ whenever $n>2$. The Katz-Sarnak philosophy predicts that the aforementioned statistic can be modeled by the corresponding statistic for the eigenvalues of random orthogonal matrices. We prove that this is the case for test functions with Fourier support contained in $(-2/n,\, 2/n)$. The main technical innovation is a tractable vantage to evaluate the combinatorial zoo of terms, similar to the work of Conrey-Snaith and Mason-Snaith. As an application, our work provides better bounds on the order of vanishing at the central point for the $L$-functions in our family.

math.NT

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.

math.NT

Random Matrix Ensembles with Split Limiting Behavior

We introduce a new family of $N\times N$ random real symmetric matrix ensembles, the $k$-checkerboard matrices, whose limiting spectral measure has two components which can be determined explicitly. All but $k$ eigenvalues are in the bulk, and their behavior, appropriately normalized, converges to the semi-circle as $N\to\infty$; the remaining $k$ are tightly constrained near $N/k$ and their distribution converges to the $k \times k$ hollow GOE ensemble (this is the density arising by modifying the GOE ensemble by forcing all entries on the main diagonal to be zero). Similar results hold for complex and quaternionic analogues. We isolate the two regimes by using matrix perturbation results and a nonstandard weight function for the eigenvalues, then derive their limiting distributions using a modification of the method of moments and analysis of the resulting combinatorics.

math-ph

An Analytic Heuristic for Multiplicity Computation for Zaremba's Conjecture

Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often denoted $\Gamma_{A}$, which arises naturally as a subset of $SL_2(\mathbb{Z})$ when considering finite continued fractions. To translate back from this semi-group into rational numbers, we select a projection mapping satisfying certain criteria to recover the numerator and denominator of the continued fractions in rational form. The central question of our research is to determine the multiplicity of a given denominator. To this end, we develop a heuristic method similar to the Hardy-Littlewood Circle Method. We compare this theoretical model to the exact data, gleaned by simulation, and demonstrate that our formula appears to be asymptotically valid. We then evaluate different aspects of the accuracy of our formula.

math.NT