English

On the $t$-adic Littlewood Conjecture

Number Theory 2020-10-13 v2 Discrete Mathematics Formal Languages and Automata Theory Combinatorics Dynamical Systems

Abstract

The pp-adic Littlewood Conjecture due to De Mathan and Teuli\'e asserts that for any prime number pp and any real number α\alpha, the equation infm1mmpmα=0\inf_{|m|\ge 1} |m|\cdot |m|_p\cdot |\langle m\alpha \rangle|\, =\, 0 holds. Here, m|m| is the usual absolute value of the integer mm, mp|m|_p its pp-adic absolute value and x |\langle x\rangle| denotes the distance from a real number xx 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 K((t1))\mathbb{K}\left(\left(t^{-1}\right)\right) of a ground field K\mathbb{K}. This is the so-called \emph{tt-adic Littlewood Conjecture} (tt-LC). It is known that tt--LC fails when the ground field K\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 tt-LC does not hold in the case that K\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 F3\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.

Keywords

Cite

@article{arxiv.1806.04478,
  title  = {On the $t$-adic Littlewood Conjecture},
  author = {Faustin Adiceam and Erez Nesharim and Fred Lunnon},
  journal= {arXiv preprint arXiv:1806.04478},
  year   = {2020}
}

Comments

36 pages

R2 v1 2026-06-23T02:27:13.802Z