Generalized Farey Fractions

• Generalized Farey fractions are extensions of classical Farey sequences that modify the admissible rational set, adjacency rules, or spatial context through new dynamical and geometric constraints.
• They incorporate quotient set generalizations and arithmetic restrictions—such as congruence conditions and k‐free denominators—enhancing analytic distribution and combinatorial structures.
• Multidimensional and group-theoretic extensions recast Farey fractions in homogeneous dynamics and geometric extraction, linking number theory with ergodic theory and fractal geometry.

Searching arXiv for recent and relevant papers on generalized Farey fractions and related extensions. Searching for Farey sequence generalizations via quotient sets, congruence restrictions, thin groups, and multidimensional maps. Generalized Farey fractions are extensions of the classical Farey sequence $F_n$ and its associated maps, graphs, and counting problems in which one changes the admissible rational set, the adjacency relation, the ambient geometry, or the dynamical rule. Recent work studies several distinct extensions: quotient sets of subsets of $F_n$, denominator-restricted subsequences, Farey fractions with $k$-free denominators, Farey subgraphs and continued fractions, generalized Farey sequences for thin groups, multidimensional Farey fractions on simplices and horospheres, and Ford-circle extractions by continuous curves (Wang, 2020, Chahal et al., 30 Jun 2025, Kushwaha et al., 2021, Lutsko, 2019, Marklof, 2010, Elizalde et al., 2023). In all of these settings, the classical invariants—coprimality, mediants, adjacency, equidistribution, and continued-fraction structure—remain central, but they are reorganized by new arithmetic, geometric, or dynamical constraints.

1. Classical structure and the main directions of extension

The classical Farey sequence of order $n$ is

$$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$

ordered increasingly (Wang, 2020). Its basic local structure is governed by the mediant

$\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$

which lies strictly between $\frac{a}{b}$ and $\frac{c}{d}$, and by the adjacency condition for consecutive Farey fractions,

$bc-ad=1$

(Alba et al., 2020). A broader “fraction space” viewpoint treats reduced fractions $p/q$ with $F_n$0, together with $F_n$1 and $F_n$2, as a primary object and extends adjacency to all of this space by

$F_n$3

(Bantchev, 2015).

Within this broader framework, mediants and adjacency are no longer features of one bounded sequence alone. Every positive reduced fraction arises uniquely as the mediant of exactly one pair of adjacent nonnegative fractions, and iterative mediant subdivision of an adjacent-bounded interval generates all fractions in that interval without repetition (Bantchev, 2015). This gives a unifying baseline against which later generalizations modify either the admissible set of fractions, the rule for adjacency, or the ambient space.

Direction	Defining object	Representative source
Subset quotients	$F_n$4 inside $F_n$5	(Wang, 2020)
Arithmetic restrictions	Denominator congruences, $F_n$6-free denominators, truncated ranges	(Korolev, 27 Feb 2025, Chahal et al., 30 Jun 2025, Garcia, 2024)
Graph and continued-fraction variants	Farey subgraphs $F_n$7, well-directed paths, graph-based expansions	(Kushwaha et al., 2021)
Thin-group generalization	Orbit-based generalized Farey sequences for Fuchsian groups	(Lutsko, 2019)
Multidimensional extensions	$F_n$8, projective simplex maps, Farey polyhedra	(Marklof, 2010, Panti, 3 Jun 2025, Karpenkov et al., 2024)
Geometric extraction	Fractions extracted from Ford circles by continuous curves	(Elizalde et al., 2023)

2. Quotient-set generalizations and rigidity inside $F_n$9

One precise generalization replaces the full Farey sequence by a subset $k$0 and studies its quotient set

$k$1

with all fractions taken in reduced form (Wang, 2020). The basic problem is to determine when $k$2 remains inside $k$3, and when it can generate the whole sequence.

The central boundedness theorem states that if $k$4 and $k$5, then $k$6 (Wang, 2020). The same paper proves that this statement is equivalent to Graham’s GCD Conjecture 1. This equivalence is structurally significant: it shows that a quotient-closure condition on rational subsets of $k$7 is tuned exactly to a maximal pairwise-$k$8 phenomenon for finite sets of integers.

The extremal cases are rigid. If $k$9, or if $n$0 and $n$1, then one must have

$n$2

or

$n$3

except for $n$4, where there is an additional set

$n$5

in the second case (Wang, 2020). A common misconception is that many large subsets of $n$6 should behave well under pairwise quotients. The theorem shows the opposite: maximal quotient-stable or quotient-generating subsets are essentially forced into two explicit shapes, with one small exceptional case.

3. Arithmetic restrictions, local statistics, and analytic distribution

