Patterns in sets of positive density in trees and affine buildings
M. Bj\"orklund, A. Fish, J. Parkinson

TL;DR
This paper extends results on distance patterns from Euclidean spaces to homogeneous trees and affine buildings, and constructs a counterexample in a non-homogeneous tree showing limitations of such patterns.
Contribution
It proves an analogue of Bourgain's result for homogeneous trees and affine buildings, and provides a counterexample in a non-homogeneous tree.
Findings
Homogeneous trees and affine buildings exhibit similar distance pattern properties to Euclidean spaces.
A non-homogeneous tree with positive Hausdorff dimension can have subsets lacking large even distances.
The results highlight differences between homogeneous and non-homogeneous structures in geometric combinatorics.
Abstract
We prove an analogue for homogeneous trees and certain affine buildings of a result of Bourgain on pinned distances in sets of positive density in Euclidean spaces. Furthermore, we construct an example of a non-homogeneous tree with positive Hausdorff dimension, and a subset with positive density thereof, in which not all sufficiently large (even) distances are realised.
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.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Mathematical Dynamics and Fractals
Patterns in sets of positive density in trees and affine buildings
M. Björklund, A. Fish, J. Parkinson
Abstract
We prove an analogue for homogeneous trees and certain affine buildings of a result of Bourgain on pinned distances in sets of positive density in Euclidean spaces. Furthermore, we construct an example of a non-homogeneous tree with positive Hausdorff dimension, and a subset with positive density thereof, in which not all sufficiently large (even) distances are realised.
00footnotetext: Keywords: Density, Ramsey theory on trees and buildings00footnotetext: 2010 Mathematics Subject Classification: 05D10, 05C12, 05C42
Introduction
A celebrated result in geometric Ramsey theory due to Furstenberg, Katznelson and Weiss [8] states that if is a Lebesgue measurable subset of with positive upper density then the set of distances between elements of contains all sufficiently large real numbers. In [6] Bourgain proved a remarkable generalisation of the Furstenberg-Katznelson-Weiss theorem, showing that if the measurable set has positive upper density, and if is the vertex set of an -simplex in , then contains an isometric copy of each sufficiently large dilation of .
Discrete analogues of both the Furstenberg-Katznelson-Weiss and Bourgain theorems have recently been obtained by Magyar [9, 10]. In [9] it is shown that if is a subset of positive upper density in with , then the set contains all large multiples of a fixed integer , and in [10] an analogue of Bourgain’s Theorem is proved. Further configurations in sets of positive density in have recently been studied in the papers [3, 4].
In this paper we investigate the extent to which certain configurations must necessarily be present in subsets of positive upper density in homogeneous trees and affine buildings. In particular we prove analogues of the Furstenberg-Katznelson-Weiss and Bourgain theorems in this “-adic” context.
Let us first discuss the case of trees. Let be the homogeneous tree of degree with vertex set , and let be a fixed choice of root. For and let , where is the graph metric. The (upper) density of a subset is
[TABLE]
Let be the set of distances between elements of . We prove the following analogue of the Furstenberg-Katznelson-Weiss theorem.
Proposition 1**.**
Let with . There exits a constant such that for all with there exist vertices with and .
Thus, in particular, if then contains all sufficiently large even integers. Note that since is bipartite it is obviously possible for and , and so the condition of even distances in the proposition cannot be removed. Note also that we obtain the “bonus” that and are equidistant to in Proposition 1. This fact turns out to help with finding more elaborate configurations in sets of positive density in (see Theorem 1.3 and Corollary 1.6).
The first main theorem of this paper is the following extension of Proposition 1, giving a kind of analogue of Bourgain’s Theorem.
Theorem 2**.**
Let with . For each there exists such that whenever with there exists a subset with for all and .
Our second main theorem is an extension of Theorem 2 to sets of positive density in certain affine buildings (see Theorem 3.3 for a precise statement). These combinatorial/geometric objects play a role for -adic Lie groups analogous to the role that the symmetric space plays for a real Lie group. Homogeneous trees are the simplest types of affine buildings, being associated to the rank group with a local field with residue field (with a prime power).
Our proof techniques, for both the case of trees and buildings, are purely combinatorial, differing significantly from the ergodic theory techniques of [8] and the harmonic analysis techniques of [6, 9, 10]. This is not a matter of taste, but rather due to the very different types of symmetries of the patterns sought after in the two settings. More specifically, the type of patterns investigated in [6, 8, 9, 10] are invariant under the action of the isometry group of the Euclidean space , which is an amenable group. The arguments in [8] make direct use of this fact, while the arguments [6, 9, 10] use it in an indirect way, to ultimately reduce the proofs to establishing vanishing of Bessel functions at infinity, which is classical.
On the other hand, the patterns investigated in this paper are invariant under the isometry group of (or a higher rank affine building), which is typically not an amenable group. In particular, the approach of [8] is not applicable here, since it is not clear why the dynamical system (as described in [8]) attached to the set of positive density in the tree would admit a probability measure invariant under the action of the isometry group of . If it did, then similar arguments to those in [8] could still be made, ultimately reducing the problem to establishing vanishing at infinity of the (positive definite) spherical functions of the tree, which is classical. However, this is a rather degenerate situation, and it is not hard to construct examples of sets with positive density in whose associated dynamical systems for the isometry group of do not admit invariant probability measures. Fortunately, our combinatorial approach bypasses this problem entirely.
We conclude this introduction with an outline of the structure of the paper. In Section 1 we prove Proposition 1 and Theorem 2. In Section 2 we address a related question asked to us by Itai Benjamini. In particular, we show that if is tree of positive Hausdorff dimension, and if is a subset of positive lower density (hence also positive upper density) then the analogue of Proposition 1 may fail. In Section 3 we prove our extension of Theorem 2 for certain affine buildings (see Theorem 3.3), and we also translate our results to give a corollary on sets of positive density in -adic Lie groups (see Corollary 3.12).
We note that Theorem 3.3 (on affine buildings) covers Theorem 2 as the rank case, and Theorem 2 in turn covers Proposition 1 as a special case. Nonetheless we will provide complete proofs of both Proposition 1 and Theorem 2 in this paper. We believe that this redundancy is well justified, as the tree case, and in particular Proposition 1, more clearly illustrates the key combinatorial ideas driving the proof of Theorem 3.3, yet avoids the technical complications encountered in the general case. Moreover, our decision to give a complete exposition of the tree case first makes our results more accessible to readers unacquainted with the theory of affine buildings.
1 Sets of positive density in homogeneous trees
Let be the homogeneous tree with vertex set and degree , and let be a fixed choice of root. For and let , where is the graph metric. We write . The (upper) density of a subset , with respect to , is
[TABLE]
Let . A subset has positive density if . While the numerical value of density depends on the choice of root, the property of positive density is independent of this choice, as shown by the following lemma.
Lemma 1.1**.**
If for some then for all .
Proof.
It suffices to show that whenever . For we have and hence
[TABLE]
Thus Thus for arbitrary we have , where , and hence the result. ∎
Remark 1.2**.**
There exist subsets of positive density with and . For example, if consists of one entire “branch” based at then , and choosing sequences and of vertices with , , , and , we have and . This example illustrates that the constant appearing in Theorem 2 must depend on the set , rather than depending only on .
1.1 Proof of Proposition 1
In this section we give a proof of Proposition 1, illustrating the proof techniques required for Theorem 2 in a simplified setting. If and we write for the “-children” (or -descendants) of . That is,
[TABLE]
Let denote the set of all decendants of . That is,
[TABLE]
For each and the members of partition . Let denote the -algebra generated . We call the members of the atoms of .
Proof of Proposition 1.
The argument proceeds as follows.
Claim 1: Suppose that is such that there exist no vertices with and . Then for each (with ) the proportion of atoms contained in with the property that they intersect nontrivially with is at most .
Proof of Claim 1: Let . We decompose as Let . If there exist distinct such that for , then choosing (for ) we have , and , a contradiction (see Figure 1, where the atoms contained in are drawn as ellipses, and nontrivial intersection of an atom with is denoted by shading). Thus for each there exists at most child with the property that intersects nontrivially with (see the elements and in Figure 1). Hence the claim.
Claim 2: Suppose there are integers such that for each there exist no vertices with and . Then for all we have
[TABLE]
Proof of Claim 2: Let . By Claim 1 (with ), the proportion of atoms of contained in with the property that they intersect nontrivially with is at most . However contains precisely atoms of , and hence there is at most one atom contained in with the property that it intersects nontrivially with . Suppose that is such an atom, illustrated as a dashed ellipse in Figure 2 (for the case ).
Let be such that , as illustrated. Then, again by Claim 1 (this time with ), the proportion of the atoms contained in with the property that they intersect nontrivially with is at most (these atoms are displayed as shaded ellipses in Figure 2). Thus, overall, the proportion of the atoms contained in with the property that they intersect nontrivially with is at most . Iterating this process proves the claim.
The proposition now follows. For if there is an unbounded sequence such that for each there are no vertices with such that then for each and each we have . It follows that , contradicting positive density. ∎
1.2 Proof of Theorem 1.3
The arguments in the previous section are the core to the proof of Theorem 2, however the details become more technical in the general case. We introduce the following notion for the proof. For each let denote the set of strictly monotone increasing sequences of positive integers. Let . Let and let . Then by a -star we mean a set of vertices of with a distinguished vertex (called the centre of ) such that
if then , 2.
for each we have .
In particular, note that a -star has precisely vertices.
We call a -star balanced if is constant for all (that is, for some ). If is balanced, then writing for we have and for all and whenever . This configuration is illustrated below.
Theorem 2 follows immediately from the following theorem.
Theorem 1.3**.**
Let with . For each and each there exists a constant such that contains a balanced -star for all sequences with .
To prove Theorem 1.3 we argue as in Proposition 1, using the following lemmas.
Lemma 1.4**.**
Let , , , and . Let . If contains no balanced -star then for each with the proportion of the atoms of contained in with the property that they intersect in at least vertices is at most .
Proof.
We introduce the following terminology for the proof. A vertex (with ) is said to have “type ” if there are at least two children with the property that contains at least elements for , and is said to have “type ” otherwise. Figure 4 illustrates a type vertex (with , and where elements of are denoted by ).
We make the following observation. Let . If then
[TABLE]
and for each the set is a union of atoms of . In particular, each set , , contains the same number of atoms, and so if has type then the proportion of the atoms of containing at least elements of is at most .
Returning to the argument, let . Let be the set of all sequences such that and for . Suppose that there exists a sequence such that each has type . So there exist vertices such that and . Let and be distinct elements of . For each let denote the unique child of on the geodesic segment joining to . Since has type there is a second vertex in such that . Let be distinct elements of . Then for each and , and so forms a balanced -star, where is the vector with every entry equal to . In particular contains a balanced -star, a contradiction.
Thus every contains at least one vertex of type . Note that if has type then the proportion of atoms of intersecting in at least vertices is at most . Thus by a depth-first scan through the natural forest structure on (with root nodes ) we can partition the set of atoms in in such a way that in each part of the partition the proportion of atoms with the property that they intersect in at least vertices is at most . Thus the proportion of all atoms of with this property is at most , and hence the result. ∎
Lemma 1.5**.**
Let , , and . For let , and suppose that for each . If contains no balanced -stars for each then for all we have
[TABLE]
where .
Proof.
Lemma 1.4 (applied to the case ) implies that the proportion of atoms intersecting in at least vertices is at most . Let be such an atom, and let be the projection of this atom onto (that is, ). Lemma 1.4, this time applied to the case , implies that the proportion of the atoms contained in with the property that they intersect in at least vertices is at most . Hence the proportion of all atoms with the property that they intersect in at least vertices is at most . Iterating this process shows that the proportion of all atoms with the property that they intersect in at least vertices is at most . Each atom in the remaining proportion of atoms contains at most elements of . Since the total number of atoms is we have
[TABLE]
hence the result. ∎
Proof of Theorem 1.3.
Suppose not. Then there exists an integer and a vector such that for all integers there is with such that contains no balanced -star. Let be any integer. Recursively define integers , for and , by setting for all and
[TABLE]
Let . These sequences satisfy the hypothesis of Lemma 1.5, and since we have
[TABLE]
for all sufficiently large , where . Thus for each , contradicting positive density. ∎
1.3 More elaborate configurations
Theorem 1.3 implies that we can find any star configuration in a dense subset of a tree, provided that all of the distances to the centre of the star are large enough. It is natural to try to go further and add edges to the star configuration (hence making a tree ), and asking if we can again find such configurations in a dense subset of . Indeed we can, provided we are just interested in the distances between adjacent vertices of this tree . For a precise statement, we need the following definitions.
Let be a finite rooted tree with vertex set , with [math] being the root. Write for the set of undirected edges of . Let be a weight function. We consider the weight function as a function on by setting where is the unique vertex of with and (that is, is the penultimate vertex on the geodesic from [math] to ). We say that the weight function is well ordered if whenever , and we say that the weight function is bounded below by if
Corollary 1.6**.**
Let be a set of positive density in , and let be a finite rooted tree with vertex set and root [math]. There exists such that for each choice of well ordered weight function on bounded below by there exists a subset such that whenever , and moreover .
Proof.
Let be the vector of all distinct edge weights of , arranged in increasing order. Let denote the vector of multiplicities of the edge weights (that is, if the edge weight appears times in then the entry of corresponding to the entry of is ). It follows from Theorem 1.3 there exists such that whenever is bounded below by there exists a balanced -star. The result follows (see Figure 3). ∎
Example 1.7**.**
The following example illustrates Corollary 1.6.
The weighting is well ordered if . Let be a set of positive density in . By Corollary 1.6, once are sufficiently large, one can find such that
; 2.
, , , , , and .
The distances , , and are unknown.
2 Sets of positive density in trees of bounded degree
In this section let denote the rooted tree with root such that every vertex has precisely children. Thus is the homogeneous tree with one branch pruned off at the root . Let be a subtree containing , and with no leaves. We will assume that the tree has positive Hausdorff dimension. This is equivalent to the statement that the fractal set obtained by -adic expansion along the infinite geodesics based at in has positive Hausdorff dimension (see [2, §1.2]).
Let be the sphere of radius in , centred at . In this section we will adopt the following notion of density: We say that has positive lower density if
[TABLE]
It is clear that if then too.
Theorem 1.3 raises the following natural question (we thank Itai Benjamini for asking us this question). For and let X^{t}=\{x\in X\mid\text{there exists y\in Xd(x,y)=t}\}.
Question**.**
Let be as above. Is it true that if has positive Hausdorff dimension, and if has positive lower density , then there exists a subgroup of such that for sufficiently large we have ? In other words, does there exist and such that if then ?
Note that Theorem 1.3 gives an affirmative answer in the case that . However we will show below that generally the answer to the above question is negative.
Proposition 2.1**.**
There exists a tree of positive Hausdorff dimension, and a subset of positive lower density such that for any there exists such that .
Proof.
For a subset we denote the density of by
[TABLE]
provided the limit exists.
Let be a non-periodic Bohr set of density with . An explicit example is given by , where denotes the fractional part of , and . Then and .
Let be the tree which has branching at each vertex of level for all . The Hausdorff dimension of is (see [2, Example 3.3]). Now choose
[TABLE]
It is clear that , and hence . Moreover, if then . Since is non-periodic and we see that is also a non-periodic Bohr set. Any non-periodic Bohr set satisfies the uniformity property along any infinite arithmetic progression: for every and any we have
[TABLE]
completing the proof. ∎
3 Sets of positive density in affine buildings
In this section we extend the results of Section 1 to affine buildings of certain types (note that the tree is an affine building of type ). Sections 3.1, 3.2 and 3.3 recall the required background from the theory of affine buildings, mainly following the setup from [11, 12] (see [1] for a comprehensive reference to building theory). In Section 3.4 we define sets of positive density, and state our main theorem on sets of positive density in affine buildings. Section 3.5 develops the theory of atoms required to give the proof of the main theorem in Section 3.6. The importance of affine buildings stems from their appearance in the theory of -adic Lie groups, where they play an analogous role to the symmetric space for real Lie groups (see [7]; however in dimensions and we note that not all affine buildings are associated to such a group). Thus we conclude in Section 3.7 with an application of our results to sets of positive density in -adic Lie groups.
3.1 Affine Coxeter groups and the Coxeter complex
Recall that a Coxeter system is a group generated by a finite set with relations for all , where for all , and for all (if then it is understood that there is no relation between and ). The length of is
[TABLE]
and an expression with minimal (that is, ) is called a reduced expression for . A Coxeter system is irreducible if cannot be partitioned into nonempty sets and with for all and , spherical if , and affine if there exists a normal abelian subgroup of finite index.
All irreducible affine Coxeter systems arise in the following concrete way. Let be a reduced, irreducible, crystallographic, finite root system in an -dimensional real inner product space (see [5, Chapter VI]). The dual root system is , where . Let be a choice of simple roots of , and let be the associated set of positive roots. The root system has a unique highest root (the height of a root is ).
The Weyl group of is the finite subgroup of generated by the orthogonal reflections in the hyperplanes for . Let for , and let . Then is an irreducible spherical Coxeter system. Let be the longest element of (the unique element of maximal length).
For each and each let (thus the affine hyperplane is a translate of the linear hyperplane ). Let be the affine orthogonal reflection in , given by . The affine Weyl group of is the subgroup of generated by the reflections with and .
Writing (with the highest root) and , the pair is a Coxeter system. Moreover,
[TABLE]
where we identify with the translation given by . Thus is an affine Coxeter system, and all irreducible affine Coxeter systems arise in this way. In the standard Lie theory nomenclature has a “type” , where , and we say that has “type” , and that has dimension .
The fundamental coweights are the dual basis to , given by . The coweight lattice of is
[TABLE]
Note that (because for all by the crystallographic condition). Let . The set of dominant coweights and strongly dominant coweights are, respectively,
[TABLE]
There is a natural partial order on given by if and only if . We write if and only if . Thus if and only if .
The family of hyperplanes , , , tessellates into -dimensional geometric simplices, called chambers (in the literature these are also called alcoves). The fundamental chamber is
[TABLE]
The group acts simply transitively on the set of chambers, and we often identify with the set of chambers via . The extreme points of the chambers are vertices, and each chamber has exactly vertices. The resulting simplicial complex is called the Coxeter complex of the affine Coxeter system.
Each vertex of can be assigned a type as follows. The fundamental chamber has vertices , where and for (with and as above), and we declare for . This extends uniquely to all vertices of by requiring that every chamber has precisely one vertex of each type. The type of a simplex is \tau(\sigma)=\{\tau(x)\mid\text{x\sigma}\}, and the cotype of is . The action of on is type preserving. Both and are subsets of the vertex set of . Specifically, is the set of all type [math] vertices, and is the set of all vertices with . Equivalently, is the set of vertices of whose stabiliser in is isomorphic to .
The root system of type is
[TABLE]
where and . We have and , and the dual root system is . The fundamental coweights are and . The coroot lattice is the set of vertices, and the coweight lattice is the union of the and vertices. The fundamental chamber is darkly shaded, and the cone of dominant coweights is lightly shaded. The points are marked for later reference.
3.2 Affine buildings
Let be an affine Coxeter system of dimension , as constructed in the previous section. Let be an affine building of type . Let us briefly expand on this (see [1]). Thus is a very special kind of simplicial complex, whose maximal simplices are called chambers, and all chambers of have dimension . Moreover, is equipped with a distinguished collection of sub-simplicial complexes, called apartments, satisfying three axioms:
- (B1)
all apartments are isomorphic to the Coxeter complex ; 2. (B2)
if are chambers of , then there exists an apartment containing both of them; 3. (B3)
if are apartments containing a common chamber, then there exists a unique simplicial complex isomorphism fixing every simplex of .
Thus one may regard as being made by “gluing together” many copies of . Axiom (B2) tells us that when determining the relative position between two simplices we can make the measurement in an apartment, and the content of Axiom (B3) is that the measurement we obtain is independent of the particular apartment chosen.
A panel is a codimension simplex of . Chambers of are called adjacent (written ) if is a panel. The figure illustrates the local picture in the case. Here each chamber has vertices, and panels are edges. The chambers shown all share a common panel, and hence are mutually adjacent. We say that has uniform thickness parameter if for all chambers of . The figure illustrates the local picture in the case .
Example 3.1**.**
The root system is in the -dimensional space . The Coxeter complex of the associated affine Coxeter system is a tessellation of by intervals. It is thus clear from the axioms above that buildings are simply trees in which every vertex has valency at least (that is, there are no “leaves”). The chambers are the edges, and the panels are the vertices. In this case the building is easy to draw, however in higher dimension the “thickness” of the building is difficult to visualise, and so our pictures are typically of a piece of an apartment of , with the branching left to the reader’s imagination.
Fix, once and for all, an apartment of , and an isomorphism , and identify with via . Thus we regard as an apartment of (the base apartment). We write (the root of ). The type map on extends uniquely to all vertices of by requiring that every chamber has precisely one vertex of each type.
For each we define an adjacency relation on chambers of by setting if and only if is a panel of cotype (that is, and share all vertices except for their type vertices). Then if and only if for some . The relative position between chambers of is defined by choosing a path
[TABLE]
of minimal length joining to , and setting The building axioms ensure that the value of is independent of the particular choice of minimal path made in (3.1). The numerical distance between and is the length of a minimal length gallery from to . Thus . A sequence of chambers as in (3.1) is called a gallery of type in the building theory vernacular. A basic fact is that a gallery of type joining to has minimal length amongst all galleries joining to if and only if is a reduced expression (that is, ).
Let denote the set of all vertices of . Let , and let
[TABLE]
Then . The elements of are called the special vertices of . For all affine buildings other than those of type the set is a strict subset of .
3.3 Vector distance and spheres
Henceforth we let be an irreducible affine Coxeter system of dimension , and let be an affine building of type with uniform thickness parameter .
Let be special vertices of . The vector distance from to is defined as follows. Choose an apartment containing and (using (B2)), and let be a type preserving simplicial complex isomorphism (using (B1)). Define
[TABLE]
where for we write for the unique element in . This value is independent of the choice of apartment and isomorphism (using (B3); see [11, Proposition 5.6]). Somewhat more informally, to compute one looks at the vector from to (in any apartment containing and ) and takes the dominant representative of this vector under the -action. For example, if lie in an apartment as illustrated in Figure 5 then .
We have ([11, Proposition 5.8])
[TABLE]
where (with the longest element of ). We say that is of -type if acts on by . Thus has -type if and only if for all . By direct examination of root systems, the irreducible -type affine buildings are those of types , (), (), ( even), , , , and . In other words, the affine buildings that are not of -type are those of types (), ( odd), and .
For and the sphere of radius and centre is
[TABLE]
We write . The cardinality does not depend on . In fact, by [12, Proposition 1.5] we have
[TABLE]
where and for finite subsets we write .
Corollary 3.2**.**
Suppose that and that . Then
[TABLE]
Proof.
If then , and the result follows from (3.2). ∎
3.4 Sets of positive density
Recall that is an irreducible affine Coxeter system of dimension , and is an affine building of type with uniform thickness parameter .
The (upper) density of a subset is
[TABLE]
where the limit is taken with each tending to . We note that (3.3) is well defined, because writing and we have that whenever . Writing
[TABLE]
we have and so for all . Since exists (by monotone convergence) we have whenever with each . Moreover, as in the tree case, the property of having positive density is easily seen to be independent of the choice of root vertex (however the numerical value of depends on the choice of root).
Recall that we write if and only if . For each let
[TABLE]
Let and let . Then by a -star we mean a set of special vertices of with a distinguished vertex (called the centre of ) such that
if then , 2.
for each we have .
We call balanced if is constant for all (that is, for some ).
The main theorem of this section is the following analogue of Theorem 1.3.
Theorem 3.3**.**
Suppose that has -type. Let with . For each and each there exists a constant such that contains a balanced -star for all sequences with .
Before proving Theorem 3.3 we define projection maps and atoms in affine buildings (Section 3.5), and prove a series of preliminary results (Section 3.6).
3.5 Projections and atoms
By [12, Corollary B.3], if with , and if , then there is a unique vertex such that . This allows us to define projection maps: If let
[TABLE]
Now, if and then the set of “-children” (or -descendants) of is the set of those that project back to . That is,
[TABLE]
We write for the set of all descendants of .
In the case that and we decompose further, as follows. First we note that if are any special vertices with then there is a unique chamber such that every gallery of minimal length subject to and starts with , as illustrated in Figure 6.
Let , and let denote the set of all chambers of with such that . These are the chambers “opposite” in the “residue” of , and we have . Then, for each define
[TABLE]
This situation is illustrated in Figure 7 for buildings, where and (c.f. Figure 5, and note the convention, like in the tree, of drawing the building falling “downwards” from ). The grey shaded region is determined by and . There are then choices for the chamber in the position shown. Then, for each such , the set contains vertices (to make this count, choose a minimal length path from to position , and at each step there is thickness ; see also Lemma 3.4(2) below). In the -dimensional case of trees (that is, and ), the shaded region is just the geodesic joining vertices and , and the chambers are just the edges incident with and not contained in . Thus in the tree case, where the edge has vertices (see (1.1)).
Lemma 3.4**.**
Let , and write . The members of
[TABLE]
form a partition of the sphere . Moreover we have
, and 2.
, independent of , , and .
Proof.
If and then if and only if . Thus we have a disjoint union . Moreover, if with then (to see this, note that since the three vertices lie in a common apartment, and hence are configured as in Figure 7, and in this figure ). Then if and only if , giving the disjoint union .
Since for all , it is then clear that , and hence (1). To prove (2) we note that if then is equal to the number of hyperplanes of separating the chambers and . Counting these hyperplanes by parallelism classes gives
[TABLE]
where we use the fact that (see [5, §VI.10]). Thus , and hence the result (see Figure 7 for illustration). ∎
Let and write . Let denote the -algebra generated by . The members of the set are called the atoms of .
3.6 Proof of Theorem 3.3
Lemma 3.5**.**
Let , and suppose that satisfy (for ):
, 2.
, 3.
* where .*
Then .
Proof.
We will only sketch the proof. For , the convex hull is intersection of all apartments containing both and . Equivalently, since , the convex hull is the union of all chambers of lying on a minimal length gallery from to . These convex hulls are shaded in Figure 8.
Since the affine geometry of the Coxeter complex (c.f. [1, §11.5]) implies that if is a minimal length gallery joining to , and is a minimal length gallery joining to , and is a minimal length gallery joining to , then the concatenation is a minimal length gallery joining to (see Figure 8). It follows that all chambers shown in Figure 8 lie in the convex hull of and , and hence they lie in a common apartment. It is then clear that . ∎
For , let denote the set of all chambers of with . Note that the maximum numerical distance between chambers is (see Figure 8).
Lemma 3.6**.**
Let . Suppose that with . Then
[TABLE]
Proof.
Without loss of generality we may assume that . Then the fact that implies that is the unique longest element of . In fact is a spherical building of type , and thus the following property holds (see [1, §5.3 and §5.7]): If with , then for each there is a unique chamber with and . For all other chambers with we have .
Let be a reduced expression. Using the above property, there are chambers with and , and all of these chambers satisfy . For each of these chambers there are chambers with and , and all of these chambers satisfy . Continuing in this way we construct distinct galleries
[TABLE]
with for . The end chambers of these galleries are all distinct (this follows, for example, from [11, Proposition 2.1]), and moreover by construction. Hence the result. ∎
We now provide analogues of Lemmas 1.4 and 1.5. Let , as in Lemma 3.6.
Lemma 3.7**.**
Suppose that has -type. Let , , , and . Let . If contains no balanced -star then for each with the proportion of the atoms of contained in with the property that they intersect in at least vertices is at most .
Proof.
We introduce the following terminology for the proof. A vertex (with ) is said to have “type ” if there are distinct chambers , where , with the property that contains at least elements for , and is said to have “type ” otherwise. The key observation is that if has type then there exist distinct vertices with for . To see this, choose . By Lemma 3.6 there is at least one index such that . Then by Lemma 3.5, using the fact that has -type, we have for all , and so any choice of will work.
Let . Let be the set of all sequences such that and for . Suppose that there exists a sequence such that each has type . Thus, as noted above, there are chambers , and vertices and with for all .
For each let be the chamber . Since has type , the argument above shows that there is a chamber in and distinct vertices with for each and , and so forms a balanced -star, where is the vector with every entry equal to . In particular contains a balanced -star, a contradiction.
Thus every contains at least one vertex of type . Note that if has type then the proportion of atoms of intersecting in at least vertices is at most . Thus we can partition the set of atoms in in such a way that in each part of the partition the proportion of atoms with the property that they intersect in at least vertices is at most . Thus the proportion of all atoms of with this property is at most , and hence the result. ∎
Lemma 3.8**.**
Suppose that has -type. Let , , and . For let , and suppose that for each . If contains no balanced -stars for each then for all we have
[TABLE]
where .
Proof.
Lemma 3.7 (applied to the case ) implies that the proportion of atoms intersecting in at least vertices is at most . Let be such an atom, and let be the projection of this atom onto (that is, ). Lemma 3.7, this time applied to the case , implies that the proportion of the atoms contained in with the property that they intersect in at least vertices is at most . Hence the proportion of all atoms with the property that they intersect in at least vertices is at most . Iterating this process shows that the proportion of all atoms with the property that they intersect in at least vertices is at most . Each atom in the remaining proportion of atoms contains at most elements of . Since the total number of atoms is (see Corollary 3.2 and Lemma 3.4) we have
[TABLE]
hence the result. ∎
Proof of Theorem 3.3.
The proof follows from Lemmas 3.7 and 3.8 in exactly the same fashion as the proof of Theorem 1.3. ∎
Remark 3.9**.**
We note the following easy extensions of Theorem 3.3.
We have assumed that our buildings (and trees) have uniform thickness parameter . Our techniques apply more generally to the case of locally finite thick “regular” affine buildings. These buildings have the property that for each the cardinality is independent of , and for all . In the case these buildings are “bi-regular” trees, where the valencies alternate according to the bipartite structure of the tree. 2.
In the definition of in Section 3.4 we used . Less restrictively one could instead use in this definition. Theorem 3.3 still holds using this less restrictive definition, with a very similar proof. However some technical changes are required in Lemmas 3.7 and 3.8, for if with then the chamber from Figure 6 is no longer unique. Instead one must argue using the (unique) “projection” of onto the “residue” of , which in general is a lower dimensional simplex. While this makes the arguments more technical, the essential details are the same.
Remark 3.10**.**
We have not been able to push our techniques through to the case of non--type affine buildings (note that is used in an essential way in Lemma 3.7). Indeed Theorem 3.3 does not hold in its current form for non--type buildings. For example, in a thick building the set has , and we have for all . Thus if then (assuming that ). Thus there are arbitrarily large such that .
In light of Remark 3.10, we make the following conjecture.
Conjecture 3.11**.**
Let be an irreducible affine building with uniform thickness . Let with . For each there exists such that whenever with there exists a subset with for all and .
3.7 Application to -adic Lie groups
We conclude with an application to sets of positive density in -adic Lie groups. Let be a local field with valuation ring and residue field , and let be a Chevalley group with root system . Let . There is an affine building associated to whose set of type [math] vertices is (see [7]). This building has uniform thickness parameter .
There are elements such that
[TABLE]
(roughly speaking, is a diagonal matrix whose entries are powers of the uniformiser ). Moreover, the vector distance between vertices and is if and only if . For let .
We define upper density of a subset as in (3.3).
Corollary 3.12**.**
Let be as above, and suppose that has -type. Let . Let with . There exists a constant such that for all with and we have
[TABLE]
Proof.
Note that if and only if there exit with for all . Thus , and so for all . Since is of -type we have , and so if and only if there exist vertices with for . The result follows from Theorem 3.3. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. Abramenko K. Brown, Buildings: Theory and Applications , Graduate Texts in Mathematics, 248 , Springer, New York, (2008).
- 2[2] C. J. Bishop Y. Peres, Fractal sets in Probability and Analysis , Cambridge Studies in Advanced Mathematics, 162 , Cambridge University Press, 2016.
- 3[3] M. Björklund A. Fish, Characteristic polynomial patterns in difference sets of matrices , Bull. London Math. Soc. 48 , 300–308, 2016.
- 4[4] M. Björklund K. Bulinski, Twisted patterns in large subsets of ℤ n superscript ℤ 𝑛 \mathbb{Z}^{n} , Comment. Math. Helv. 92 , 621–640, 2017.
- 5[5] N. Bourbaki, Lie groups and Lie algebras, Chapters 4–6 , Elements of Mathematics, Springer-Verlag, Berlin, 2002.
- 6[6] J. Bourgain, A Szemerédi type theorem for sets of positive density in ℝ k superscript ℝ 𝑘 \mathbb{R}^{k} , Isr. J. of Math. 54 , 307–316, 1986.
- 7[7] F. Bruhat J. Tits, Groupes réductifs sur un corps local , Publications mathématiques de l’IHES, 41 , 5–251, 1972.
- 8[8] H. Furstenberg, Y. Katznelson B. Weiss, Ergodic theory in sets of positive density . In: J. Nešetřil, V. Rödl (eds) Mathematics of Ramsey Theory. Algorithms and Combinatorics, vol. 5, Springer, Berlin, Heidelberg, 1989.
