Solomon's Criterion for Uniform Spreadness

• Uniform spreadness is defined by bounded displacement of Delone sets or strong group generating properties, characterized via spectral and probabilistic criteria.
• The criterion uses eigenvalue comparisons and fixed-point ratios to distinguish uniformly spread structures from irregular cases in tilings and group theory.
• Applications range from aperiodic substitution tilings to finite simple group generation, offering explicit thresholds and robust classification results.

Solomon's Criterion for Uniform Spreadness is a central quantitative framework used to detect when sets or structures generated by substitution and inflation processes exhibit uniform geometric or algebraic regularity analogous to lattices, or display group generation properties governed by probabilistic combinatorics. In contemporary mathematical literature, “uniform spreadness” refers to conditions under which a Delone set in Euclidean space (or a group in the context of finite group theory) admits a bounded displacement to a lattice, or possesses strong generating properties, with Solomon’s criterion providing explicit spectral, probabilistic, or group-theoretic thresholds. This concept has key impact both in the study of aperiodic tilings and in algebraic generation of finite simple groups.

1. Definitions and Preliminaries

The formalism of Solomon's criterion rests on foundational notions of Delone sets and uniform spread. A Delone set $\Lambda \subset \mathbb{R}^d$ is both uniformly discrete and relatively dense: there exist constants $0 < r \leq R < \infty$ so that for every $x \in \Lambda$, $B(x, r) \cap \Lambda = \{x\}$, and for every $y \in \mathbb{R}^d$, $B(y, R) \cap \Lambda \neq \emptyset$. Two Delone sets $\Lambda, \Gamma$ in $\mathbb{R}^d$ are said to be BD-equivalent (bounded displacement) if there is a bijection $\varphi: \Lambda \to \Gamma$ satisfying $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$. A Delone set is uniformly spread if it is BD-equivalent to some lattice in $0 < r \leq R < \infty$0, equivalently to $0 < r \leq R < \infty$1 for some $0 < r \leq R < \infty$2. The Laczkovich theorem characterizes uniformly spread sets with an asymptotic density $0 < r \leq R < \infty$3 as those for which discrepancy $0 < r \leq R < \infty$4 over bounded measurable regions $0 < r \leq R < \infty$5 is at most $0 < r \leq R < \infty$6 for uniform $0 < r \leq R < \infty$7 (Smilansky, 28 Dec 2025).

In group-theoretic contexts, uniform spread is defined for a finite group $0 < r \leq R < \infty$8 as follows. $0 < r \leq R < \infty$9 has spread $x \in \Lambda$0 if for any $x \in \Lambda$1 non-identity elements $x \in \Lambda$2, there exists $x \in \Lambda$3 with $x \in \Lambda$4 for all $x \in \Lambda$5. $x \in \Lambda$6 has uniform spread $x \in \Lambda$7 if $x \in \Lambda$8 can be chosen from a single conjugacy class $x \in \Lambda$9. The uniform spread invariant $B(x, r) \cap \Lambda = \{x\}$0 is the maximal $B(x, r) \cap \Lambda = \{x\}$1 such that $B(x, r) \cap \Lambda = \{x\}$2 has uniform spread $B(x, r) \cap \Lambda = \{x\}$3 (Harper, 2017).

2. Primitive Substitution Tilings and Spectral Matrices

Solomon’s eigenvalue criterion is applied within families of primitive substitution tilings. Consider a finite set of labelled prototiles $B(x, r) \cap \Lambda = \{x\}$4 in $B(x, r) \cap \Lambda = \{x\}$5, each bi-Lipschitz to a closed ball. An inflation-substitution rule $B(x, r) \cap \Lambda = \{x\}$6 with expansion $B(x, r) \cap \Lambda = \{x\}$7 acts by mapping each $B(x, r) \cap \Lambda = \{x\}$8 to finite patches of rescaled tiles in $B(x, r) \cap \Lambda = \{x\}$9. The substitution matrix $y \in \mathbb{R}^d$0 records the number $y \in \mathbb{R}^d$1 of $y \in \mathbb{R}^d$2 appearing in $y \in \mathbb{R}^d$3; primitiveness is ensured if some $y \in \mathbb{R}^d$4 has all entries strictly positive (Smilansky, 28 Dec 2025).

By the Perron–Frobenius theorem, $y \in \mathbb{R}^d$5 admits a unique dominant eigenvalue $y \in \mathbb{R}^d$6, with remaining eigenvalues $y \in \mathbb{R}^d$7 of lesser modulus. Importantly, for each eigenvalue $y \in \mathbb{R}^d$8, the associated total eigenspace is $y \in \mathbb{R}^d$9, with $B(y, R) \cap \Lambda \neq \emptyset$0 denoting the codimension-1 subspace orthogonal to the all-ones vector.

3. Solomon’s Spectral Criterion for Uniform Spreadness

Solomon’s criterion, as formalized by Smilansky, provides a dichotomy in terms of the substitution matrix spectrum. Let $B(y, R) \cap \Lambda \neq \emptyset$1 be a primitive substitution rule in $B(y, R) \cap \Lambda \neq \emptyset$2, and $B(y, R) \cap \Lambda \neq \emptyset$3 a Delone set derived by selecting a control point per tile in a $B(y, R) \cap \Lambda \neq \emptyset$4-tiling. Let $B(y, R) \cap \Lambda \neq \emptyset$5 be minimal such that $B(y, R) \cap \Lambda \neq \emptyset$6. Then (Smilansky, 28 Dec 2025):

• If $B(y, R) \cap \Lambda \neq \emptyset$7, then $B(y, R) \cap \Lambda \neq \emptyset$8 is uniformly spread.
• If $B(y, R) \cap \Lambda \neq \emptyset$9, then $\Lambda, \Gamma$0 is not uniformly spread.
• If $\Lambda, \Gamma$1, both cases may occur.