A major family of generalized Farey fractions is obtained by imposing arithmetic restrictions on denominators. In one direction, fractions in the classical Farey sequence $n$7 are “colored” by a congruence condition $n$8, and one studies gaps whose endpoints are colored and whose interior contains no other colored fractions (Korolev, 27 Feb 2025). The limit proportion of such gaps with exactly $n$9 intermediate fractions is denoted $$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$0. The BCZ-transform $$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$1 on the Farey triangle $$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$2 organizes the admissible denominator patterns, and the limiting proportions are expressed through areas of polygons $$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$3 (Korolev, 27 Feb 2025).

For $$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$4, explicit formulas include

$$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$5

and for $$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$6,

$$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$7

(Korolev, 27 Feb 2025). For $$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$8, the sequel computes complete explicit formulas for $$F_n=\left\{\frac{a}{b}:0\le a\le b\le n,\ \gcd(a,b)=1\right\},$$9; for $\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$0,

$\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$1

and for fixed $\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$2,

$\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$3

uniformly in $\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$4 (Korolev, 11 Mar 2025). These results generalize gap statistics from the full Farey sequence to denominator residue classes.

A second arithmetic restriction selects Farey fractions with $\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$5-free denominators in an arithmetic progression: $\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$6 (Chahal et al., 30 Jun 2025). This sequence is equidistributed modulo one, has discrepancy

$\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$7

admits explicit $\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$8-level correlation measures, and has a limiting pair correlation function $\frac{a}{b}\oplus\frac{c}{d}=\frac{a+c}{b+d},$9 given by an explicit series (Chahal et al., 30 Jun 2025). Its local statistics are not Poissonian. The same paper proves an analogue of Franel–Landau: GRH holds if and only if, for any $\frac{a}{b}$0,

$\frac{a}{b}$1

(Chahal et al., 30 Jun 2025).

Other arithmetic refinements focus on localized structure within $\frac{a}{b}$2. For fractions with fixed numerator $\frac{a}{b}$3,

$\frac{a}{b}$4

and for the truncated Farey sequence $\frac{a}{b}$5, the rank of $\frac{a}{b}$6 is

$\frac{a}{b}$7

(Garcia, 2024). Partial Franel sums further localize discrepancy: for $\frac{a}{b}$8,

$\frac{a}{b}$9

(Tomas, 2018). Taken together, these works shift Farey theory from a single ordered list to a family of arithmetic subensembles with their own rank formulas, gap laws, and correlation structures.

4. Farey subgraphs, paths, and continued-fraction variants

Another line of generalization is graph-theoretic. For $\frac{c}{d}$0, the Farey subgraph $\frac{c}{d}$1 has vertex set

$\frac{c}{d}$2

with an edge between $\frac{c}{d}$3 and $\frac{c}{d}$4 when $\frac{c}{d}$5 (Kushwaha et al., 2021). The decisive connectivity theorem states that $\frac{c}{d}$6 is connected if and only if $\frac{c}{d}$7 or $\frac{c}{d}$8 is a prime power. When $\frac{c}{d}$9, $bc-ad=1$0 is a tree; for odd prime powers it is connected but not a tree (Kushwaha et al., 2021).

These graphs support a corresponding continued-fraction theory. An $bc-ad=1$1-continued fraction is linked to a well-directed path from $bc-ad=1$2 in $bc-ad=1$3, and finite expansions are in one-to-one correspondence with such paths (Kushwaha et al., 2021). For every real number $bc-ad=1$4 and prime power $bc-ad=1$5, there exists an $bc-ad=1$6-continued fraction expansion of $bc-ad=1$7. Uniqueness holds for $bc-ad=1$8, whereas for other prime powers rational points may have finitely many distinct expansions (Kushwaha et al., 2021). This makes explicit that the classical uniqueness paradigm for continued fractions is not stable under all Farey-type restrictions.

The Farey graph also supports broader combinatorial generalizations. Paths from $bc-ad=1$9 to $p/q$0, equivalently finite Stern–Brocot subtrees, form an operad; the paper on the Farey fractal isolates “coronas,” especially spiked such paths, and proves that

$p/q$1

is a corona (Haran, 2021). More generally, sets defined by fundamentally monotone constraints such as $p/q$2, $p/q$3, or $p/q$4 are accommodated in the same framework (Haran, 2021). A related strand identifies continued fractions, polygon triangulations, and walks in the Farey tessellation, extending Conway–Coxeter and Series to $p/q$5 via polygon dissections and canonical presentations of modular-group elements (Morier-Genoud et al., 2018).

5. Multidimensional, projective, and group-theoretic extensions

In higher dimension, Farey fractions become primitive lattice directions. For $p/q$6,

