相关论文: Biases in the Shanks-Renyi Prime Number Race

We introduce a new arithmetic function $a(n)$ defined to be the number of random multiplications by residues modulo $n$ before the running product is congruent to 0 modulo $n$. We give several formulas for computing the values of this…

The Density Conjecture of Katz and Sarnak associates a classical compact group to each reasonable family of $L$-functions. Under the assumption of the Generalized Riemann Hypothesis, Rubinstein computed the $n$-level density of low-lying…

Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…

We study the one-dimensional Levy stable density distributions g(alpha, beta; x) for -infty < x < infty, for rational values of index alpha and the asymmetry parameter beta: alpha = l/k and beta = (l - 2r)/k, where l, k and r are positive…

Let $A\subset\left\{ 1,\dots,N\right\} $ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density $\alpha=|A|/\pi(N)$, where $\pi(N)$ denotes the number of primes in the set $\left\{…

Let $\Psi$ be a system of linear forms with finite complexity. In their seminal paper, Green and Tao showed the following prime number theorem for values of the system $\Psi$: $$\sum_{x\in [-N,N]^d} \prod_{i=1}^t…

We show that a slight modification of a theorem of Ruzmaikina and Aizenman on competing particle systems on the real line leads to a characterization of Poisson-Dirichlet distributions $PD(a,0)$. Precisely, let $s$ be a proper random…

Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of prime numbers, and provide asymptotics for the size of the set…

Let $r(k,A,n)$ denote the number of representations of $n$ as a sum of $k$ elements of a set $A \subseteq \mathbb{N}$. In 2002, Dombi conjectured that if $A$ is co-infinite, then the sequence $(r(k,A,n))_{n \geq 0}$ cannot be strictly…

Under the generalized Riemann Hypothesis (GRH), Baluyot, Chandee, and Li nearly doubled the range in which the density of low lying zeros predicted by Katz and Sarnak is known to hold for a large family of automorphic $L$-functions with…

Assuming the Generalized Riemann Hypothesis, it is known that at least half of the central values $L(\frac{1}{2},\chi)$ are non-vanishing as $\chi$ ranges over primitive characters modulo $q$. Unconditionally, this is known on average over…

In 2013, Strauch asked how various sequences of real numbers defined from trigonometric functions such as $x_n=(\cos n)^n$ distributed themselves$\pmod 1$. Strauch's inquiry is motivated by several such distribution results. For instance,…

We consider a special subsequence of the Fourier coefficients of powers of the Dedekind $\eta$-function, analogous to the sequence $\delta_\ell := 24^{-1} \pmod{\ell}$ on which exceptional congruences of the partition function are…

We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…

While the sequence of primes is very well distributed in the reduced residue classes (mod $q$), the distribution of pairs of consecutive primes among the permissible $\phi(q)^2$ pairs of reduced residue classes (mod $q$) is surprisingly…

The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

For a fixed number field $K$, we consider the mean square error in estimating the number of primes with norm congruent to $a$ modulo $q$ by the Chebotar\"ev Density Theorem when averaging over all $q\le Q$ and all appropriate $a$. Using a…

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…