On the t-adic Littlewood Conjecture

06/12/2018
by   Faustin Adiceam, et al.
0

The p-adic Littlewood Conjecture due to De Mathan and Teulié asserts that for any prime number p and any real number α, the equation _|m|> 1 |m|· |m|_p· |〈 mα〉| = 0 holds. Here, |m| is the usual absolute value of the integer m, |m|_p its p-adic absolute value and |〈 x〉| 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 K((t^-1)) of a ground field K. This is the so-called t-adic Littlewood Conjecture (t-LC). It is known that t--LC fails when the ground field K is infinite. This article is concerned with the much more difficult case when the latter field is finite. More precisely, a fully explicit counterexample is provided to show that t-LC does not hold in the case that 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 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.

READ FULL TEXT
research
10/10/2019

Addendum to "Fuglede's conjecture fails in 4 dimensions over odd prime fields"

We describe computer programs accompanying our paper and show that runni...
research
09/08/2018

A conjecture on permutation trinomials over finite fields of characteristic two

In this paper, by analyzing the quadratic factors of an 11-th degree pol...
research
12/23/2022

Counterexamples to a Conjecture of Dombi in Additive Number Theory

We disprove a 2002 conjecture of Dombi from additive number theory. More...
research
05/25/2022

Prime Holdout Problems

This paper introduces prime holdout problems, a problem class related to...
research
06/28/2023

A proof of the Etzion-Silberstein conjecture for monotone and MDS-constructible Ferrers diagrams

Ferrers diagram rank-metric codes were introduced by Etzion and Silberst...
research
04/28/2022

Skolem Meets Schanuel

The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros o...
research
07/26/2021

On the hardness of knowing busy beaver values BB(15) and BB(5,4)

The busy beaver value BB(n) is the maximum number of steps made by any n...

Please sign up or login with your details

Forgot password? Click here to reset