$p/q$7

and these points may be embedded as $p/q$8 in large horospheres of $p/q$9 (Marklof, 2010). The resulting equidistribution statement depends on arithmetic commensurability: multidimensional Farey fractions become uniformly distributed in $F_n$00 if and only if $F_n$01 is not commensurable with $F_n$02 (Marklof, 2010). This places generalized Farey fractions inside homogeneous dynamics rather than solely inside one-dimensional Diophantine orderings.

A distinct multidimensional extension concerns projective continued-fraction algorithms on the standard simplex

$F_n$03

If $F_n$04 are nonnegative and $F_n$05 split $F_n$06 into two sub-simplices, then, up to the natural action of the symmetric group, there are precisely three simplex-splitting, topologically contractive two-map projective IFSs in every dimension (Panti, 3 Jun 2025). Only one yields a continuous Gauss-type map: the Farey–Mönkemeyer map (Panti, 3 Jun 2025). The classification gives a precise sense in which the classical Farey map has a unique proper multidimensional analogue under these hypotheses.

Generalized Farey sequences also arise from thin Fuchsian groups. If $F_n$07 has a cusp at $F_n$08 and $F_n$09, then

$F_n$10

defines a generalized Farey sequence (Lutsko, 2019). These sequences equidistribute, their gap distribution converges, and in one sparse Ford-configuration example the limiting gap law is given explicitly (Lutsko, 2019). The count satisfies

$F_n$11

and the associated analogue of Gauss measure is ergodic for the generalized Gauss map, yielding Gauss–Kuzmin statistics in this thin-group setting (Lutsko, 2019).

A further geometric generalization is the multidimensional Farey summation algorithm. It produces Farey polyhedra and sails, classifies them by prismatic diagrams, and leads to multidimensional Conway–Coxeter frieze patterns satisfying generalized Ptolemy relations (Karpenkov et al., 2024). Here the classical Farey tessellation is replaced by a tessellation of the positive orthant by Farey simplices, and continued fractions are encoded by higher-dimensional geometric invariants rather than by scalar partial quotients alone (Karpenkov et al., 2024).

6. Ford circles, determinant matrices, and other reformulations

Ford circles provide another general mechanism for producing Farey-type sets. A continuous curve can extract the fractions whose Ford circles it meets, and every ordered sequence that satisfies the Farey sum and has two adjacent fractions can be extracted from Ford circles through continuous curves (Elizalde et al., 2023). For inclined lines of slope $F_n$12, the extracted sequence is

$F_n$13

which replaces the usual denominator bound by the multiplicative constraint $F_n$14 (Elizalde et al., 2023).

The growth of these sets is governed by prime-factor data. If

$F_n$15

then

$F_n$16

where $F_n$17 is the number of distinct prime divisors of $F_n$18, and hence

$F_n$19

(Elizalde et al., 2023). The same paper gives three approximations, including

$F_n$20

showing $F_n$21-type growth (Elizalde et al., 2023). This is a genuine generalization of Farey fractions in which the extraction rule is geometric and the counting law is controlled by the Möbius and prime-omega functions rather than by a sharp denominator cutoff.

Matrix reformulations encode Farey arithmetic globally. For Farey fractions $F_n$22 and $F_n$23, the Farey determinant

$F_n$24

is the numerator of their difference, and the matrix $F_n$25 is skew-symmetric, symmetric about the secondary diagonal, and has rank $F_n$26 for $F_n$27 (Tomas, 2018). Its diagonal bands recover higher Farey indices,

$F_n$28

and it realizes the Hall–Shiu gcd symmetry

$F_n$29

for $F_n$30 (Tomas, 2018). Some higher-order determinant matrices contain lower-order ones as block submatrices, giving a self-similar representation of Farey structure (Tomas, 2018).

The additive-slow-Farey map supplies yet another reinterpretation: it can be used to generate integer partitions of $F_n$31 into two parts with multiplicity, and its multidimensional analogue, the additive-slow-Triangle map, generates partitions into three parts with multiplicity (Baalbaki et al., 2021). A plausible implication is that generalized Farey fractions are not only new sets of rationals; they also function as templates for transferring mediant and subtractive dynamics into combinatorial settings far from the original ordered list of reduced fractions.

Across these developments, generalized Farey fractions form a family of theories rather than a single definition. What persists is the Farey core: primitive lattice data, local unimodularity, mediant-type recursion, and strong rigidity under arithmetic or dynamical constraints. What changes is the ambient category—subsets, congruence classes, graphs, group orbits, simplices, polyhedra, Ford-circle configurations, or partition dynamics—and with it the appropriate notions of spacing, coding, and asymptotic distribution.