Searcharxiv⌕ Search

arXiv subjects

Thái Hoàng Lê

Publications and source records attributed to Thái Hoàng Lê.

15 recordsLinked to original sources

A Generalization of Sárközy's theorem in function fields

Sárközy's theorem says that if $A \subset \mathbb{Z}$ has positive upper asymptotic density, then there are distinct $a_1, a_2 \in A$ and $n \in \mathbb{Z}$ such that $a_1-a_2 = n^2$. The same is true if $n^2$ is replaced by $F(n)$ for any polynomial $F \in \mathbb{Z}[x]$ with constant term zero. Green proved an $\mathbb{F}_q[t]$-analog of Sárközy's theorem with strong quantitative bounds, but required a technical condition on the number of roots of the polynomial $F \in \mathbb{F}_q[x]$. This condition was recently removed by Li and Sauermann. In this paper, we generalize Green's argument to accommodate equations in more variables in $\mathbb{F}_q[t]$, while pointing out that the technical condition can be removed by means of a simple observation.

math.NT↗

Bourgain's $L^2$ pointwise ergodic theorem over function fields

We prove a function-field analogue of Bourgain's $L^2$ pointwise ergodic theorem. Let $q$ be a power of a prime $p$, let $\mathbb{F}_q[t]$ be the ring of polynomials over the finite field $\mathbb{F}_q$, and let $\mathbb{F}_q[t][u]$ be the ring of polynomials over $\mathbb{F}_q[t]$. Let $T^{(1)},\ldots,T^{(\ell)}$ be commuting, measure-preserving $\mathbb{F}_q[t]$-actions on a $σ$-finite measure space $(X,μ)$, and let $P_1,\ldots,P_\ell\in \mathbb{F}_q[t][u]\setminus\{0\}$. Define a sequence of operators $(A_n)_{n\in \mathbb{N}}$ by \[ A_n g(x):=\frac{1}{q^n}\sum_{\substack{f\in \mathbb{F}_q[t]\\°f 0$ depends only on $P_1,\ldots,P_\ell$ and $q$. This in particular implies that the sequence $(A_ng(x))_{n\in\mathbb{N}}$ converges for almost every $x\in X$ and that $(A_n)_{n\in\mathbb{N}}$ satisfies an $L^2$ maximal inequality: \[ \big\|\sup_{n\in\mathbb{N}}|A_ng|\big\|_{L^2(X)} \leq C_2\|g\|_{L^2(X)} \qquad \left( g\in L^2(X)\right), \] where the constant $C_2>0$ depends only on $P_1,\ldots,P_\ell$ and $q$. Our tools include the circle method in function fields and refinements of Weyl sum estimates in this setting, further developing the work of Lê-Liu-Wooley and Champagne-Ge-Lê-Liu-Wooley. These refinements are of independent interest.

math.DS↗

Bohr sets in sumsets III: expanding difference sets and almost Bohr sets

Let $G$ be a discrete abelian group. Følner showed that if $A \subseteq G$ has positive upper Banach density, then $A - A$ contains an almost Bohr set -- a set of the form $B \setminus E$ where $B$ is a Bohr set and $E$ has zero Banach density. We study the sets $S \subseteq G$ for which $A - A + S$ contains a Bohr set for every $A \subseteq G$ of positive upper Banach density. For $G = \mathbb{Z}$, we show that the sets $\{n^2: n \in \mathbb{N}\}$, $\{p - 1: p \text{ prime}\}$, and $\{ \lfloor n^c \rfloor: n \in \mathbb{N} \}$ with $c > 0$, have this property. Moreover, we prove that there are sets $A, B \subseteq \mathbb{Z}$ such that $A$ is dense in the Bohr topology of $\mathbb{Z}$, $d^*(B) > 0$, while $A + B$ is not piecewise Bohr, answering two questions of the second author in [31]. We also study those sets $S$ such that $A + S$ contains a Bohr set for every almost Bohr set $A$. As applications, we prove: (i) If $ϕ_1, ϕ_2: G \to G$ are (not necessarily commuting) homomorphisms with finite indices $[G: ϕ_i(G)]$, and $C \subseteq G$ is a central set, then $ϕ_1(C) - ϕ_1(C) + ϕ_2(C)$ contains a Bohr set. This answers one of our questions in [35] and generalizes results in [44, 48]; (ii) Every set of pointwise recurrence in $\mathbb{Z}$ is a set of nice recurrence and a van der Corput set, extending known properties of sets of pointwise recurrence studied in [26, 27, 40].

math.DS↗

Equidistribution of polynomial sequences in function fields: resolution of a conjecture

