Related papers: Divisor Structure of p-1 in Mersenne Prime Exponen…
Let p denote an odd prime. For all p-admissible conductors c over a quadratic number field \(K=\mathbb{Q}(\sqrt{d})\), p-ring spaces \(V_p(c)\) modulo c are introduced by defining a morphism \(\psi:\,f\mapsto V_p(f)\) from the divisor…
Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…
Stochastic growth models in the Kardar-Parisi-Zhang (KPZ) universality class exhibit remarkable fluctuation phenomena. While a variety of powerful methods have led to a detailed understanding of their typical fluctuations or large…
For an m-dimensional multivariate extreme value distribution there exist 2^{m}-1 exponent measures which are linked and completely characterise the dependence of the distribution and all of its lower dimensional margins. In this paper we…
The probability of finding a prime multiplet, i.e., a sequence of primes $p$ and $p+a_i$, $i=1... m$, being all primes where $p$ is some prime less than the integer $n$ is naively $1/log(n)^{m+1}$. It is shown that, in reality, it is…
Discrepancy measures between probability distributions, often termed statistical distances, are ubiquitous in probability theory, statistics and machine learning. To combat the curse of dimensionality when estimating these distances from…
Let $p$ be an odd prime. The factorization of the polynomial $x^{p+1}-1$ over the integer residue ring $\mathbb{Z}_{p^e}$ is pivotal for constructing cyclic codes with Hermitian symmetry, a critical resource for Linear Complementary Dual…
If G is a finite group and p is a prime number, we investigate the relationship between the p-modular decomposition numbers of characters of height zero in the principal p-block of G and the p-local structure of G.
Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…
For a prime number $p$ we study the zeros modulo $p$ of divisor polynomials of rational elliptic curves $E$ of conductor $p$. Ono made the observation that these zeros of are often $j$-invariants of supersingular elliptic curves over…
This paper deals with the estimation of a probability measure on the real line from data observed with an additive noise. We are interested in rates of convergence for the Wasserstein metric of order $p\geq 1$. The distribution of the…
A wide variety of real random composites can be studied by means of prototypes of multiphase microstructures with a controllable spatial inhomogeneity. To create them, we propose a versatile model of randomly overlapping super-spheres of a…
A classical problem in analytic number theory is to study the distribution of fractional part $\alpha p+\beta$ modulo 1, where $\alpha$ is irrational and $p$ runs over the set of primes. We consider the subsequence generated by the primes…
We show that if we have an orthogonal base ($u_1,\ldots,u_p$) in a $p$-dimensional vector space, and select $p+1$ vectors $v_1,\ldots, v_p$ and $w$ such that the vectors traverse the origin, then the probability of $w$ being to closer to…
It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…
Let $v\geq 2$ be a fixed integer, and let $x \geq 1$ and $z \geq x$ be large numbers. The exact asymptotic formula for the number of Wieferich primes $p$ such that $ v^{p-1} \equiv 1 \bmod p^2$ in the short interval $[x,x+z]$ is proposed in…
In 2009, W. D. Banks and I. E. Shparlinski studied the average densities of primes $p \leq x$ for which the reductions of elliptic curves of small height modulo $p$ satisfy certain arithmetic properties, namely cyclicity and divisibility of…
We present a formal verification of Wolstenholme's theorem -- $\binom{2p}{p} \equiv 2 \pmod{p^3}$ for prime $p \geq 5$ -- in Lean~4 with Mathlib. The proof proceeds by expanding the shifted factorial product $\prod_{k=1}^{p-1}(p+k)$ to…
There has been a great deal of work establishing that random linear codes are as list-decodable as uniformly random codes, in the sense that a random linear binary code of rate $1 - H(p) - \epsilon$ is $(p,O(1/\epsilon))$-list-decodable…
This paper deals with the asymptotic statistical properties of a class of redescending M-estimators in linear models with increasing dimension. This class is wide enough to include popular high breakdown point estimators such as…