Searcharxiv⌕ Search

arXiv subjects

Florian Karl Richter

Publications and source records attributed to Florian Karl Richter.

5 recordsLinked to original sources

On the local Fourier uniformity problem for small sets

We consider vanishing properties of exponential sums of the Liouville function $λ$ of the form $$ \lim_{H\to\infty}\limsup_{X\to\infty}\frac{1}{\log X}\sum_{m\leq X}\frac{1}{m}\sup_{α\in C}\bigg|\frac{1}{H}\sum_{h\leq H}λ(m+h)e^{2πihα}\bigg|=0, $$ where $C\subset\mathbb{T}$. The case $C=\mathbb{T}$ corresponds to the local $1$-Fourier uniformity conjecture of Tao, a central open problem in the study of multiplicative functions with far-reaching number-theoretic applications. We show that the above holds for any closed set $C\subset\mathbb{T}$ of zero Lebesgue measure. Moreover, we prove that extending this to any set $C$ with non-empty interior is equivalent to the $C=\mathbb{T}$ case, which shows that our results are essentially optimal without resolving the full conjecture. We also consider higher-order variants. We prove that if the linear phase $e^{2πihα}$ is replaced by a polynomial phase $e^{2πih^tα}$ for $t\geq 2$ then the statement remains true for any set $C$ of upper box-counting dimension $<1/t$. The statement also remains true if the supremum over linear phases is replaced with a supremum over all nilsequences coming form a compact countable ergodic subsets of any $t$-step nilpotent Lie group. Furthermore, we discuss the unweighted version of the local $1$-Fourier uniformity problem, showing its validity for a class of ``rigid'' sets (of full Hausdorff dimension) and proving a density result for all closed subsets of zero Lebesgue measure.

math.DS↗

A proof of a sumset conjecture of Erdős

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured component and a pseudo-random component. Our methods are quite general, allowing us to prove a version of this conjecture for countable amenable groups.

math.CO↗

Revisiting the nilpotent polynomial Hales-Jewett theorem

Answering a question posed by Bergelson and Leibman in [6], we establish a nilpotent version of the polynomial Hales-Jewett theorem that contains the main theorem in [6] as a special case. Important to the formulation and the proof of our main theorem is the notion of a relative syndetic set (relative with respect to a closed non-empty subsets of $β\mathbf{G}$) [25]. As a corollary of our main theorem we prove an extension of the restricted van der Waerden Theorem to nilpotent groups, which involves nilprogressions.

math.CO↗

On the density of coprime tuples of the form $(n,\lfloor f_1(n)\rfloor,\ldots,\lfloor f_k(n)\rfloor)$, where $f_1,\ldots,f_k$ are functions from a Hardy field

Let $k\in\mathbb{N}$ and let $f_1,\ldots,f_k$ belong to a Hardy field. We prove that under some natural conditions on the $k$-tuple $(f_1,\ldots,f_k)$ the density of the set $$ \big\{n\in \mathbb{N}: \text{gcd}(n,\lfloor f_1(n)\rfloor,\ldots,\lfloor f_k(n)\rfloor)=1\big\} $$ exists and equals $\frac{1}{ζ(k+1)}$, where $ζ$ is the Riemann zeta function.

math.NT↗

Large subsets of discrete hypersurfaces in $\mathbb{Z}^d$ contain arbitrarily many collinear points

In 1977 L.T. Ramsey showed that any sequence in $\mathbb{Z}^2$ with bounded gaps contains arbitrarily many collinear points. Thereafter, in 1980, C. Pomerance provided a density version of this result, relaxing the condition on the sequence from having bounded gaps to having gaps bounded on average. We give a higher dimensional generalization of these results. Our main theorem is the following. Theorem: Let $d\in\mathbb{N}$, let $f:\mathbb{Z}^d\to\mathbb{Z}^{d+1}$ be a Lipschitz map and let $A\subset\mathbb{Z}^d$ have positive upper Banach density. Then $f(A)$ contains arbitrarily many collinear points. Note that Pomerance's theorem corresponds to the special case $d=1$. In our proof, we transfer the problem from a discrete to a continuous setting, allowing us to take advantage of analytic and measure theoretic tools such as Rademacher's theorem.

math.CO↗