Polynomial configurations in sets of positive upper density over local fields
Mohammad Bardestani, Keivan Mallahi-Karai

TL;DR
This paper demonstrates that sets of positive upper density in real and p-adic fields contain polynomial difference configurations, leading to infinite Borel chromatic numbers for certain Cayley graphs, with some real analytic functions as exceptions.
Contribution
It establishes polynomial difference configurations in dense sets over local fields and analyzes their implications for graph coloring and independence ratios.
Findings
Difference sets contain polynomial configurations for unbounded parameters.
Borel chromatic number of related Cayley graphs is infinite.
Existence of real analytic functions where configurations do not hold.
Abstract
Let be such that 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 with respect to the portion of the graph of defined by is at most . We conclude that if has positive upper density, then the difference set contains vectors of the form for an unbounded set of values . It follows that the Borel chromatic number of the Cayley graph of with respect to the set is infinite. Analogous results are also proven when is replaced by the field of -adic numbers…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Polynomial configurations in sets of positive upper density over local fields
Mohammad Bardestani
DPMMS, Centre for Mathematical Sciences, Wilberforce Road, Cambridge, CB3 0WB.
and
Keivan Mallahi-Karai
Jacobs University Bremen, Campus Ring I, 28759 Bremen, Germany.
Abstract.
Let be such that are linearly independent polynomials with real coefficients. Based on ideas of Bachoc, DeCorte, de 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 with respect to the portion of the graph of defined by is at most . We conclude that if has positive upper density, then the difference set contains vectors of the form for an unbounded set of values . It follows that the Borel chromatic number of the Cayley graph of with respect to the set is infinite. Analogous results are also proven when is replaced by the field of -adic numbers . At the end, we will also show the existence of real analytic functions , for which the analogous statements no longer hold.
Key words and phrases:
Chromatic number; Fourier transform; Local fields, Oscillatory integrals.
1991 Mathematics Subject Classification:
Primary 05C10; Secondary 47A10.
Contents
1. Introduction
The purpose of this paper is to establish a relation between the theory of real (and -adic) singular integrals to the Borel chromatic number and independence ratio of Cayley graphs of (and ) with respect to sets defined by algebraic equations.
For an abelian group (in this paper, typically, or ) and a symmetric subset (i.e., ) which does not contain the identity element of , let denote the Cayley graph of with respect to . The vertex set of is identified with and vertices are declared adjacent whenever . Recall that the chromatic number of a graph , denoted by , is the least cardinal such that the vertices of can be partitioned into sets (called color classes) such that no color class contains an edge in . When the vertex set of is equipped with a topology, the Borel chromatic number of , denoted by , is defined to be the least cardinal such that the vertex set of can be partitioned into Borel subsets none of which contains two adjacent vertices of .
It is easy to observe that when is a compact symmetric subset of (or ) not containing the origin, then the Borel (and, a fortiori, the ordinary) chromatic number of is finite. Still, determining the exact values of the ordinary or Borel chromatic number could be a challenging problem. Perhaps the most prominent instances of such graphs are the unit distance graphs, defined to be the Cayley graph of (for some integer ) with respect to the unit sphere
[TABLE]
Even for the special case , the elementary inequalities remained the best known bounds for many years and only quite recently the lower bound was improved to in the spectacular work of de Grey [Grey]. Frankl and Wilson [Frankl-Wilson] answered affirmatively a question of Erdős by proving that for the lower bound holds for . This bound was subsequently improved to by Raigorodskii [Raigorodskii]. Larman and Rogers [Larman-Rogers] established the upper bound , for . For more results on this problem, we refer the reader to [Soifer, Szekely] and the references therein.
Falconer [Falconer1] initiated the study of the Borel chromatic number of the unit distance graphs by using ideas from geometric measure theory and showed that
[TABLE]
More recently, Bachoc, Nebe, de Oliveira and Vallentin [Bachoc] employed tools from Fourier analysis and linear programming methods to improve the existing lower bounds for when . These bounds have been further extended by de Oliveira and Vallentin [Vallentin] to the range .
The definition of the unit distance graphs can be reformulated via quadratic forms over an arbitrary field. Let be a field and let be a quadratic form with coefficients in . To this quadratic from, one can assign the following unit sphere
[TABLE]
The quadratic graph associated to is, by definition, the Cayley graph . Note that the unit distance graph is a special case of this construction corresponding to and the standard quadratic form . Woodall [Woodall] studied the quadratic graph for the form and showed that .
The problem of determining the Borel chromatic number with respect to an unbounded set is more subtle, and seems to depend on the behavior of at infinity. As a motivating example, suppose is the field of real or -adic numbers, and let be an arbitrary (non-degenerate) quadratic form with coefficients in . The following dichotomy was established in [Bar-Kei]: either is anisotropic, that is, there exists no non-zero vector with , in which case is compact and is finite, or is isotropic in which case is unbounded and . As an application, it was shown that both in real and -adic case, if is partitioned into finitely many Borel sets then at least one of these sets contains matrices such that .
The problem of computing the Borel chromatic number of is closely related to finding bounds for certain oscillatory integrals. It is worth mentioning that in the -adic case it is related to -adic Bessel functions developed by Sally and Taibleson [Sally]. On the other hand when is a finite field, computing the chromatic number of quadratic graphs boils down to estimating Kloosterman sums which can be considered as a finite version of -adic Bessel functions. We refer the reader to [Bar-Kei, MBKloo] for more details.
These special cases naturally suggest the question of studying the Borel chromatic number for the Cayley graphs of and with respect to more general classes of algebraically defined sets . In particular, we can ask:
Question 1.1**.**
Let be the field of real or -adic numbers, and assume that is algebraic, that is, is the intersection of the zero sets of a finite number of polynomials with coefficients in . Suppose is symmetric, unbounded and does not contain zero. When is the Borel chromatic number of infinite?
One of the main results of this paper will partially answer this question. In order to state the results and ideas of the proof we will need to set some notation.
1.1. Notation
Throughout this paper will denote either , the field of real numbers, or , the field of -adic numbers, for a prime number . The vector space is equipped with the euclidean norm when , and with the supremum norm with respect to the -adic metric when . Both norms will be denoted by . The ball of radius centered at zero with respect to the metric induced by these norms is denoted by . Moreover, throughout we use the shorthand when , and when .
As a locally compact topological group has a Haar measure and the measure of a Borel set will be denoted by . When , the Haar measure is normalized so that , the ring of -adic integers, carries measure one. For a set , the difference set consists of all differences with .
Let be an arbitrary Borel set. An independent set of is a Borel subset of which does not contain a pair of adjacent vertices. The upper density of any Borel set is defined by
[TABLE]
The independence ratio of is defined by
[TABLE]
1.2. Main results
Having set the notation, we are now ready to state our first result.
Theorem 1.2**.**
Let be as above, and let be polynomials such that are -linearly independent. Then there exist constants and depending only on , such that for any we have
[TABLE]
where
[TABLE]
where is the base of natural logarithm when , and , when .
Remark 1.3**.**
By a theorem of Steinhaus [Stromberg], the difference set of a set of positive measure contains an open neighborhood of zero. From this it follows immediately that if zero is in the closure of then . Hence in Theorem 1.2 we must pick large enough so that the origin is not in the closure of .
When , the Borel chromatic number and the independence ratio of a topological graph are related by the inequality
[TABLE]
Since is a compact set which does not contain zero, one can easily see that the Borel chromatic number of is finite and thus the independent ratio of is strictly positive. Hence by combining Eq. 4 and Theorem 1.2, we obtain the following result.
Corollary 1.4**.**
With the same notations as Theorem 1.2, we have:
[TABLE]
Let us describe the key ideas of the proof of Theorem 1.2. As in [Bar-Kei], the proof is based on finding a spectral upper bound for the independence ratio of using an analytic analog of the Hoffman bound from [Bachoc2]. The crucial step in the proof relies on establishing a lower bound for a family of oscillatory real and -adic integrals that arise as the Fourier transform of carefully chosen probability measures on . Let us remark that the analysis in [Bar-Kei] also takes advantage of a family of probability measures on the hyperbola constructed as the push-forward of the normalized truncated Haar measure of the multiplicative group via the map . However, the homogeneous structure of the hyperbola does not have an analog in the general setting considered in the current work. One novelty of this work is in finding an analogous family of measures on the given polynomial curve in the absence of the symmetry used in the previous work. Aside from this, a number of technical obstacles must be overcome in our new setting, as the generality of the measures considered here does not allow the van der Corput lemma to be applied directly to obtain the desired lower bounds for the Fourier transform of these measures. It turns out that one has to handle the frequencies that lie between two specific affine hyperplanes differently from the rest. In each case, one uses a suitable partition of the domain into a uniformly bounded number of intervals (sphere in the -adic case) in order to obtain a required uniform lower bound.
It is worth mentioning that a discrete analog of Theorem 1.2 has been proven by Furstenberg and Sárközy [Furstenberg2, Proposition 3.19]. According to this theorem, if and , then for all sets of positive upper density, there exist distinct such that the equation has a solution for some . Lyall and Magyar obtained a quantitative version of Furstenberg-Sárközy’s theorem. More precisely, they proved [Lyall-Magyar] that for and a family of linearly independent polynomials in with , if for any , then
[TABLE]
for some absolute constant . The following reformulation of Theorem 1.2 highlights its similarity to Furstenberg-Sárközy’s theorem.
Corollary 1.5** (High dimensional polynomial configurations).**
Assume that , , and are as in Theorem 1.2. For any and any Borel set with
[TABLE]
there exists with and distinct such that
[TABLE]
Remark 1.6**.**
Let us remark that even when have integer coefficients, the above theorem is not a formal consequence of the theorem of Furstenberg and Sárközy. For instance take , which has positive density in , and let and . Observe that has positive upper density in since . Due to arithmetic obstructions, there are no and such that .
Corollary 1.7** (Polynomial configurations).**
Let , , and be as in Theorem 1.2. For any and any Borel set with
[TABLE]
there exists with such that
[TABLE]
Proof.
Let be as above. Then and so from Corollary 1.5 we obtain the result. ∎
Let us now turn to studying the Borel chromatic number of Cayley graphs assigned to algebraic varieties.
Remark 1.8**.**
By Steinhaus theorem, mentioned in Remark 1.3, if zero is in the topological closure of then (see Lemma 2.7). Conversely, if , the closure of , then the Borel chromatic number of is at most . Moreover, one can easily show that is finite when is bounded and .
From Corollary 1.4 and Remark 1.8 we deduce the following qualitative result, which gives an answer to a special case of 1.1:
Corollary 1.9** (Infinite Borel chromatic number).**
Let be as in Theorem 1.2. Then for all sufficiently large we have
[TABLE]
where
[TABLE]
The assumption that are linearly independent is quite natural in this context. In fact if are linearly dependent, then will be contained in an affine hyperplane in and one can easily see that the Borel chromatic number of the Cayley graph associated to a hyperplane which does not pass through the origin is finite. More generally, we have
Theorem 1.10** (Multivariate polynomial configurations).**
Let be polynomials such that are linearly independent. Then for any we have
[TABLE]
where
Proof.
Suppose that the maximum degree of is . Set for all and substitute with . Thus the monomial will be substituted by , where
[TABLE]
Notice that is injective on the cube defined by . This clearly follows from the fact that are digits of when expressed in base , and hence are uniquely determined by . Thus we obtain polynomials such that are -linearly independent. Then from Remark 1.8 and Corollary 1.9 we obtain the result. ∎
Let us now address a number of questions that naturally arise in connection with theorems stated above. Recall that the clique number of a graph , denoted by , is the largest for which has a subgraph isomorphic to the complete graph . Since , the claim in Corollary 1.9, and hence Theorem 1.10, would be trivial if one could exhibit arbitrarily large cliques in . However, we will show that there is an algebraic obstruction to this, suggesting that the infinitude of the Borel chromatic number cannot be proven by such local arguments. Obviously, it is enough to prove the nonexistence of large cliques in these graphs when the base field is replaced by an algebraic closure.
Theorem 1.11**.**
Let be an algebraic closed field of characteristic [math], and let be an irreducible variety with that is not an affine line. Then
[TABLE]
Another point that has to be addressed is the extent to which the polynomial nature of the map is essential for the above results to hold. The next theorem shows that they cannot be replaced by real analytic functions.
Theorem 1.12**.**
There exists a real analytic curve such that the image of does not lie between any two parallel lines and the Borel chromatic number of the Cayley graph of with respect to its graph
[TABLE]
is finite.
As it was earlier mentioned, proving statements analogous to Theorem 1.10 for the ordinary chromatic number seems to be quite difficult. This difficulty can be traced back to the fact that proving such statements is equivalent to finding (or proving the existence of) finite subgraphs of arbitrarily large chromatic number inside the Cayley graphs. In the last section of this paper, we will prove a general theorem that highlights this point by showing that the question of determining the chromatic number over is indeed algebraic in nature.
Let be an algebraic set defined over , given as the intersection of the zero set of polynomials for . Without loss of generality, we can assume that . If is any ring of characteristic zero, we can define the -points of as
[TABLE]
For prime, we will denote by the ring of -adic integers.
Theorem 1.13**.**
Let be an irreducible variety defined over . Then
[TABLE]
if one of the two sides is finite. The sup is taken over all primes .
The proof of Theorem 1.13 relies on a theorem of de Bruijn and Erdős which relates the chromatic number of a graph to its finite subgraphs and an embedding theorem of Cassels [Cassels].
2. A spectral bound for the independence ratio
Let be a finite regular graph with vertices and the adjacency matrix . Let
[TABLE]
denote the spectrum of , and assume that is an independent set of . The celebrated Hoffman bound states that
[TABLE]
It is a reinterpretation of this inequality that is the key to the generalization we will need later. Denote by the Hilbert space of complex-valued functions on , equipped with the inner product
[TABLE]
The adjacency operator , defined by , is easily seen to be self-adjoint. Further, one can see that its numerical range defined by
[TABLE]
is equal to . It is a routine verification that a subset is independent in if and only if for all supported on , one has . This novel interpretation of independent sets is used in [Bachoc2] to prove an analog of the Hoffman bound for certain Cayley graphs of the Euclidean additive group . As we will need to work in a slightly more general framework, it will be useful to briefly review some of the key points of [Bachoc2]; for details, we refer the reader to the original paper [Bachoc2].
Abstractly, let be a probability space, consisting of a set , a -algebra on , and a probability measure , and consider the Hilbert space of square integrable functions with respect to the inner product:
[TABLE]
For a bounded and self-adjoint operator , one can show that the numerical range of , defined by
[TABLE]
is an interval in . We denote the endpoints of by
[TABLE]
Definition 2.1**.**
Let be a bounded, self-adjoint operator. A measurable set is called an independent set for if for each which vanishes almost everywhere outside of . Moreover, the chromatic number of , denoted by , equals the least number such that one can partition into independent sets for .
The independence ratio of is defined by
[TABLE]
The following theorem, which can be obtained by a clever modification of the proof of Hoffman’s bound presented by Bollobás [Bollobas, Chapter VIII.2], recovers Eq. 11 when is the adjacency matrix of a finite regular graph.
Theorem 2.2**.**
Let be a probability space and let be a nonzero, bounded, self-adjoint operator. Fix a real number and set , where is the characteristic function of . Suppose there exists a set with which is independent for . Then, if , we have
[TABLE]
Proof.
See [Bachoc2, Theorem 2.2]. ∎
Remark 2.3**.**
Let be a nonzero, bounded and self-adjoint operator. Moreover assume that . Bachoc, DeCorte, de Oliveira and Vallentin proved [Bachoc2, Theorem 2.3]
[TABLE]
which is an analogue of Hoffman’s bound for the chromatic number. Similar to the Hoffman bound, when and the proof of Eq. 14 shows that and .
We now apply these theorems to estimate the independence ratio of Cayley graphs of , where, as before, or for a prime . All that follows is parallel to [Bachoc2], where the case is dealt with; in fact, arguments in [Bachoc2] can be easily seen to work also in the -adic case. For the convenience of the reader we will briefly sketch the key points.
Denote by a Haar measure on . When , we assume that it is normalized such that . We will also write for the product (Haar) measure on . For a Borel set we use to denote the measure of . Throughout we will assume that is a Borel set which is bounded and symmetric (i.e., ) and does not contain the origin in its closure. Let be a Borel probability measure on supported in . We will also assume that is symmetric, i.e., holds for all Borel sets . One can easily verify that the following operator is a bounded and self-adjoint operator [Folland, Proposition 8.49]
[TABLE]
where
[TABLE]
The numerical range of can now be determined using Fourier analysis. Below, we will review a number of basic properties of the Fourier transform over and . For details we refer the reader to [Rudin] for harmonic analysis over and [Taibleson] for -adic harmonic analysis. When , we will use the character
[TABLE]
When , for , we write for the smallest non-negative integer such that . Let be an integer such that . It is well-known that the following map (called the Tate character)
[TABLE]
is a non-trivial character of with the kernel .
The Fourier transforms of and are respectively defined by the integrals
[TABLE]
Here is the standard bilinear form on , and is the complex conjugate of . We remark that since is symmetric, its Fourier transform is a real-valued function. By Plancherel’s theorem the Fourier transform extends to an isometry on and thus for any we have
[TABLE]
Lemma 2.4**.**
Let be a bounded symmetric Borel set which does not contain the origin in its closure, and let be a symmetric Borel probability measure on supported on . Then the numerical range of is given by
[TABLE]
Proof.
From Eq. 17 combined with the fact that the Fourier transform on is an isometry, we deduce that the numerical range of the operator is the same as the numerical range of the multiplication operator . Since is a symmetric Borel probability measure, is a bounded continuous real-valued function. Now let with . Evidently
[TABLE]
and so Now let and pick with . Let be the ball of radius centered at . Since is continuous, we conclude that
[TABLE]
where is the characteristic function of . Hence and so we have . Similarly, since is a probability measure, we obtain . ∎
Let us now consider the independence ratio of . First note that and so any independent set of is also an independent set of . Therefore
[TABLE]
Since is bounded and the origin is not in the closure of , it is easy to see that the Borel chromatic number of is finite. Therefore from Remark 2.3 we have
[TABLE]
For , let be the ball of radius centered at the origin, and normalize the induced Haar measure on . Define by
[TABLE]
where is the extension of to defined to be zero on . By abuse of notation, we will continue to write for . Now let be an independent set of . Hence is an independent set for the operator . From the definition of the independence ratio of an operator, we obtain the following density bound:
[TABLE]
This implies that and so from (18) we deduce
[TABLE]
For a given , define
[TABLE]
where is the characteristic function of .
Lemma 2.5**.**
With the above notation, we have
[TABLE]
Before proving this lemma, we recall that the -adic norm on has the ultrametric property, i.e., with equality if .
Proof of Lemma 2.5.
Let . Define . Then
[TABLE]
Hence . Conversely, as , we have
[TABLE]
since in . This shows that .
Recall that is a probability measure with . Thus for every we have
[TABLE]
Since is bounded, we can assume that for some . When , then for , by the ultrametric inequality, we obtain from which (22) follows.
Now assume that . Let and . Then from Eq. 23 we deduce that for all . Hence Finally
[TABLE]
Then by the triangular inequality we deduce that . ∎
Combining Theorem 2.2, Lemmas 2.4 and 2.5 and Eqs. 19 and 20 we obtain the following theorem:
Theorem 2.6**.**
Let be a bounded, symmetric Borel subset of which does not contain the origin in its closure. Then for any symmetric, Borel probability measure on with support contained in we have
[TABLE]
We conclude this section with the following general fact.
Lemma 2.7**.**
Let be a symmetric Borel set, and assume that . Then the Borel chromatic number of is at most , if and only if the origin is not in the closure of .
Proof.
First assume that . Choose such that . This, in particular, implies that is an independent set for . Note that since is dense in , we have
[TABLE]
This countable cover can then be easily transformed further into a disjoint countable cover of independent Borel (in fact, locally closed) sets, yielding the desirable coloring.
Now assume . From countable additivity, it follows that there exists a color class with positive Lebesgue measure. Using the aforementioned theorem of Steinhaus, there exists such that . Since is independent, it follows that , and so . ∎
3. Oscillatory integrals with real polynomial phase
We are now ready to prove Theorem 1.2 in the case . Throughout this section we fix polynomials , , with real coefficients such that
[TABLE]
are linearly independent over . Let . From Eq. 25 we deduce that . Set
[TABLE]
where is the Euler number. Fix , and for , consider the following symmetric, bounded set
[TABLE]
Since , we have . Let be the measure on defined for every Borel subset via
[TABLE]
It is easy to verify that is a symmetric Borel probability measure on and . The Fourier transform of this measure is given by
[TABLE]
These integrals resemble certain singular integrals that were studied by Stein and Wainger [Stein-Wainger]. Let be a polynomial with real coefficients of degree at most , and define
[TABLE]
Stein and Wainger [Stein-Wainger] proved that that , where the constant depends only on the degree of . In our case we need to consider the truncated integral instead of its principal value. For our purposes, it would be convenient to apply the logarithmic change of variables :
[TABLE]
Theorem 3.1**.**
There exists a constant , depending only on the polynomials , such that for all , and any we have
[TABLE]
After completing this paper, we were informed by James Wright that Nagel and Wainger have studied similar oscillatory integrals in connection to boundedness of Hilbert transform. In fact, using several reductions Theorem 3.1 may be obtained from [Nagel, Theorem 3.1 and Corollary 3.6]. Since these steps are also rather lengthy, and also for convenience of readers less familiar with harmonic analysis, we will provide our own elementary proof here, which will also facilitate understanding the proof in the -adic case.
We will start by proving two simple combinatorial lemmas. In what follows, two intervals and are called disjoint if has no interior point.
Lemma 3.2**.**
Let be such that each is a union of at most intervals. Then there exist disjoint intervals such that and for each , there exists such that .
Proof.
This follows easily from the fact that the intersection of two intervals in is either empty or an interval. ∎
Lemma 3.3**.**
Let be a polynomial of degree and set . Then for any , the set can be split to a disjoint union of intervals such that and is monotone on each .
Proof.
Consider the superlevel set . As is open, it is either or a union of open intervals with each end-point a solution for . Note that since the exponential map is strictly increasing, the equation has at most solutions, hence, . Suppose is one of these intervals such that the equation has roots in . Upon replacing each such interval by the disjoint union the number of intervals increases by at most (a bound for the number of roots of ), while is monotone over each one of the new intervals. The total number of produced intervals is . ∎
Let be an arbitrary vector. For the rest of this section we set
[TABLE]
We will use the following version of the van der Corput lemma [Grafakos, Proposition 2.6.7.].
Theorem 3.4** (van der Corput’s Lemma).**
Suppose that a real-valued function satisfies
[TABLE]
for all , where is an integer. Then
[TABLE]
provided, in addition when , that is monotonic on .
Proof of Theorem 3.1.
Since , we can assume that is not-zero. We will prove Theorem 3.1 by considering two cases.
3.1. Low frequency case
Let be an arbitrary vector such that
[TABLE]
Lemma 3.5**.**
There exist real numbers , where , such that
[TABLE]
Proof.
For any , let . Using Lagrange’s interpolation method (or Vendermonde determinant) we can find real numbers , not all zero, such that for every . Note that Hence we obtain
[TABLE]
which finishes the proof. ∎
Set
[TABLE]
and let be provided by Lemma 3.5. Define . In the rest of this proof, certain constants will appear whose values will depend only on . We will denote these constants by . The exact values of these constants (which are all of the form ) are not important, and hence we will not keep track of them consistently. First, we will show that can be expressed as a disjoint union of intervals such that in each interval is monotone and for a fixed .
We recall that are linearly independent and is not-zero. Thus is a polynomial of degree at least and at most . Hence from Lemma 3.3 we know that can be written as a disjoint union of at most intervals such that is monotone on each . Moreover notice that for each we have
[TABLE]
In fact, if for some we have for all , then using Eq. 29 we obtain
[TABLE]
which is a contradiction since . For each set
[TABLE]
Again by Lemma 3.3, each is a union of at most intervals and so by Lemma 3.2 there exists disjoint intervals such that and for each , there exists such that . Hence from Eq. 30 we deduce that
[TABLE]
is a union of at most disjoint intervals such that in each interval is monotone and for a fixed . Hence, by applying van der Corput lemma for each , there exists an absolute constant , depending only on the polynomials , such that for all and we have
[TABLE]
Moreover since the intervals partition into intervals, then there exists another absolute constant , depending only on the polynomials , such that
[TABLE]
Also it is immediate that since on we have . Therefore
[TABLE]
when .
3.2. High frequency case
Now let be an arbitrary vector with this property
[TABLE]
As before, we let and write for . Since are linearly independent, at least one of the submatrices of the by matrix
[TABLE]
is invertible. Set
[TABLE]
From Eq. 32 we have . We show that there exists such that
[TABLE]
Assume the contrary. Then . Applying with in Eq. 33, we obtain
[TABLE]
From the Cauchy–Schwarz inequality applied to Eq. 32 and Eq. 35 we obtain
[TABLE]
which is a contradiction. We will fix the value of to satisfy Eq. 34 throughout the rest of the argument.
Lemma 3.6**.**
There exist real numbers , where , not all zero such that
[TABLE]
Proof.
Using Lagrange’s interpolation method (or the Vandermonde determinant) we find real numbers , not all zero, such that , where is the Kronecker delta. Hence
[TABLE]
This finishes the proof of the lemma. ∎
Set , where are provided by Lemma 3.6. We claim that for every , there exists such that
[TABLE]
where is defined in Eq. 34. Assume the contrary. Since we obtain
[TABLE]
which is a contradiction since . For each , set
[TABLE]
Since is a polynomial of degree at least and at most , it follows from Lemma 3.3 that can be written as a disjoint union of intervals such that is monotone on each . Applying Lemma 3.2 to we find disjoint intervals such that
[TABLE]
and in each interval the function is monotone and for some fixed depending on . Hence, by applying van der Corput lemma for each , we can find a constant , depending only on the polynomials , such that
[TABLE]
Arguing as in the previous case, we can find a constant , depending only on the polynomials , such that
[TABLE]
when . This finishes the proof of the second case and thus the proof of Theorem 3.1. ∎ By Eq. 19 and Theorem 3.1 we deduce that for some absolute constant . This along with Theorem 2.6 proves Theorem 1.2 when .
Remark 3.7**.**
Note that the proof in the high frequency case uses the condition for . This is the reason that we have imposed the condition . However, if and zero is the only common root of , then we only deal with the low frequency case and can be taken to be .
4. Oscillatory integrals with -adic polynomial phase
We now turn to the proof of Theorem 1.2 when . Throughout this section the -adic norm is denoted by and we let be positive integers. Denote the ring of integers of by and set . From here we have , and we obtain the filtration
[TABLE]
For , denote the sphere of radius by
[TABLE]
Notice that , and so , where denotes the measure of with respect to the normalized Haar measure.
Definition 4.1**.**
Let be a polynomial with and . The essential part of is defined by
[TABLE]
It follows from the ultrametric property of the -adic norm that if and then
[TABLE]
Let be the Tate character defined by Eq. 16.
Lemma 4.2**.**
Let be a polynomial with . Then for any and any integers and with we have
[TABLE]
Similar to the real case, this -adic oscillatory integral can be estimated by a suitable van der Corput lemma for -adic integrals.
Theorem 4.3** (-adic van der Corput Lemma).**
Suppose , where and . Then for all , we have
[TABLE]
Proof.
See [Rogers, Corollary 5]. ∎
Now by exploiting the -adic van der Corput lemma we prove the above lemma.
Proof of Lemma 4.2.
Let be the given polynomial. The inequality is evident if . Hence assume that and let where . We claim that whenever where . To see this, notice that and for any with we have
[TABLE]
which proves the claim since . Set . Therefore
[TABLE]
It thus suffices to find a lower bound for the left hand side of the above inequality. We have
[TABLE]
Notice that . Hence by Theorem 4.3 we obtain
[TABLE]
From Eq. 46 and Eq. 47 we conclude that
[TABLE]
since . This inequality along with Eq. 45 provide the lower bound. ∎
Now we return to the proof of Theorem 1.2. In the course of the proof, we will need the following general fact. Suppose is Borel and . Then
[TABLE]
where . This clearly implies that
[TABLE]
Similar to the real case, let be a family of polynomials in . Define the following symmetric, bounded Borel set
[TABLE]
Let and . Since, by our assumption, are linearly independent, the rank of the coordinate matrix of with respect to the ordered basis given by
[TABLE]
is . Thus by applying the Gauss elimination method, can be reduced to a matrix in the row echelon form of rank with the same last row as . Hence there exists such that
[TABLE]
with .
By applying (48) to the linear transformation , there exists depending only on such that
[TABLE]
So we may and will assume from now on that . We will also assume that and are positive integers with
[TABLE]
in Eq. 49 and so , the closure of . Let be the measure on defined for every Borel subset via
[TABLE]
where
[TABLE]
It is easy to verify that is a symmetric Borel probability measure on and . By a straightforward calculation we obtain
[TABLE]
where . Our aim now is to estimate .
Theorem 4.4**.**
For any integer and arbitrary we have
[TABLE]
Proof of Theorem 4.4.
Lemma 4.2 establishes Eq. 50 when . We prove the theorem by induction on . Let and set
[TABLE]
By the induction hypothesis we can assume that . Assume that , where . Set . Then, similar to the proof of Lemma 4.2, we have
[TABLE]
Set . Thus from Eq. 51 and the induction hypothesis we obtain
[TABLE]
Note that since , as in Lemma 4.2, we apply the -adic van der Corput’s lemma to obtain
[TABLE]
This along with Eq. 52 proves Theorem 4.4. ∎
Now by Eq. 19 and Theorem 4.4 we deduce that for some absolute constant . This along with Theorem 2.6 proves Theorem 1.2 for when .
5. Clique number and affine Bézout theorem
In this section, we will prove Theorem 1.11. Before starting the proof, we will recall the following affine version of Bézout’s theorem. We assume that is an algebraic closed field of characteristic zero.
Theorem 5.1**.**
Let be two one-dimensional irreducible varieties defined by polynomials ,, with (respectively ,, with ). Then either or
[TABLE]
Proof.
Notice that is a finite set and . Hence by [Schmid, Theorem 3.1] we obtain the inequality. For more details see also [Tao, Theorem 5]. ∎
Recall that the Ramsey number is the least integer such that for any edge coloring of the complete graph in red and blue, there exist vertices forming a monochromatic .
Proof of Theorem 1.11.
Let be an irreducible variety of dimension that is not an affine line. Moreover assume that is defined by , where with . Set and . Suppose contains a copy of the complete graph formed with vertices . For , color the edge between and red if , and blue if . In view of , there exists a monochromatic complete graph on vertices. Without loss of generality, we will assume that it is a red with vertices , thus for . Consider the variety . Note that for , we have and . This implies that and have at least intersection points. Hence by Theorem 5.1 we have . If is an arbitrary point on , it follows that contains the points for all integers . Hence contains the Zariski closure of these points, which is a line. Since is irreducible, it follows that is a line, which is contrary to the hypotheses. Therefore . ∎
6. Some remarks on Cayley graphs of curves
In this section, we will investigate the question of coloring for Cayley graphs with respect to curves other than the ones studied above. For simplicity, we will restrict the discussion to the case . Extension to the general case is straightforward. Let be a continuous function. Set
[TABLE]
Remark 6.1**.**
For , and a linear functional , let denote the region defined by . Hence, if , then
[TABLE]
Proposition 6.2**.**
Let be a continuous periodic function with . If , then .
Proof.
Without loss of generality we can assume that the period of the function is . Since then for some there exits such that if then . Assume and pick an integer . Define the following Borel measurable function
[TABLE]
Suppose . Therefore for some . First assume . Then and so and do not form an edge. Hence assume and so
[TABLE]
Moreover we have for some . Let and , where . This implies that . By periodicity, . From here and Eq. 54 we deduce that and can not be an edge. ∎
Note that the graph of a continuous periodic function is also bounded by two hyperplanes. In the rest of section, we will prove Theorem 1.12
Proof of Theorem 1.12.
Let . Then with the color classes and . Let be the given coloring map. Let , and for , define for and for . For every , write with and . Consider the map
[TABLE]
We claim that if then for all we have . Assume the contrary, that is, and that It follows that
[TABLE]
This implies that , which is a contradiction to . Now, consider the region defined by
[TABLE]
We claim that has a finite Borel chromatic number. In fact, for each , set . Suppose are such that . Then there exists such that or . In the former case, we have and in the latter case, we have . From this we conclude that .
It now remains to see that contains the graph of an analytic function which is not bounded between any two parallel lines. Define the piecewise linear echelon-shaped curve by
[TABLE]
Note that does not lie in the region between any two parallel lines. Identify with the complex plane. Let be the -neighborhood of for . It is easy to see that and is a simply connected domain whose boundary viewed as a subset of the Riemann sphere is a Jordan curve containing . Let denote the open unit disk in . Denote by the biholomorphic map provided by the Riemann mapping theorem. Recall that Caratheodory’s extension of Riemann mapping theorem (see e.g. Theorem 5.1.1 in [Krantz]) asserts that if is a bounded simply connected domain in whose boundary is a single Jordan curve, then the Riemann conformal map extends continuously to a continuous one-to-one function . Note that is not bounded, and hence Caratheodory’s theorem is not directly applicable. Since is included in the region and , for all , we have . Setting , it follows that maps to a bounded domain whose boundary is a Jordan curve passing through .
Applying Caratheodory’s theorem, we obtain a continuous map , whose restriction to the boundary is a homeomorphism, and its restriction to is holomorphic. Thus there exists such that . After possibly precomposing with a rotation, we can assume that . Define by . Since , and the image of lies in , the function provides the required real analytic curve. ∎
Remark 6.3**.**
The above construction has the following generalization. Let be an increasing lacunary sequence, that is, for some . In [Katznelson], Katznelson proved that under these hypotheses we have . By applying this theorem, the set in the above proof, can be replaced by any lacunary sequence .
It would be desirable to obtain an adequate description of the sets of Hausdorff dimension at least one for which the Borel chromatic number of is infinite. In particular, it would be interesting to know the answer to the following two questions:
Question 6.4**.**
Suppose is an irreducible Zariski closed subset of which is not contained in an affine hyperplane. Is it true that is infinite? Note that is automatically non-compact.
Question 6.5**.**
Suppose is an irreducible Zariski closed subset of which is not contained in an affine hyperplane. Let tends to and be a union of dilations of . Is it true that is infinite?
7. Algebraic aspects of Cayley graphs
This short section is devoted to the proof of Theorem 1.13. The following result due to Cassels [Cassels] will be needed in the proof.
Theorem 7.1**.**
Let be a finitely generated extension of and be a finite set. Then there exist infinitely many primes for which there exists an embedding such that for all .
Moreover we recall the following theorem of de Bruijn and Erdős [Diestel, Theorem 8.1.3].
Theorem 7.2**.**
Let be a graph and . If every finite subgraph of has chromatic number at most , then so does .
We now are ready to prove Theorem 1.13.
Proof of Theorem 1.13.
Recall that defined by is an algebraic set defined over . For every prime , the algebraic closure of is an algebraic closed field of characteristic zero and transcendental degree over , and hence, by a well-known theorem of Steinitz, is isomorphic to . This yields a ring embedding , implying that
[TABLE]
Note that the embedding is purely algebraic and is far from being continuous or even measurable.
To prove the reverse inequality, by applying Theorem 7.2, it suffices to show that for any finite subgraph of , there exists a prime such that . Assume that denotes the vertex set of . For forming an edge , we have
[TABLE]
For any two distinct vertices there exists a vector such that
[TABLE]
where denotes the standard symmetric bilinear form on . Denote by the set of all entries of for all and for all pairs of vertices . Let be the finitely generated extension of generated by . Note that, viewed as vertices of , the points span a subgraph isomorphic to . We now apply Theorem 7.1 to find a prime and a field embedding , such that . As is a field embedding, we have
[TABLE]
for all and . Moreover since , it follows that . Thus embeds in which finishes the proof of the theorem. ∎
Acknowledgement
We would like to thank Martin Bays, Emmanuel Breuillard, Sam Drury, Dmitry Jakobson and Omid Hatami for several useful discussions. We would like to acknowledge our gratitude to James Wright who drew our attention to [Nagel]. The authors are indebted to the referee for carefully reading the paper and providing many valuable comments that improved the exposition of the paper. During the completion of this work, M.B was supported by University of Münster and University of Cambridge and M.B would like to acknowledge that, this project has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme, FP7/2007-2013 (grant agreement No 617129). During the course of this research, K.M-K is partially supported by the DFG grant DI506/14-1.
References