Let $\mathbb F_q$ be the finite field of $q$ elements having characteristic $p$, and denote by $\mathbb K_\infty=\mathbb F_q((1/t))$ the field of formal Laurent series in $1/t$. We consider the equidistribution in $\mathbb T=\mathbb K_\infty/\mathbb F_q[t]$ of the values of polynomials $f(u)\in \mathbb K_\infty [u]$ as $u$ varies over $\mathbb F_q[t]$. Let $\mathcal K$ be a finite set of positive integers, and suppose that $α_r\in \mathbb K_\infty$ for $r\in \mathcal K\cup \{0\}$. We show that the polynomial $\sum_{r\in \mathcal K\cup\{0\}}α_ru^r$ is equidistributed in $\mathbb T$ whenever $α_k$ is irrational for some $k\in \mathcal K$ satisfying $p\nmid k$, and also $p^vk\not\in \mathcal K$ for any positive integer $v$. This conclusion resolves in full a conjecture made jointly by the third, fourth and fifth authors.

math.NT↗

Bohr sets in sumsets I: Compact abelian groups

Let $G$ be a compact abelian group and $ϕ_1, ϕ_2, ϕ_3$ be continuous endomorphisms on $G$. Under certain natural assumptions on the $ϕ_i$'s, we prove the existence of Bohr sets in the sumset $ϕ_1(A) + ϕ_2(A) + ϕ_3(A)$, where $A$ is either a set of positive Haar measure, or comes from a finite partition of $G$. The first result generalizes theorems of Bogolyubov and Bergelson-Ruzsa. As a variant of the second result, we show that for any partition $\mathbb{Z} = \bigcup_{i=1}^r A_i$, there exists an $i$ such that $A_i - A_i + sA_i$ contains a Bohr set for any $s \in \mathbb{Z} \setminus \{ 0 \}$. The latter is a step toward an open question of Katznelson and Ruzsa.

math.CO↗

On additive bases in infinite abelian semigroups

Building on previous work by Lambert, Plagne and the third author, we study various aspects of the behavior of additive bases in infinite abelian groups and semigroups. We show that, for every infinite abelian group $T$, the number of essential subsets of any additive basis is finite, and also that the number of essential subsets of cardinality $k$ contained in an additive basis of order at most $h$ can be bounded in terms of $h$ and $k$ alone. These results extend the reach of two theorems, one due to Deschamps and Farhi and the other to Hegarty, bearing upon $\mathbf{N}$. Also, using invariant means, we address a classical problem, initiated by Erdős and Graham and then generalized by Nash and Nathanson both in the case of $\mathbf{N}$, of estimating the maximal order $X_T(h,k)$ that a basis of cocardinality $k$ contained in an additive basis of order at most $h$ can have. Among other results, we prove that $X_T(h,k)=O(h^{2k+1})$ for every integer $k \ge 1$. This result is new even in the case where $k=1$. Besides the maximal order $X_T(h,k)$, the typical order $S_T(h,k)$ is also studied. Our methods actually apply to a wider class of infinite abelian semigroups, thus unifying in a single axiomatic frame the theory of additive bases in $\mathbf{N}$ and in abelian groups.

math.CO↗

Intersective sets for sparse sets of integers

For $E \subset \mathbb{N}$, a subset $R \subset \mathbb{N}$ is $E$-intersective if for every $A \subset E$ having positive upper relative density, we have $R \cap (A - A) \neq \varnothing$. On the other hand, $R$ is chromatically $E$-intersective if for every finite partition $E=\bigcup_{i=1}^k E_i$, there exists $i$ such that $R\cap (E_i-E_i)\neq\varnothing$. When $E=\mathbb{N}$, we recover the usual notions of intersectivity and chromatic intersectivity. In this article, we investigate to which extent known intersectivity results hold in the relative setting when $E = \mathbb{P}$, the set of primes, or other sparse subsets of $\mathbb{N}$. Among other things, we prove: -There exists an intersective set that is not $\mathbb{P}$-intersective. -However, every $\mathbb{P}$-intersective set is intersective. -There exists a chromatically $\mathbb{P}$-intersective set which is not intersective (and therefore not $\mathbb{P}$-intersective). -The set of shifted Chen primes $\mathbb{P}_{\mathrm{Chen}} + 1$ is $\mathbb{P}$-intersective (and therefore intersective).

math.NT↗

Bohr sets in sumsets II: countable abelian groups

We prove three results concerning the existence of Bohr sets in threefold sumsets. More precisely, letting $G$ be a countable discrete abelian group and $ϕ_1, ϕ_2, ϕ_3: G \to G$ be commuting endomorphisms whose images have finite indices, we show that (1) If $A \subset G$ has positive upper Banach density and $ϕ_1 + ϕ_2 + ϕ_3 = 0$, then $ϕ_1(A) + ϕ_2(A) + ϕ_3(A)$ contains a Bohr set. This generalizes a theorem of Bergelson and Ruzsa in $\mathbb{Z}$ and a recent result of the first author. (2) For any partition $G = \bigcup_{i=1}^r A_i$, there exists an $i \in \{1, \ldots, r\}$ such that $ϕ_1(A_i) + ϕ_2(A_i) - ϕ_2(A_i)$ contains a Bohr set. This generalizes a result of the second and third authors from $\mathbb{Z}$ to countable abelian groups. (3) If $B, C \subset G$ have positive upper Banach density and $G = \bigcup_{i=1}^r A_i$ is a partition, $B + C + A_i$ contains a Bohr set for some $i \in \{1, \ldots, r\}$. This is a strengthening of a theorem of Bergelson, Furstenberg, and Weiss. These results are quantitative in the sense that the radius and rank of the Bohr set obtained depends only on the indices $[G:ϕ_j(G)]$, the upper Banach density of $A$ (in (1)), or the number of sets in the given partition (in (2) and (3)).

math.CO↗

Equidistribution of polynomial sequences in function fields, with applications

We prove a function field analog of Weyl's classical theorem on equidistribution of polynomial sequences. Our result covers the case in which the degree of the polynomial is greater than or equal to the characteristic of the field, which is a natural barrier when applying the Weyl differencing process to function fields. We also discuss applications to van der Corput, intersective and Glasner sets in function fields.

math.NT↗

Multidimensional configurations in the primes with shifted prime steps

Let $\mathcal{P}$ denote the set of primes. For a fixed dimension $d$, Cook-Magyar-Titichetrakun, Tao-Ziegler and Fox-Zhao independently proved that any subset of positive relative density of $\mathcal{P}^d$ contains an arbitrary linear configuration. In this paper, we prove that there exists such configuration with the step being a shifted prime (prime minus $1$ or plus $1$).

math.DS↗

Linear and quadratic uniformity of the Möbius function over $\mathbb{F}_q[t]$

We examine correlations of the Möbius function over $\mathbb{F}_q[t]$ with linear or quadratic phases, that is, averages of the form \begin{equation} \label{eq:average} \frac{1}{q^n}\sum_{\text{deg }f 0$ if $Q$ is linear and $O \left( q^{-n^c} \right)$ for some absolute constant $c>0$ if $Q$ is quadratic. The latter bound may be reduced to $O(q^{-c'n}$) for some $c'>0$ when $Q(f)$ is a linear form in the coefficients of $f^2$, that is, a Hankel quadratic form, whereas for general quadratic forms, it relies on a bilinear version of the additive-combinatorial Bogolyubov theorem.

math.NT↗

A bilinear Bogolyubov theorem

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums and differences on $P$, that is, operations on the second coordinate when the first one is fixed, or vice versa. The structure we find is the zero set of a family of bilinear forms on a Cartesian product of vector subspaces. The codimensions of the subspaces and the number of bilinear forms involved are bounded by a function $c(δ)$ of the density $δ=\lvert P\rvert/p^{2n}$ only. The proof uses various tools of additive combinatorics, such as the (linear) Bogolyubov theorem, the density increment method, as well as the Balog-Szemerédi-Gowers and Freiman-Ruzsa theorems.

math.CO↗

Additive bases in groups

In this paper, we study the problem of removing an element from an additive basis in a general abelian group. We introduce analogues of the classical functions $X$, $S$ and $E$ (defined in the case of the integers) and obtain bounds on them. Our estimates on the functions $S_G$ and $E_G$ are valid for general abelian groups $G$ while in the case of $X_G$ we show that distinct types of behaviours may occur depending on the group $G$.

math.NT↗

On primitive elements in finite fields of low characteristic

We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, $\mathbb{F}_{q^n}$, small $q$ and large $n$, we show that the set of all low degree polynomials contains the expected number of primitive elements. The main theorem we prove is a bound for character sums over short intervals in function fields. Our result is unconditional and slightly better than what is known (conditionally under GRH) in the integer case and might be of independent interest.

math.NT↗

Deterministic Extractors for Additive Sources

We propose a new model of a weakly random source that admits randomness extraction. Our model of additive sources includes such natural sources as uniform distributions on arithmetic progressions (APs), generalized arithmetic progressions (GAPs), and Bohr sets, each of which generalizes affine sources. We give an explicit extractor for additive sources with linear min-entropy over both $\mathbb{Z}_p$ and $\mathbb{Z}_p^n$, for large prime $p$, although our results over $\mathbb{Z}_p^n$ require that the source further satisfy a list-decodability condition. As a corollary, we obtain explicit extractors for APs, GAPs, and Bohr sources with linear min-entropy, although again our results over $\mathbb{Z}_p^n$ require the list-decodability condition. We further explore special cases of additive sources. We improve previous constructions of line sources (affine sources of dimension 1), requiring a field of size linear in $n$, rather than $Ω(n^2)$ by Gabizon and Raz. This beats the non-explicit bound of $Θ(n \log n)$ obtained by the probabilistic method. We then generalize this result to APs and GAPs.

cs.CC↗