English
Related papers

Related papers: Denjoy, Demuth, and Density

200 papers

Lehmer conjectured that Ramanujan's tau-function never vanishes. In a related direction, a folklore conjecture asserts that infinitely many primes arise as absolute values of Ramanujan's tau-function. Recently, Xiong showed that these prime…

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

Number Theory · Mathematics 2020-09-25 László Mérai , Alina Ostafe , Igor E. Shparlinski

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

General Topology · Mathematics 2017-11-09 Boaz Tsaban

We establish the satisfiability threshold for random $k$-SAT for all $k\ge k_0$, with $k_0$ an absolute constant. That is, there exists a limiting density $\alpha_*(k)$ such that a random $k$-SAT formula of clause density $\alpha$ is with…

Probability · Mathematics 2021-04-16 Jian Ding , Allan Sly , Nike Sun

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

Number Theory · Mathematics 2020-04-20 Lucile Devin

We prove that, for every $0 \leq t \leq 1$, the limiting distribution of the scale-normalized number of key comparisons used by the celebrated algorithm QuickQuant to find the $t$th quantile in a randomly ordered list has a Lipschitz…

Probability · Mathematics 2021-10-01 James Allen Fill , Wei-Chun Hung

We establish two results concerning a class of geometric rough paths $\mathbf{X}$ which arise as Markov processes associated to uniformly subelliptic Dirichlet forms. The first is a support theorem for $\mathbf{X}$ in $\alpha$-H\"older…

Probability · Mathematics 2018-06-18 Ilya Chevyrev , Marcel Ogrodnik

Given a countable residually finite group, we construct a compact group K and two elements w and u of K with the following properties: The group generated by w and the cube of u is amenable, the group generated by w and u contains a copy of…

Group Theory · Mathematics 2019-06-19 Masato Mimura

Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…

Number Theory · Mathematics 2024-06-07 Ofir Gorodetsky , Mo Dick Wong

Let $X$ be a quasi-projective variety and $f\colon X\to X$ a finite surjective endomorphism. We consider Zariski Dense Orbit Conjecture (ZDO), and Adelic Zariski Dense Orbit Conjecture (AZO). We consider also Kawaguchi-Silverman Conjecture…

Algebraic Geometry · Mathematics 2024-11-15 Jia Jia , Takahiro Shibata , Junyi Xie , De-Qi Zhang

We study the regularity of smooth functions $f$ defined on an open set of $\mathbb{R}^n$ and such that, for certain integers $p\geq 2$, the powers $f^p :x\mapsto (f(x))^p$ belong to a Denjoy-Carleman class $\mathcal{C}_M$ associated with a…

Classical Analysis and ODEs · Mathematics 2019-09-04 Vincent Thilliez

This paper deals with the problem of density estimation. We aim at building an estimate of an unknown density as a linear combination of functions of a dictionary. Inspired by Cand\`es and Tao's approach, we propose an $\ell_1$-minimization…

Statistics Theory · Mathematics 2009-05-07 Karine Bertin , Erwan Le Pennec , Vincent Rivoirard

In this article, we consider the generalized version $d^f_g$ of the natural density function introduced in \cite{BDK} where $g : \N \rightarrow [0,\infty)$ satisfies $g(n) \rightarrow \infty$ and $\frac{n}{g(n)} \nrightarrow 0$ whereas $f$…

General Topology · Mathematics 2020-11-04 Pratulananda Das , Ayan Ghosh

Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…

Information Theory · Computer Science 2007-08-20 Marcus Hutter , Andrej Muchnik

We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…

Logic · Mathematics 2014-08-14 Bjørn Kjos-Hanssen , Frank Stephan , Jason R. Teutsch

We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating that "a real is c.e. and random iff it is the halting…

Computational Complexity · Computer Science 2009-06-08 Cristian S. Calude , Nicholas J. Hay

If $\phi$ is an analytic selfmap of the disk (not an elliptic automorphism) the Denjoy-Wolff Theorem predicts the existence of a point $p$ with $|p|\leq 1$ such that the iterates $\phi_{n}$ converge to $p$ uniformly on compact subsets of…

Complex Variables · Mathematics 2007-05-23 Pietro Poggi-Corradini

We consider the space $C_{\lambda}$ of all continuous interval maps preserving the Lebesgue measure $\lambda$. A continuous function $f\colon~[0,1]\to \mathbb R$ is called Besicovitch if it does not have any finite or infinite unilateral…

Dynamical Systems · Mathematics 2026-02-24 Jozef Bobok , Jernej Činč , Piotr Oprocha , Serge Troubetzkoy

Let $\rho: G \to \operatorname{GL}(V)$ be a rational representation of a reductive linear algebraic group $G$ defined over $\mathbb C$ on a finite dimensional complex vector space $V$. We show that, for any generic smooth (resp. $C^M$)…

Representation Theory · Mathematics 2012-03-19 Mark Losik , Peter W. Michor , Armin Rainer

In this paper, we use entropy functions to characterise the set of rate-capacity tuples achievable with either zero decoding error, or vanishing decoding error, for general network coding problems. We show that when sources are colocated,…

Information Theory · Computer Science 2015-03-19 Terence H. Chan , Alex Grant