The proof relies on correlating the error term $\Lambda, \Gamma$2 in counts of control points over regions formed by $\Lambda, \Gamma$3-iteration with the boundary measure $\Lambda, \Gamma$4. By Laczkovich’s discrepancy criterion, error bounded by boundary implies bounded displacement equivalence, giving the spectral threshold (Smilansky, 28 Dec 2025).

4. Application to $\Lambda, \Gamma$5-Kakutani Tilings of the Line

For commensurable $\Lambda, \Gamma$6 with $\Lambda, \Gamma$7 (gcd$\Lambda, \Gamma$8), one constructs a 1-dimensional primitive substitution with expansion $\Lambda, \Gamma$9 on $\mathbb{R}^d$0 prototiles. The substitution matrix $\mathbb{R}^d$1 has characteristic polynomial $\mathbb{R}^d$2, where non-zero spectrum is given by the roots of $\mathbb{R}^d$3. In dimension $\mathbb{R}^d$4, the Solomon criterion specializes: $\mathbb{R}^d$5, and the critical comparison is whether $\mathbb{R}^d$6 for the next eigenvalue with $\mathbb{R}^d$7 (Smilansky, 28 Dec 2025).

Uniform spreadness thus amounts to the strict inclusion of all non-unit eigenvalues of $\mathbb{R}^d$8 in the open unit disk. Leverage of the classification of Pisot–Vijayaraghavan polynomials (Dubickas–Jankauskas 2014) determines that $\mathbb{R}^d$9 precisely for four minimal PV-polynomials

• $\varphi: \Lambda \to \Gamma$0,
• $\varphi: \Lambda \to \Gamma$1,
• $\varphi: \Lambda \to \Gamma$2,
• $\varphi: \Lambda \to \Gamma$3,

plus the trivial $\varphi: \Lambda \to \Gamma$4 case ($\varphi: \Lambda \to \Gamma$5). The permissible ratios are $\varphi: \Lambda \to \Gamma$6 and numerically these correspond to $\varphi: \Lambda \to \Gamma$7, $\varphi: \Lambda \to \Gamma$8, $\varphi: \Lambda \to \Gamma$9, $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$0, and $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$1. For all other $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$2, the criterion fails due to $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$3 (Smilansky, 28 Dec 2025).

5. Probabilistic Solomon Criterion and Group Generation

In finite group theory, Solomon's probabilistic criterion—primarily as refined by Guralnick–Kantor and Burness–Guest—is employed to establish uniform spread properties of almost simple classical groups. Definitionally, given $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$4, let $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$5 be the set of maximal subgroups containing $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$6. For any $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$7, the failure probability is $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$8. Key inequalities relate this to fixed-point ratios on $\sup_{x \in \Lambda} \| x - \varphi(x) \| < \infty$9 coset actions. In applications,

• For each $0 < r \leq R < \infty$00 of prime order: $0 < r \leq R < \infty$01, where $0 < r \leq R < \infty$02.
• If for every $0 < r \leq R < \infty$03-tuple $0 < r \leq R < \infty$04, $0 < r \leq R < \infty$05, then $0 < r \leq R < \infty$06 admits uniform spread $0 < r \leq R < \infty$07 witnessed by $0 < r \leq R < \infty$08.

This framework underlies the establishment of lower bounds for $0 < r \leq R < \infty$09 in families such as $0 < r \leq R < \infty$10 and $0 < r \leq R < \infty$11, with $0 < r \leq R < \infty$12 (except $0 < r \leq R < \infty$13), $0 < r \leq R < \infty$14 for $0 < r \leq R < \infty$15 when $0 < r \leq R < \infty$16 is odd and $0 < r \leq R < \infty$17, and $0 < r \leq R < \infty$18 diverging for large rank or large field except in bounded families (Harper, 2017).

6. Classification Theorems and Exceptional Sets

The ultimate classification result in the context of substitution tilings is as follows. Let $0 < r \leq R < \infty$19 arise from an $0 < r \leq R < \infty$20-Kakutani tiling of $0 < r \leq R < \infty$21; then uniform spreadness obtains if and only if

$0 < r \leq R < \infty$22

(Smilansky, 28 Dec 2025). In finite group generation, Harper’s theorems establish that for almost simple symplectic and orthogonal groups, $0 < r \leq R < \infty$23 is typically unbounded except for specific small or “bad” families, and explicit lower and upper bounds are provided, unifying and strengthening prior work (Harper, 2017).

Context	Solomon's Criterion Formulation	Spectral/Probabilistic Threshold
Delone sets	Prim. subst. matrix eigenvalues	$0 < r \leq R < \infty$24
Group Generation	Failure probabilities via fixed-point ratios	$0 < r \leq R < \infty$25 for $0 < r \leq R < \infty$26-tuples

A plausible implication is that both spectral and probabilistic Solomon criteria serve as sharp demarcators between “exceptional” uniformly spread sets and general cases failing bounded displacement or uniform generation.

7. Open Problems and Extensions

Ongoing research is directed at classifying the full spectrum of substitution tilings and classical groups for which Solomon’s criterion ensures uniform spreadness. Open questions include exact determination of uniform spread invariants $0 < r \leq R < \infty$27 across all classical and exceptional Lie-type families, extension to higher dimensional substitution tilings, and deeper structural understanding of the relationship between spectral gaps, discrepancy bounds, and uniform spread. Harper conjectures that unitary, even-dimensional orthogonal, and exceptional groups will behave analogously to symplectic and odd-orthogonal types with uniform spread diverging in large ranks, up to bounded exceptional cases (Harper, 2017). The spectral/fixed-point thresholds continue to guide the partition between uniformly spread and irregular structures.