Falconer: Distance, Lattice & Algebra Problems
- Falconer is a collection of mathematical challenges and constructions, including the distance problem, lattice sets, and affine-dimension criteria, characterized by precise threshold conditions.
- The distance-set theory explores when the pairwise distances of a set achieve full measure, with key advances using Hausdorff dimension and analytic methods to refine thresholds.
- Lattice sets and the Falconer–Sloan condition highlight innovative strategies in additive combinatorics and self-affine geometry, employing nested constructions and exterior-power nondegeneracy.
Searching arXiv for recent and foundational papers related to “Falconer” across the mathematical contexts represented in the source material. {"9query9 mathematical problem lattice sets Sloan varieties distance problem radial projections9", "9max_results9 9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9, "9sort_by9 "9submittedDate9 "9sort_order9 "9descending9 Searching more specifically for the main paper on Falconer lattice sets and the Erdős similarity problem. {"9query9 OR title:\9"Falconer lattice sets and the Erdos similarity problem\"", "9max_results9 9sort_order9, "9sort_by9 "relevance", "9sort_order9 "9descending9 Searching for Falconer-related work on distance problems, restricted variants, manifolds, multiparameter formulations, and Falconer–Sloan condition. {"9query9 distance problem\" OR all:\"Falconer-Sloan\" OR all:\"Falconer varieties\" ", "9max_results9 9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_order9, "9sort_by9 "9submittedDate9 "9sort_order9 "9descending9 In current mathematical literature, Falconer designates a family of eponymous problems, constructions, and conditions rather than a single theorem. The name is attached most prominently to the Falconer distance problem in geometric measure theory, to lattice constructions built from shrinking neighborhoods of nested rational lattices, to the Falconer–Sloan condition in affine-dimension theory, and, in a distinct algebraic tradition, to Falconer varieties in loop theory (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9&&&, &&&9query9&&&, &&&9sort_by9&&&, &&&9submittedDate9&&&).
9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9. Distance-set theory
The classical Falconer distance problem concerns the distance set
PRESERVED_PLACEHOLDER_9query9^
of a Borel set PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9. In the survey literature, the conjecture is formulated as the statement that PRESERVED_PLACEHOLDER_9max_results9^ should force PRESERVED_PLACEHOLDER_9sort_by9, while the stronger positive-measure formulation asks whether PRESERVED_PLACEHOLDER_9submittedDate9^ under the same hypothesis. Falconer proved that PRESERVED_PLACEHOLDER_9sort_order9^ implies PRESERVED_PLACEHOLDER_9descending9, establishing the first general threshold in the subject (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9&&&).
Subsequent work refined the analytic input through restriction theory, spherical average decay, and Mattila-type criteria. Weighted restriction estimates obtained by polynomial partitioning and refined Strichartz estimates give the threshold
PRESERVED_PLACEHOLDER_9query9^
for positivity of the Euclidean distance set, improving the earlier PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9^ barrier (&&&9descending9&&&). The same survey line records pinned-distance improvements: if
$a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$
then PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9^ implies the existence of PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^ with PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9, where PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9^ (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9&&&).
The same literature emphasizes that the threshold PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9submittedDate9^ remains the central conjectural barrier. At critical dimension, currently known pinned lower bounds are subtler: for PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_order9, if PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9descending9, then
PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9^
and if PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9id:(Iosevich et al., 2 Apr 2026) OR title:\9, then
PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections99^
for pinned distances (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9&&&).
9max_results9. Geometric descendants and variants
The name Falconer now extends far beyond the one-parameter Euclidean distance set. In the multiparameter problem, one decomposes
PRESERVED_PLACEHOLDER_9max_results9query9^
and studies
PRESERVED_PLACEHOLDER_9max_results9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^
A first continuous positive-measure theorem of this type shows that PRESERVED_PLACEHOLDER_9max_results9max_results9^ if
PRESERVED_PLACEHOLDER_9max_results9sort_by9^
when PRESERVED_PLACEHOLDER_9max_results9submittedDate9^ is even, and
PRESERVED_PLACEHOLDER_9max_results9sort_order9^
when PRESERVED_PLACEHOLDER_9max_results9descending9^ is odd; the proof is driven by a new multiparameter radial projection theorem and multiparameter refined decoupling (Du et al., 2021).
Restricted and singular variants interpolate between the classical and pinned problems. For diagonal restricted distance sets
PRESERVED_PLACEHOLDER_9max_results9query9^
nonempty interior is obtained when
PRESERVED_PLACEHOLDER_9max_results9id:(Iosevich et al., 2 Apr 2026) OR title:\9^
and this extends to PRESERVED_PLACEHOLDER_9max_results99^ Riemannian metrics close to the product Euclidean metric through multilinear Fourier integral operator estimates (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9&&&). A singular diagonal-distance variant
PRESERVED_PLACEHOLDER_9sort_by9query9^
satisfies
PRESERVED_PLACEHOLDER_9sort_by9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^
while the pinned set PRESERVED_PLACEHOLDER_9sort_by9max_results9^ contains an interval at the best currently known pinned-Falconer thresholds (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9&&&).
Several later developments exploit special structure. For Cartesian product sets PRESERVED_PLACEHOLDER_9sort_by9sort_by9, a parabolic reduction converts Euclidean pinned distances to a lower-dimensional parabolic-distance problem, yielding improved thresholds in regimes where a two-dimensional slice has dimension PRESERVED_PLACEHOLDER_9sort_by9submittedDate9^ (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9&&&). In projection theory, a Falconer-type radial projection estimate asserts
PRESERVED_PLACEHOLDER_9sort_by9sort_order9^
for planar Borel sets PRESERVED_PLACEHOLDER_9sort_by9descending9^ with PRESERVED_PLACEHOLDER_9sort_by9query9, placing Falconer’s name within a projection-theoretic program closely tied to thin-tube estimates and continuum Beck phenomena (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9&&&).
The eponym also appears in adjacent incidence problems. For dot products, the shell estimate
PRESERVED_PLACEHOLDER_9sort_by9id:(Iosevich et al., 2 Apr 2026) OR title:\9^
is guaranteed by PRESERVED_PLACEHOLDER_9sort_by99, and that threshold is sharp in the energy framework (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9submittedDate9&&&). For PRESERVED_PLACEHOLDER_9submittedDate9query9-simplex configuration sets, lower-bound obstructions include the threshold
PRESERVED_PLACEHOLDER_9submittedDate9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^
for the direct Falconer-type problem and the barrier PRESERVED_PLACEHOLDER_9submittedDate9max_results9^ for certain incidence-theorem approaches (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_order9&&&).
9sort_by9. Arithmetic and discrete analogues
In finite fields, the Falconer distance problem is formulated with the quadratic form
PRESERVED_PLACEHOLDER_9submittedDate9sort_by9^
and distance set
PRESERVED_PLACEHOLDER_9submittedDate9submittedDate9^
A central perspective is that PRESERVED_PLACEHOLDER_9submittedDate9sort_order9^ depends on the difference set PRESERVED_PLACEHOLDER_9submittedDate9descending9; additive energy
PRESERVED_PLACEHOLDER_9submittedDate9query9^
gives the lower bound
PRESERVED_PLACEHOLDER_9submittedDate9id:(Iosevich et al., 2 Apr 2026) OR title:\9^
and Fourier decay hypotheses force PRESERVED_PLACEHOLDER_9submittedDate99^ to occupy a positive proportion of PRESERVED_PLACEHOLDER_9sort_order9query9, from which Falconer-type conclusions follow, especially in dimension PRESERVED_PLACEHOLDER_9sort_order9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^ (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9descending9&&&).
The two-set finite-field problem has an asymmetric refinement. If PRESERVED_PLACEHOLDER_9sort_order9max_results9^ satisfy
PRESERVED_PLACEHOLDER_9sort_order9sort_by9^
then
PRESERVED_PLACEHOLDER_9sort_order9submittedDate9^
with an improved planar alternative
PRESERVED_PLACEHOLDER_9sort_order9sort_order9^
The large set PRESERVED_PLACEHOLDER_9sort_order9descending9^ rather than the geometric mean of PRESERVED_PLACEHOLDER_9sort_order9query9^ and PRESERVED_PLACEHOLDER_9sort_order9id:(Iosevich et al., 2 Apr 2026) OR title:\9^ controls the lower bound, which isolates a genuinely different-size regime of the Erdős–Falconer problem (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9&&&).
The arithmetic expansion of the subject now includes tree configurations, noncommutative matrix analogues, and inverse theorems over rings. In the tree setting, if PRESERVED_PLACEHOLDER_9sort_order99^ and
PRESERVED_PLACEHOLDER_9descending9query9^
then there is a large subset PRESERVED_PLACEHOLDER_9descending9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^ such that each PRESERVED_PLACEHOLDER_9descending9max_results9^ supports PRESERVED_PLACEHOLDER_9descending9sort_by9^ distinct rooted copies of any prescribed PRESERVED_PLACEHOLDER_9descending9submittedDate9-edge tree, extending pinned-distance phenomena to configuration counting (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9id:(Iosevich et al., 2 Apr 2026) OR title:\9&&&). In the matrix setting, for
PRESERVED_PLACEHOLDER_9descending9sort_order9^
the matrix-valued distance set
PRESERVED_PLACEHOLDER_9descending9descending9^
satisfies
PRESERVED_PLACEHOLDER_9descending9query9^
whenever
PRESERVED_PLACEHOLDER_9descending9id:(Iosevich et al., 2 Apr 2026) OR title:\9^
for PRESERVED_PLACEHOLDER_9descending99, PRESERVED_PLACEHOLDER_9query9query9^ (&&&9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections99&&&). Over composite residue rings, an inverse theorem shows that if
PRESERVED_PLACEHOLDER_9query9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^
then a positive proportion of PRESERVED_PLACEHOLDER_9query9max_results9^ lies in a coset of an annihilator submodule on which the squared-distance form is degenerate, producing the first inverse Falconer theorem over PRESERVED_PLACEHOLDER_9query9sort_by9^ for composite moduli (&&&9max_results9query9&&&).
9submittedDate9. Falconer lattice sets
A separate but closely related usage is the Falconer lattice set, built from nested rational lattices
PRESERVED_PLACEHOLDER_9query9submittedDate9^
with shrinking neighborhoods
PRESERVED_PLACEHOLDER_9query9sort_order9^
and limit set
PRESERVED_PLACEHOLDER_9query9descending9^
These are a one-dimensional modification of Falconer’s classical lattice model
PRESERVED_PLACEHOLDER_9query9query9^
for which Falconer showed PRESERVED_PLACEHOLDER_9query9id:(Iosevich et al., 2 Apr 2026) OR title:\9^ (&&&9query9&&&).
The modern use of these sets is not primarily dimensional. The essential structural feature is nested divisibility,
PRESERVED_PLACEHOLDER_9query99^
which forces additive compatibility across scales. Under the hypothesis
PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9query9^
for all sufficiently large PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9, every stage-PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9max_results9^ interval around PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9sort_by9^ contains at least
PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9submittedDate9^
points of PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9sort_order9, producing scale-by-scale branching. The main theorem then constructs an infinite set PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9descending9^ such that
PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9query9^
and Bourgain’s theorem implies that PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\9id:(Iosevich et al., 2 Apr 2026) OR title:\9^ satisfies the conclusion of the Erdős similarity conjecture (&&&9query9&&&).
The same paper proves a sharp structural dichotomy. If
PRESERVED_PLACEHOLDER_9id:(Iosevich et al., 2 Apr 2026) OR title:\99^
eventually, then $a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9query9^ is finite; if
$a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^
eventually, then $a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9max_results9^ is uncountable and contains an infinite sequence $a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9sort_by9^ with
$a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9submittedDate9^
These sets lie outside earlier regimes based on affine copies of slowly decaying sequences: they do not contain affine copies of sequences satisfying $a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9sort_order9, but they do contain rapidly decaying sequences such as $a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9descending9. They may also have very small logarithmic size, with examples satisfying
$a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9query9^
The construction therefore reinterprets Falconer’s lattice model as a source of additive branching rather than merely a dimension-prescribing device (&&&9query9&&&).
9sort_order9. Falconer–Sloan condition and affine-dimension theory
In self-affine and random affine geometry, the Falconer–Sloan condition $a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9id:(Iosevich et al., 2 Apr 2026) OR title:\9^ supplies the nondegeneracy needed to control singular-value pressure. For a family of linear maps $a_d= \begin{cases} \frac d2+\frac14+\frac{1}{8d-4}, & d \text{ even},\[4pt] \frac d2+\frac14+\frac{1}{8d-8}, & d \text{ odd}, \end{cases}$9 and an integer PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9query9, condition PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^ requires that for all nonzero PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9max_results9, some PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9sort_by9^ satisfies
PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9submittedDate9^
For nonintegral PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9sort_order9, one requires simultaneous nondegeneracy on PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9descending9^ and PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9query9. Equivalently, PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9id:(Iosevich et al., 2 Apr 2026) OR title:\9^ says that for every nonzero PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query99, the family PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9^ spans PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^ (&&&9sort_by9&&&).
The significance of the condition is thermodynamic. The singular value function PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9^ is submultiplicative, and the usual self-affine pressure lacks a reverse multiplicative inequality. Falconer–Sloan nondegeneracy restores a form of quasi-multiplicativity sufficient for dimension theory. The paper on random affine code tree fractals shows that small one-step families typically do not satisfy PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9: at least PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9submittedDate9^ maps are needed for PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_order9. Nevertheless, there exists a natural number PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9descending9^ such that for typical systems the family of all iterates up to level PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9query9^ satisfies PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9id:(Iosevich et al., 2 Apr 2026) OR title:\9^ for every PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections99, and the exceptional parameter set is contained in a finite union of codimension-one algebraic varieties (&&&9sort_by9&&&).
Under an ergodic random code-tree model with neck levels and a probabilistic version of PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9query9, the paper proves the almost sure Falconer-type dimension formula. If PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^ is the unique zero of the singular-value pressure, then for PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9max_results9-almost every random realization,
PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9sort_by9^
for Lebesgue-almost every translation parameter PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9submittedDate9. In this setting, “Falconer” refers to the affinity-dimension program initiated by pressure formulas for typical self-affine sets, while “Falconer–Sloan” names the specific exterior-power transversality condition that makes the random theory work (&&&9sort_by9&&&).
9descending9. Falconer varieties in loop theory
A distinct algebraic use of the name arises in loop theory. A Falconer variety is defined as a loop variety that is simultaneously non-trivial, anti-associative, and isotopically PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9sort_order9-closed. The term was introduced in connection with an open problem posed by Falconer in 9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections99query9query9: whether such a variety exists (&&&9submittedDate9&&&).
The solution proceeds through Latin-square combinatorics. For primes
PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9descending9^
the paper constructs a family of diagonally cyclic Latin squares
PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9query9^
with
PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results9id:(Iosevich et al., 2 Apr 2026) OR title:\9^
These squares are row-Hamiltonian and column-Hamiltonian but not symbol-Hamiltonian, giving the first infinite family with this precise Hamiltonian asymmetry (&&&9submittedDate9&&&).
That asymmetry is translated into loop identities. Writing PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9max_results99^ and PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9query9^ for left and right translations, and
PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9^
the associated loop variety PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9max_results9^ is defined by
PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9sort_by9^
For each prime PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9submittedDate9^ with PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9sort_order9, there exists such a Falconer variety PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9descending9, and its smallest non-trivial member is a loop of order PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9query9. The proof shows that PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by9id:(Iosevich et al., 2 Apr 2026) OR title:\9^ is non-trivial, isotopically PRESERVED_PLACEHOLDER_9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections9sort_by99-closed, and anti-associative, thereby resolving the 9all:Falconer mathematical problem lattice sets Sloan varieties distance problem radial projections99query9query9^ existence problem (&&&9submittedDate9&&&).
Taken together, these usages make Falconer an unusually broad mathematical eponym: in one direction it names a central distance-set program and its geometric, arithmetic, and affine descendants; in another it marks an algebraic existence theory for loop varieties. The common feature is not a single method but the persistence of structural thresholds—dimensional, additive, thermodynamic, or isotopic—that govern when a configuration space becomes large, rigid, or universal.
