Polynomial configurations in sets of positive upper density over local fields

DOI10.1007/S11854-020-0133-4MaRDI QIDQ2227134zbMATH OpenOpenAlexFDO

Authors Mohammad Bardestani, Keivan Mallahi Karai

Publication date 10 February 2021

Published in Journal d'Analyse Mathématique (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.06024

zbMATH Keywords

Borel chromatic numberCayley graphunit distance graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Infinite graphs (05C63)

Abstract: Let $F(x)=(f_1(x),dots,f_m(x))$ be such that $1,f_1,dots,f_m$ are linearly independent polynomials with real coefficients. Based on ideas of Bachoc, DeCorte, Oliveira and Vallentin in combination with estimating certain oscillatory integrals with polynomial phase we will show that the independence ratio of the Cayley graph of $mathbb{R}^m$ with respect to the portion of the graph of $F$ defined by $aleqlog|s|leqT$ is at most $O(1/(T-a))$. We conclude that if $Isubseteqmathbb{R}^m$ has positive upper density, then the difference set $I-I$ contains vectors of the form $F(s)$ for an unbounded set of values $sinmathbbR$. It follows that the Borel chromatic number of the Cayley graph of $mathbb{R}^m$ with respect to the set $pmF(s):sinmathbbR$ is infinite. Analogous results are also proven when $mathbbR$ is replaced by the field of $p$-adic numbers $mathbb{Q}_p$. At the end, we will also the existence of real analytic functions $f_1,dots,f_m$, for which the analogous statements no longer hold.

Recommendations

• Polynomial configurations in difference sets
• Sets of large dimension not containing polynomial configurations
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• ERGODIC AVERAGES FOR INDEPENDENT POLYNOMIALS AND APPLICATIONS
• Distance graphs and sets of positive upper density in \(\mathbb{R}^d\)

Cites work

• A van der Corput lemma for the 𝑝-adic numbers
• An embedding theorem for fields
• Chromatic numbers of Cayley graphs on Z and recurrence
• Classical Fourier analysis
• Distances realized by sets covering the plane
• Fourier Analysis on Local Fields. (MN-15)
• Fourier analysis, linear programming, and densities of distance avoiding sets in R^n
• Graph theory
• scientific article; zbMATH DE number 3174732 (Why is no real title available?)
• scientific article; zbMATH DE number 3719449 (Why is no real title available?)
• scientific article; zbMATH DE number 1324223 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 1943977 (Why is no real title available?)
• scientific article; zbMATH DE number 2134811 (Why is no real title available?)
• Intersection theorems with geometric consequences
• L 2 Boundedness of Hilbert Transforms Along Surfaces and Convolution Operators Homogeneous with Respect to a Multiple Parameter Group
• Lower bounds for measurable chromatic numbers
• On a generalization of the Hadwiger-Nelson problem
• On the affine Bezout inequality
• On the chromatic number of a space
• On the chromatic number of structured Cayley graphs
• Polynomial configurations in difference sets
• Shorter Notes: An Elementary Proof of Steinhaus's Theorem
• Special functions on locally compact fields
• Spectral bounds for the independence ratio and the chromatic number of an operator
• The chromatic number of the plane is at least 5
• The estimation of an integral arising in multiplier transformations
• The Mathematical Coloring Book
• The realization of distances in measurable subsets covering R^ n.
• The realization of distances within sets in Euclidean space

This page was built for publication: Polynomial configurations in sets of positive upper density over local fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227134)