Related papers: On the Limiting Density of a gcd Map

We prove that if $\Om \subseteq \R^2$ is bounded and $\R^2 \setminus \Om$ satisfies suitable structural assumptions (for example it has a countable number of connected components), then $W^{1,2}(\Om)$ is dense in $W^{1,p}(\Om)$ for every…

We prove a formula, first obtained by Kleban, Simmons and Ziff using conformal field theory methods, for the (renormalized) density of a critical percolation cluster in the upper half-plane "anchored" to a point on the real line. The proof…

Limit theorems are proved for quadratic forms of Gaussian random fields in presence of long memory. We obtain a non central limit theorem under a minimal integrability condition, which allows isotropic and anisotropic models. We apply our…

In a recently published article by G. Ambrus et al. a new \emph{upper bound} for the density of an unit avoiding, periodic set is given as $0.2470$, the first upper bound $< 1/4$. A construction of Croft 1967 gave a \emph{lower bound}…

We study the zeros of random power series with stationary complex Gaussian coefficients, whose spectral measure is absolutely continuous. We analyze the precise asymptotic behavior of the radial density of zeros near the boundary of the…

The density of states for the Schroedinger equation with a Gaussian random potential is calculated in a space of dimension d=4-epsilon in the entire energy range including the vicinity of a mobility edge. Leading terms in 1/epsilon are…

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

We compute the density of the set of ordinary primes of an abelian surface over a number field in terms of the l-adic monodromy group. Using the classification of l-adic monodromy groups of abelian surfaces by Fite, Kedlaya, Rotger, and…

We consider three extremal problems about the number of copies of a fixed graph in another larger graph. First, we correct an error in a result of Reiher and Wagner and prove that the number of $k$-edge stars in a graph with density $x \in…

Let $g \geq 2$. A real number is said to be g-normal if its base g expansion contains every finite sequence of digits with the expected limiting frequency. Let \phi denote Euler's totient function, let \sigma be the sum-of-divisors…

A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. Say a graph is good if it admits a good…

An $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that for every vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhood with $C$ is nonempty and unique. On a finite graph, the density of a code is…

Let A be a set of positive integers with gcd(A) = 1, and let p_A(n) be the partition function of A. Let c = \pi \sqrt(2/3). Let \alpha > 0. It is proved that log p_A(n) ~ c\sqrt(\alpha n) if and only if the set A has asymptotic density…

This work contains two single-letter upper bounds on the entropy rate of a discrete-valued stationary stochastic process, which only depend on second-order statistics, and are primarily suitable for models which consist of relatively large…

We consider the density properties of divergence-free vector fields $ b \in L^1([0,1],\textit{BV}([0,1]^2)) $ which are ergodic/weakly mixing/strongly mixing: this means that their Regular Lagrangian Flow $X_t$ is an ergodic/weakly…

The unsolved problem of determining which densities are ground state densities of an interacting electron system in some external potential is important to the foundations of density functional theory. A coarse-grained version of this…

Fix an integer $h \geq 2$, and let $b_1, \ldots, b_h$ be (not necessarily distinct) positive integers with $\gcd(b_1, \ldots, b_h) = 1$. For any subset $A \subseteq \mathbb{N}$, let $r_A(n)$ denote the number of solutions $(k_1, \ldots,…

We prove that the density of any covering single-insertion code $C\subseteq X^r$ over the $n$-symbol alphabet $X$ cannot be smaller than $1/r+\delta_r$ for some positive real $\delta_r$ not depending on $n$. This improves the volume lower…

Given a map f:Z-->Z and an initial argument alpha, we can iterate the map to get a finite set of iterates modulo a prime p. In particular, for a quadratic map f(z)=z^2 +c, c constant, work by Pollard suggests that this set should have…

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…