English
Related papers

Related papers: Badly approximable numbers and Littlewood-type pro…

200 papers

For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max…

Number Theory · Mathematics 2012-06-29 Stephen Harrap

We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\alpha,\delta)$-approximate LDC is a set $V$ of $n$ points in…

Computational Complexity · Computer Science 2014-02-28 Jop Briët , Zeev Dvir , Guangda Hu , Shubhangi Saraf

In this paper we consider the problem of counting algebraic numbers $\alpha$ of fixed degree $n$ and bounded height $Q$ such that the derivative of the minimal polynomial $P_{\alpha}(x)$ of $\alpha$ is bounded, $|P_{\alpha}'(\alpha)| <…

Number Theory · Mathematics 2018-11-28 Alexey Kudin , Denis Vasilyev

It is a classical result from Diophantine approximation that the set of badly approximable numbers has Lebesgue measure zero. In this paper we generalise this result to more general sequences of balls. Given a countable set of closed…

Number Theory · Mathematics 2014-05-30 Simon Baker

We verify that $\liminf_{q\to\infty} q\cdot |q|_p\cdot ||qx||<\epsilon$ for all real $x$, small primes $p$ and relatively small $\epsilon$. This result supports the famous $p$-adic Littlewood conjecture which states that the above lower…

Number Theory · Mathematics 2025-06-23 Dmitry Badziahin

Littlewood polynomials are polynomials with each of their coefficients in $\{-1,1\}$. A sequence of Littlewood polynomials that satisfies a remarkable flatness property on the unit circle of the complex plane is given by the Rudin-Shapiro…

Classical Analysis and ODEs · Mathematics 2023-11-09 Tamás Erdélyi

The Jarn\'ik-Besicovitch theorem is a fundamental result in metric number theory which concerns the Hausdorff dimension for certain limsup sets. We discuss the analogous problem for liminf sets. Consider an infinite sequence of positive…

Number Theory · Mathematics 2023-09-26 Mumtaz Hussain , Ben Ward

Let $\alpha_1,\alpha_2$ be non-zero algebraic numbers such that $\frac{\log \alpha_2}{\log\alpha_1}\notin\mathbb{Q}$ and let $\beta$ be a quadratic irrational number. In this article, we prove that the values of two relatively prime…

Number Theory · Mathematics 2025-05-28 Veekesh Kumar , Riccardo Tosi

We give several results related to inhomogeneous approximations to two real numbers and badly approximable numbers. Our results are related to classical theorems by A. Khintchine (1926) and to an original method invented by Y. Peres and W.…

Number Theory · Mathematics 2011-02-14 Nikolay Moshchevitin

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 $\Theta$, $\Phi$ and…

Number Theory · Mathematics 2019-02-27 Sanghoon Kwon

Let Q be an infinite set of positive integers. Denote by W_{\tau, n}(Q) (resp. W_{\tau, n}) the set of points in dimension n simultaneously \tau--approximable by infinitely many rationals with denominators in Q (resp. in N*). A non--trivial…

Number Theory · Mathematics 2014-01-14 Faustin Adiceam

We introduce and develop a class of \textit{Cantor-winning} sets that share the same amenable properties as the classical winning sets associated to Schmidt's $(\alpha,\beta)$-game: these include maximal Hausdorff dimension, invariance…

Number Theory · Mathematics 2015-09-09 Dzmitry Badziahin , Stephen Harrap

Let $x \in [0,1)$ be an irrational number with continued fraction expansion $[a_1(x),a_2(x), \cdots,a_n(x),\cdots]$ and $q_n(x)$ be the denominator of its $n$-th convergent. We establish, for any $\alpha,\beta$ in $[0,+\infty]$, the…

Number Theory · Mathematics 2025-09-30 Xiaoyan Tan , Zhenliang Zhang

For $q>1$ we consider expansions in base $q$ over the alphabet $\{0,1,q\}$. Let $\mathcal{U}_q$ be the set of $x$ which have a unique $q$-expansions. For $k=2, 3,\cdots,\aleph_0$ let $\mathcal{B}_k$ be the set of bases $q$ for which there…

Number Theory · Mathematics 2018-07-23 Karma Dajani , Kan Jiang , Derong Kong , Wenxia Li

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\'e and a hybrid between a conjecture of Cassels…

Number Theory · Mathematics 2012-04-05 Alan Haynes , Jonas Lindstrøm Jensen , Simon Kristensen

Let \beta be a real number. Then for almost all irrational \alpha>0 (in the sense of Lebesgue measure) \limsup_{x\to\infty}\pi_{\alpha,\beta}^*(x)(\log x)^2/x>=1, where \pi_{\alpha,\beta}^*(x)={p<=x: both p and [\alpha p+\beta] are primes}.

Number Theory · Mathematics 2008-04-05 Hongze Li , Hao Pan

The Hausdorff dimension of the set of simultaneously tau well approximable points lying on a curve defined by a polynomial P(X)+alpha, where P(X) is a polynomial with integer coefficients and alpha is in R, is studied when tau is larger…

Number Theory · Mathematics 2013-05-14 Faustin Adiceam

We prove over fields of power series the analogues of several Diophantine approximation results obtained over the field of real numbers. In particular we establish the power series analogue of Kronecker's theorem for matrices, together with…

Number Theory · Mathematics 2019-11-27 Yann Bugeaud , Zhenliang Zhang

Let $0 < \beta \leq \alpha < 1$ and $\kappa > 0$. I prove that there exists $\eta > 0$ such that the following holds for every pair of Borel sets $A,B \subset \mathbb{R}$ with $\dim_{\mathrm{H}} A = \alpha$ and $\dim_{\mathrm{H}} B =…

Combinatorics · Mathematics 2023-11-13 Tuomas Orponen

We show that completeness at higher levels of the theory of the reals is a robust notion (under changing the signature and bounding the domain of the quantifiers). This mends recognized gaps in the hierarchy, and leads to stronger…

Computational Complexity · Computer Science 2025-03-04 Marcus Schaefer , Daniel Stefankovic