Search arXivSearch

arXiv · 2502.00598

Strong marker sets and applications

Abstract

We prove the existence of clopen marker sets with some strong regularity property. For each $n\geq 1$ and any integer $d\geq 1$, we show that there are a positive integer $D$ and a clopen marker set $M$ in $F(2^{\mathbb{Z}^n})$ such that (1) for any distinct $x,y\in M$ in the same orbit, $ρ(x,y)\geq d$; (2) for any $1\leq i\leq n$ and any $x\in F(2^{\mathbb{Z}^n})$, there are non-negative integers $a, b\leq D$ such that $a\cdot x\in M$ and $-b\cdot x\in M$. As an application, we obtain a clopen tree section for $F(2^{\mathbb{Z}^n})$. Based on the strong marker sets, we get a quick proof that there exist clopen continuous edge $(2n+1)$-colorings of $F(2^{\mathbb{Z}^n})$. We also consider a similar strong markers theorem for more general generating sets. In dimension 2, this gives another proof of the fact that for any generating set $S\subseteq \mathbb{Z}^2$, there is a continuous proper edge $(2|S|+1)$-coloring of the Schreier graph of $F(2^{\mathbb{Z}^n})$ with generating set $S$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Su Gao, Tianhao Wang. 2025-02-01. Strong marker sets and applications. https://arxiv.org/abs/2502.00598

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

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO