The $p$-adic Littlewood Conjecture due to De Mathan and Teulié asserts that for any prime number $p$ and any real number $α$, the equation $$\inf_{|m|\ge 1} |m|\cdot |m|_p\cdot |\langle mα\rangle|\, =\, 0 $$ holds. Here, $|m|$ is the usual absolute value of the integer $m$, $|m|_p$ its $p$-adic absolute value and $ |\langle x\rangle|$ denotes the distance from a real number $x$ to the set of integers. This still open conjecture stands as a variant of the well-known Littlewood Conjecture. In the same way as the latter, it admits a natural counterpart over the field of formal Laurent series $\mathbb{K}\left(\left(t^{-1}\right)\right)$ of a ground field $\mathbb{K}$. This is the so-called \emph{$t$-adic Littlewood Conjecture} ($t$-LC).
It is known that $t$--LC fails when the ground field $\mathbb{K}$ is infinite. This article is concerned with the much more difficult case when the latter field is finite. More precisely, a \emph{fully explicit} counterexample is provided to show that $t$-LC does not hold in the case that $\mathbb{K}$ is a finite field with characteristic 3. Generalizations to fields with characteristics different from 3 are also discussed.
The proof is computer assisted. It reduces to showing that an infinite matrix encoding Hankel determinants of the Paper-Folding sequence over $\mathbb{F}_3$, the so-called Number Wall of this sequence, can be obtained as a two-dimensional automatic tiling satisfying a finite number of suitable local constraints.
In this paper we introduce the concept of an infinite loop mod $n$ and discuss the properties that these objects have. In particular, we show that a real number $α$ is a counterexample to the $p$-adic Littlewood Conjecture if and only if there exists some $m\in\mathbb{N}$ such that $p^kα$ is an infinite loop mod $p^m$, for all $k\in\mathbb{N}$. This paper is the first of a two part series, which investigate the link between infinite loops and the $p$-adic Littlewood Conjecture.
The paper investigates various $p$-adic versions of Littlewood's conjecture, generalizing a set-up considered recently by de Mathan and Teulie. In many cases it is shown that the sets of exceptions to these conjectures have Hausdorff dimension zero. The proof follows the measure ridigity approach of Einsiedler, Katok and Lindenstrauss.
The essential aim of this paper is to define weighted q-Hardy-littlewood-type maximal operator by means of p-adic q-invariant distribution on Zp. Moreover, we give some interesting properties concerning this type maximal operator.
We consider a Laurent series defined by infinite products $g_u(t) = \prod_{n=0}^\infty (1 + ut^{-2^n})$, where $u\in \mathbb{F}$ is a parameter and $\mathbb{F}$ is a field. We show that for all $u\in\mathbb{Q}\setminus\{-1,0,1\}$ the series $g_u(t)$ does not satisfy the $t$-adic Littlewood conjecture. On the other hand, if $\mathbb{F}$ is finite then $g_u(t)\in \mathbb{F}((t^{-1}))$ is either a rational function or it satisfies the $t$-adic Littlewood conjecture.
The fundamental aim of this paper is to define weighted q-Hardy-littlewood-type maximal operator by means of fermionic p-adic q-invariant distribution on Zp . Also, we derive some interesting properties concerning this type maximal operator.
We prove that the boundary of the Hall-Littlewood $t$-deformation of the Gelfand-Tsetlin graph is parametrized by infinite integer signatures, extending results of Gorin and Cuenca on boundaries of related deformed Gelfand-Tsetlin graphs. In the special case when $1/t$ is a prime $p$ we use this to recover results of Bufetov-Qiu and Assiotis on infinite $p$-adic random matrices, placing them in the general context of branching graphs derived from symmetric functions. Our methods rely on explicit formulas for certain skew Hall-Littlewood polynomials. As a separate corollary to these, we obtain …
Let $|| \cdot ||$ denote the distance to the nearest integer and, for a prime number $p$, let $| \cdot |_p$ denote the $p$-adic absolute value. In 2004, de Mathan and Teulié asked whether $\inf_{q \ge 1} \, q \cdot || q α|| \cdot | q |_p = 0$ holds for every badly approximable real number $α$ and every prime number $p$. Among other results, we establish that, if the complexity of the sequence of partial quotients of a real number $α$ grows too rapidly or too slowly, then their conjecture is true for the pair $(α, p)$ with $p$ an arbitrary prime.
This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an orbifold with another triangulation. This method is used to show that eventually periodic continued fractions have partial quotients which have exponential growth when iteratively multiplied by $n$, for $n$ any fixed, natural number.
The $p$-adic Littlewood conjecture (PLC) states that $\liminf_{q\to\infty} q\cdot |q|_p \cdot ||qx|| = 0$ for every prime $p$ and every real $x$. Let $w_{CF}(x)$ be an infinite word composed of the continued fraction expansion of $x$ and let $\mathrm{T}$ be the standard left shift map. Assuming that $x$ is a counterexample to PLC we get several restrictions on limit elements of the sequence $\{\mathrm{T}^n w_{CF}(x)\}_{n\in\mathbb{N}}$. As a consequence we show that for any such limit element $w$ we must have $\lim_{n\to\infty} P(w,n) - n = \infty$ where $P(w,n)$ is a word complexity of $w$. W…
For any prime $p$ and real number and $α$, the $p$-adic Littlewood Conjecture due to de Mathan and Teulié asserts that \[\inf_{|m|\ge1}|m|_p\cdot |m|\cdot |\left\langleαm\right\rangle|=0.\] Above, $|m|$ is the usual absolute value, $|m|_p$ is the $p$-adic norm and $\left|\left\langle x\right\rangle\right|$ is the distance from $x\in\mathbb{R}$ to the nearest integer. Let $\mathbb{K}$ be a field and $P(t)\in\mathbb{K}[t]$ be an irreducible polynomial. This paper deals with the analogue of this conjecture over the field of formal Laurent series over $\mathbb{K}$, known as the $P(t)$-adic Littlew…
We classify the measures on SL (k,R)/SL (k,Z) which are invariant and ergodic under the action of the group A of positive diagonal matrices with positive entropy. We apply this to prove that the set of exceptions to Littlewood's conjecture has Hausdorff dimension zero.
We prove a metrical result on a family of conjectures related to the Littlewood conjecture, namely the original Littlewood conjecture, the mixed Littlewood conjecture of de Mathan and Teulié and a hybrid between a conjecture of Cassels and the Littlewood conjecture. It is shown that the set of numbers satisfying a strong version of all of these conjectures is large in the sense of Hausdorff dimension restricted to the set of badly approximable numbers.
We show how a recent result by Aka and Shapira on the evolution of continued fractions in a fixed quadratic field implies the classic result of de Mathan and Teullié on the Mixed Littlewood
In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the "Skewes number" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood inequality occurs. In this paper, we find "Skewes numbers" for 8 more prime k-tuples and provide numerical data in support of the Hardy-Littlewood conjecture. Moreover, we present several algorithms to compute such numbers.
Let $\k$ be an arbitrary field. For any fixed badly approximable power series $Θ$ in $\k((X^{-1}))$, we give an explicit construction of continuum many badly approximable power series $Φ$ for which the pair $(Θ, Φ)$ satisfies the Littlewood conjecture. We further discuss the Littlewood conjecture for pairs of algebraic power series.
In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient condition for the conjecture to hold. An advantage of our method is that it is effective, in the sense that we know how to construct the eventual solution.
In this paper we study the Mixed Littlewood Conjecture with pseudo-absolute values. We show that if p is a prime and D is a pseudo-absolute value sequence satisfying mild conditions then then the infimum over natural numbers n of the quantity n.|n|_p.|n|_D.||nx|| equals 0 for all real x. Our proof relies on a measure rigidity theorem due to Lindenstrauss and lower bounds for linear forms in logarithms due to Baker and Wustholz. We also deduce the answer to the related metric question of how fast the infimum above tends to zero, for almost every x.
Let $m$ and $n$ be positive integers with $m,n \geq 2$. The second Hardy-Littlewood conjecture states that the number of primes in the interval $(m,m+n]$ is always less than or equal to the number of primes in the interval $[2,n]$. Based on new explicit estimates for the prime counting function $π(x)$, we give some new ranges in which this conjecture holds.
The main goal of this note is to develop a metrical theory of Diophantine approximation within the framework of the de Mathan-Teulie Conjecture, also known as the `Mixed Littlewood Conjecture'. Let p be a prime. A consequence of our main result is that, for almost every real number α, \liminf_{n\rar\infty}n(\log n)^2|n|_p\|nα\|=0.
For any given real number $α$ with bounded partial quotients, we construct explicitly continuum many real numbers $β$ with bounded partial quotients for which the pair $(α, β)$ satisfies a strong form of the Littlewood conjecture. Our proof is elementary and rests on the basic theory of continued fractions.
We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL lattices by first establishing a dimension bound for the set of possible exceptions. Existence of vectors (GL-vectors) in R^d with special Diophantine properties is proved by similar methods. For dimension d >= 3 we give explicit constructions of GL lattices (and in fact a much stronger property). We also show that GLC is implied by a conjecture of G. A. Ma…
The Littlewood Conjecture in Diophantine approximation can be thought of as a problem about covering the plane by a union of hyperbolas centered at rational points. In this paper we consider the problem of translating the center of each hyperbola by a random amount which depends on the denominator of the corresponding rational. Using a randomized covering argument we prove that, not only is this randomized version of the Littlewood Conjecture true for almost all choices of centers, an even stronger statement with an extra factor of a logarithm also holds.
A long-standing conjecture of Littlewood about simultaneous Diophantine approximation has an analogous problem for a field of formal Laurent series $\mathbb{F}(\!(t^{-1})\!)$. That is, we can ask whether for any series $Θ$, $Φ$ and any $ε>0$, there is a polynomial $α$ such that $|α|\langleαΘ\rangle\langleαΦ\rangle$ where $\langleΘ\rangle=\underset{β\in\mathbb{F}[t]}{\inf}|Θ-β|$. If the base field $\mathbb{F}$ is infinite, then the answer is negative due to Davenport and Lewis (1963). We give a connection between the combinatorics of an orbit under a semigroup action and Diophantine approximati…
In this paper, we determine the bound of the valency of the odd circulant graph which guarantees to be a Ramanujan graph for each fixed number of vertices. In almost of the cases, the bound coincides with the trivial bound, which comes from the trivial estimate of the largest non-trivial eigenvalue of the circulant graph. As exceptional cases, the bound in fact exceeds the trivial one by two. We then prove that such exceptionals occur only in the cases where the number of vertices has at most two prime factors and is represented by a quadratic polynomial in a finite family and, moreover, under…
In this article, we investigate the bound of the valency of the Cayley graphs of the generalized quaternion groups which guarantees to be Ramanujan. As is the cases of the cyclic and dihedral groups in our previous studies, we show that the determination of the bound in a special setting is related to the classical Hardy-Littlewood conjecture for primes represented by a quadratic polynomial.
We show that, for any $0<γ<1/2$, any $(α,β)\in\mathbb{R}^2$ except on a set with Hausdorff dimension about $\sqrtγ$, any small $0<\varepsilon<1$ and any large $N\in\mathbb{N}$, the number of integers $n\in[1,N]$ such that $n\langle nα\rangle\langle nβ\rangle<\varepsilon$ is greater than $γ\varepsilon\log N$ up to a uniform constant. This can be seen as a quantitative result on the fact that the exceptional set to Littlewood's conjecture has Hausdorff dimension zero, obtained by M. Einsiedler, A. Katok and E. Lindenstrauss in 2000's. For the proof, we study the behavior of the empirical measure…
On a question of Gowers related to Littlewood's conjecture
Alfréd Rényi Institute of Mathematics(阿尔弗雷德·雷尼数学研究所);Department of Analysis and Operations Research, Institute of Mathematics, Budapest University of Technology and Economics(布达佩斯技术与经济大学数学研究所分析与运筹学系)
We study the asymptotic behaviour of the prime pair counting function $π_{2k}(n)$ by the means of the discrete Fourier transform on $\mathbb{Z}/ n\mathbb{Z}$. The method we develop can be viewed as a discrete analog of the Hardy-Littlewood circle method. We discuss some advantages this has over the Fourier series on $\mathbb{R} /\mathbb{Z}$, which is used in the circle method. We show how to recover the main term for $π_{2k}(n)$ predicted by the Hardy-Littlewood Conjecture from the discrete Fourier series. The arguments rely on interplay of Fourier transforms on $\mathbb{Z}/ n\mathbb{Z}$ and o…
The second Hardy-Littlewood conjecture, that $π(x)+π(y) \geq π(x+y)$ for integers $x$ and $y$ with $\min\{x,y\}\geq 2$, was formulated in 1923. It continues to attract attention to this day, almost 100 years later. In 1975 Udrescu proved that this conjecture holds for $(x,y)$ sufficiently large, but without an explicit effective bound on the region of validity. We shall revisit Udrescu's result, modifying it to obtain explicit effective bounds, ultimately proving that the second Hardy-Littlewood conjecture is in fact unconditionally true. Furthermore we note that constraints on the prime count…
We prove the following function field analog of the Hardy-Littlewood conjecture (which generalizes the twin prime conjecture) over large finite fields. Let n,r be positive integers and q an odd prime power. For distinct polynomials a_1, ..., a_r over F_q of degree <n let π(q,n;a) be the number of monic polynomials f over F_q of degree n such that f+a_1, ..., f+a_r are simultaneously irreducible. We prove that π(q,n;a) asymptotically equals q^n/n^r as q tends to infinity on odd prime powers and n,r are fixed (the tuple a1,...,a_r need not be fixed).
We give an estimation of the existence density for the $2d$ different primes by using a new and simple algorithm for getting the $2d$ different primes. The algorithm is a kind of the sieve method, but the remainders are the central numbers between the $2d$ different primes. We may conclude that there exist infinitely many $2d$ different primes including the twin primes in case of $d=1$ because we can give the lower bounds of the existence density for the $2d$ different primes in this algorithm. We also discuss the Hardy-Littlewood conjecture and the Sophie Germain primes.
Schinzel's Hypothesis (H) was used by Colliot-Thélène and Sansuc, and later by Serre, Swinnerton-Dyer and others, to prove that the Brauer-Manin obstruction controls the Hasse principle and weak approximation on pencils of conics and similar varieties. We show that when the ground field is Q and the degenerate geometric fibres of the pencil are all defined over Q, one can use these methods to obtain unconditional results by replacing Hypothesis (H) with the finite complexity case of the generalised Hardy-Littlewood conjecture recently established by Green, Tao and Ziegler.
Assuming that Siegel zeros exist, we prove a hybrid version of the Chowla and Hardy--Littlewood prime tuples conjectures. Thus, for an infinite sequence of natural numbers $x$, and any distinct integers $h_1,\dots,h_k,h'_1,\dots,h'_\ell$, we establish an asymptotic formula for $$\sum_{n\leq x}Λ(n+h_1)\cdots Λ(n+h_k)λ(n+h_{1}')\cdots λ(n+h_{\ell}')$$ for any $0\leq k\leq 2$ and $\ell \geq 0$. Specializing to either $\ell=0$ or $k=0$, we deduce the previously known results on the Hardy--Littlewood (or twin primes) conjecture and the Chowla conjecture under the existence of Siegel zeros, due to H…
We study the prime pair counting functions $π_{2k}(x),$ and their averages over $2k.$ We show that good results can be achieved with relatively little effort by considering averages. We prove an asymptotic relation for longer averages of $π_{2k}(x)$ over $2k \leq x^θ,$ $θ> 7/12,$ and give an almost sharp lower bound for fairly short averages over $k \leq C \log x,$ $C >1/2.$ We generalize the ideas to other related problems.
There has been recent interest in a hybrid form of the celebrated conjectures of Hardy-Littlewood and of Chowla. We prove that for any $k,\ell\ge1$ and distinct integers $h_2,\ldots,h_k,a_1,\ldots,a_\ell$, we have $$\sum_{n\leq X}μ(n+h_1)\cdots μ(n+h_k)Λ(n+a_1)\cdotsΛ(n+a_{\ell})=o(X)$$ for all except $o(H)$ values of $h_1\leq H$, so long as $H\geq (\log X)^{\ell+ε}$. This improves on the range $H\ge (\log X)^{ψ(X)}$, $ψ(X)\to\infty$, obtained in previous work of the first author. Our results also generalize from the Möbius function $μ$ to arbitrary (non-pretentious) multiplicative functions.
Variants of the Littlewood conjecture, their connection to uniformly distributed sequences, and the exact order of the discrepancy of van der Corput--Kronecker-type sequences
本文利用有限域上 $X$-进 Littlewood 猜想的反例构造 van der Corput–Kronecker 型序列,并确定其差异度精确阶,从而支持一致分布理论中的最优差异度上界猜想。
This paper demonstrates that from the Cramer's, Hardy-Littlewood's and Bateman-Horn's conjectures (suggest that the probability of a large positive integer being $x$ a prime - $\frac {1} {\ln(x)}$) it follows that the events consisting in a positive integer $x$ being not divisible by different primes are dependent with the ratio $0,5e^γ$ ($γ$ - Euler's constant). In establishing Hardy-Littlewood's and Bateman-Horn's conjectures, their authors followed the first suggestion by another one assuming the independence of the above-mentioned events, which on the basis of the first suggestion and Mert…
In this paper, we study the mixed Littlewood conjecture with pseudo-absolute values. For any pseudo absolute value sequence $\mathcal{D}$, we obtain the sharp criterion such that for almost every $α$ the inequality \begin{equation*} |n|_{\mathcal{D}}|nα-p|\leq ψ(n) \end{equation*} has infinitely many coprime solutions $(n,p)\in\N\times \Z$ for a certain one-parameter family of $ψ$. Also under minor condition on pseudo absolute value sequences $\mathcal{D}_1$,$\mathcal{D}_2,\cdots, \mathcal{D}_k$, we obtain a sharp criterion on general sequence $ψ(n)$ such that for almost every $α$ the inequali…
We prove Haynes' version of the Duffin--Schaeffer conjecture for the $p$-adic numbers. In addition, we prove several results about an associated related but false conjecture, related to $p$-adic approximation in the spirit of Jarník and Lutz.
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical definition of linear repetitivity to try to discover whether or not there is a natural class of cut and project sets which are models for quasicrystals which are better than `perfectly ordered'. In the positive direction, we demonstrate an uncountable collection of such sets (in fact, a collection with large Hausdorff dimension) for every choice of dimension of…
We establish a valuative version of Grothendieck's section conjecture for curves over p-adic local fields. The image of every section is contained in the decomposition subgroup of a valuation which prolongs the p-adic valuation to the function field of the curve.
In a previous paper the second author developed a new approach to the abelian p-adic Stark Conjecture at s=1 and stated some related conjectures. This paper develops and applies techniques using p-adic measures and continued fractions to numerically investigate one of these conjectures to high precision in fifteen cases with a real quadratic base field.