English
Related papers

Related papers: An asymptotically tight bound for the Davenport co…

200 papers

Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…

Probability · Mathematics 2026-04-09 Mathew D. Penrose , Xiaochuan Yang

For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…

Probability · Mathematics 2014-10-30 Camille Male , Sandrine Péché

A generalization of the Davenport constant is investigated. For a finite abelian group $G$ and a positive integer $k$, let $D_k(G)$ denote the smallest $\ell$ such that each sequence over $G$ of length at least $\ell$ has $k$ disjoint…

Number Theory · Mathematics 2010-08-05 Michael Freeze , Wolfgang A. Schmid

Let $\mathcal{S}$ be a finite commutative semigroup. The Davenport constant of $\mathcal{S}$, denoted ${\rm D}(\mathcal{S})$, is defined to be the least positive integer $\ell$ such that every sequence $T$ of elements in $\mathcal{S}$ of…

Combinatorics · Mathematics 2015-03-10 Guoqing Wang

We prove an asymptotic Cram\'er's theorem, that is, if the sequence $(X_{n}+ Y_{n})_{n\geq 1}$ converges in law to the standard normal distribution and for every $n\geq 1$ the random variables $X_{n}$ and $Y_{n}$ are independent, then…

Probability · Mathematics 2010-06-22 Ciprian Tudor

An integer $n\ge 1$ is said to be practical if every natural number $ m \le n$ can be expressed as a sum of distinct positive divisors of $n$. The number of practical numbers up to $x$ is asymptotic to $c x/\log x$, where $c$ is a constant.…

Number Theory · Mathematics 2019-08-30 Andreas Weingartner

We prove that there exists an entire function for which every complex number is an asymptotic value and whose growth is arbitrarily slow subject only to the necessary condition that the function is of infinite order.

Complex Variables · Mathematics 2022-01-17 Aimo Hinkkanen , Joseph Miles

The conjectured Robin inequality for an integer $n>7!$ is $\sigma(n)<e^\gamma n \log \log n,$ where $\gamma$ denotes Euler constant, and $\sigma(n)=\sum_{d | n} d $. Robin proved that this conjecture is equivalent to Riemann hypothesis…

Number Theory · Mathematics 2016-02-11 Patrick Solé , Yuyang Zhu

The isotropy constant of any $d$-dimensional polytope with $n$ vertices is bounded by $C \sqrt{n/d}$ where $C>0$ is a numerical constant.

Functional Analysis · Mathematics 2009-04-20 David Alonso-Gutiérrez , Jesús Bastero , Julio Bernués , Paweł Wolff

W.M.Schmit[11] conjectured that for any$\;\theta$ with deg$\;\theta\geq 3,$ there is no constant$\;C=C(\theta)$ so that$\;|p-q\theta|>Cq^{-1}$ for every rationa$\;p/q.$ [12,p26] states that the computations of the first several thousand…

Number Theory · Mathematics 2023-11-29 Jinxiang Li

We establish sharp estimates for the convergence rate of the Kranosel'ski\v{\i}-Mann fixed point iteration in general normed spaces, and we use them to show that the asymptotic regularity bound recently proved in [11] (Israel Journal of…

Optimization and Control · Mathematics 2017-01-31 Mario Bravo , Roberto Cominetti

I present an asymptotic formula for the Takeuchi numbers $T_n$. In particular, I give compelling numerical evidence and present a heuristic argument showing that $$T_n\sim C_T B_n\exp{1\over2}{W(n)}^2$$as $n$ tends to infinity, where $B_n$…

Combinatorics · Mathematics 2007-05-23 Thomas Prellberg

We prove that the pigeonhole upper bound $\lambda(s,m) \leq \binom{m}{2}(s+1)$ is asymptotically tight whenever $s/\!\sqrt{m} \to \infty$. In particular, $\lambda(s,m) \sim \binom{m}{2}\,s$ in this regime. As corollaries: $\lambda(n,n)/n^3…

Combinatorics · Mathematics 2026-02-18 Jesse Geneson

Let X:R2\Dr->R2 be a differentiable (but not necessarily C1) vector field, where r>0 and Dr={z\in R2:|z|\le r}. If for some e>0 and for all p\in R2\Dr, no eigenvalue of D_p X belongs to (-e,0]\cup {z\in\C:\mathcal{R}(z)\ge 0}, then (a)For…

Dynamical Systems · Mathematics 2007-05-23 C. Gutierrez , B. Pires , R. Rabanal

We prove almost sure strong asymptotic freeness of i.i.d. random unitaries with the following law: sample a Haar unitary matrix of dimension $n$ and then send this unitary into an irreducible representation of $U(n)$. The strong convergence…

Probability · Mathematics 2025-03-03 Michael Magee , Mikael de la Salle

Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered string of terms from $G$ with repetition allowed, and we say that it is a product-one sequence if its terms can be ordered so that their product is the identity…

Group Theory · Mathematics 2025-06-25 Jun Seok Oh

Using the sum invariance property of Benford random variables, we prove that an $n$-digit Benford variable converges to a Benford variable as $n$ approaches infinity.

Probability · Mathematics 2016-04-04 Azar Khosravani , Constantin Rasinariu

It is known that the asymptotic density of states of a 2d CFT in an irreducible representation $\rho$ of a finite symmetry group $G$ is proportional to $(\dim\rho)^2$. We show how this statement can be generalized when the symmetry can be…

High Energy Physics - Theory · Physics 2023-05-02 Ying-Hsuan Lin , Masaki Okada , Sahand Seifnashri , Yuji Tachikawa

Let \sigma(n) = \sum_{d \mid n}d be the usual sum-of-divisors function. In 1933, Davenport showed that that n/\sigma(n) possesses a continuous distribution function. In other words, the limit D(u):= \lim_{x\to\infty} \frac{1}{x}\sum_{n \leq…

Number Theory · Mathematics 2019-02-20 Emily Jennings , Paul Pollack , Lola Thompson

Given a finite commutative semigroup $\mathcal{S}$ (written additively), denoted by ${\rm D}(\mathcal{S})$ the Davenport constant of $\mathcal{S}$, namely the least positive integer $\ell$ such that for any $\ell$ elements…

Combinatorics · Mathematics 2016-03-22 Guoqing Wang , Weidong Gao