Search arXivSearch

arXiv · 2412.14281

Følner, Banach, and translation density are equal and other new results about density in left amenable semigroups

Abstract

In any semigroup $S$ satisfying the Strong Folner Condition, there are three natural notions of density for a subset $A$ of $S$: Folner density $d(A)$, Banach density $d^*(A)$, and translation density $d_t(A)$. If $S$ is commutative or left cancellative, it is known that these three notions coincide. We shall show that these notions coincide for every semigroup $S$ which satisfies the Strong Folner Condition. Using this fact, we solve a problem that has been open for decades, showing that the set of ultrafilters every member of which has positive Folner density is a two sided ideal of $βS$. We also show that, if $S$ is a left amenable semigroup, then the set of ultrafilters every member of which has positive Banach density is a two sided ideal of $βS$. We investigate the density properties of subsets of $S$ in the case in which the minimal left ideals of the Stone-Čech compactification $βS$ are singletons. This occurs in many familiar examples, including all semilattices and all semigroups which have a right zero. We show that this is equivalent to the statement that $S$ satisfies the Strong Folner Condition and that, for every subset $A$ of $S$, $d(A)\in \{0,1\}$. We also examine the relation between the density properties of two semigroups when one is a quotient of the other. The Folner density of a subset of $S$ is always determined by some Folner net in $S$. We show that an arbitrary Folner net in $S$ determines the density of all of the subsets of $S$. And we prove that, if $S$ and $T$ are left amenable semigroups, then $d^*(A\times B)=d^*(A)d^*(B)$ for every subset $A$ of $S$ and every subset $B$ of $T$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel Glasscock, Neil Hindman, Dona Strauss. 2025-07-22. Følner, Banach, and translation density are equal and other new results about density in left amenable semigroups. https://arxiv.org/abs/2412.14281

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO