Recursive Doubling: Dyadic Self-Similarity

• Recursive Doubling is a dyadic construction principle where sizes, orders, or representations double recursively, forming the basis for efficient algorithmic designs.
• In distributed computation, it underpins modified Allreduce methods for asynchronous convergence detection, reducing steps to a logarithmic scale even for non-power-of-two processor counts.
• Its applications span combinatorics, arithmetic, dynamics, and geometric growth, showcasing versatility in structural clarity, optimal performance, and precise recursive classifications.

Recursive doubling appears in the arXiv literature as a family of dyadic constructions rather than a single formal definition. In the papers considered here, it denotes a modified non-blocking Allreduce for asynchronous iterations when the number of processors is not a power of two, recursively generated period-doubling words $D_n$ with $|D_n|=2^n$, a recursive double-size representation for fixed-precision arithmetic, the angle-doubling map $\delta(\theta)=2\theta \pmod 1$, geometric growth operations on grid shapes, a one-step order-doubling construction for Williamson matrices, and a recursive closest-pair algorithm in metrics of bounded doubling dimension (Zou et al., 2019, Banbara et al., 18 Feb 2026, Chabot et al., 2011, Alsedà et al., 27 May 2026, Almalki et al., 2022, Bright, 2018, Maheshwari et al., 2020).

1. Scope of the term

The surveyed literature uses “doubling” for different objects, but each usage has an explicit dyadic mechanism: a word length becomes $2^n$, an order $n$ construction becomes order $2n$, a width $2^k$ object is built from two width-$2^{k-1}$ halves, an angle is mapped to twice itself modulo $1$, a shape duplicates rows or columns, or a reduction algorithm isolates the largest power-of-two processor core. This is a factual commonality across the papers, even though the formal ambient theories differ (Banbara et al., 18 Feb 2026, Bright, 2018, Chabot et al., 2011, Alsedà et al., 27 May 2026, Almalki et al., 2022, Zou et al., 2019).

Domain	Basic object	Doubling mechanism
Distributed iterations	processor set and residual values	recursive doubling on a power-of-two pivot
Combinatorics on words	period-doubling words $D_n$	$|D_n|=2^n$0, $|D_n|=2^n$1, $|D_n|=2^n$2
Arithmetic	fixed-precision integers	$|D_n|=2^n$3-bit value split into two $|D_n|=2^n$4-bit halves
Dynamical systems	angles on $|D_n|=2^n$5	$|D_n|=2^n$6
Geometric growth	connected grid shapes	full, RC, or general doubling operations
Matrix constructions	Williamson sequences	order $|D_n|=2^n$7 data transformed to order $|D_n|=2^n$8 data
Metric algorithms	finite doubling metrics	recursive annulus-based decomposition

A useful distinction follows directly from the papers. In some settings, “recursive doubling” is the actual algorithmic core, as in distributed Allreduce. In others, the precise formal object has a different name—period-doubling words, doubling map, doubling metrics, or doubling construction—and the connection to recursive doubling is structural rather than terminological.

2. Distributed reduction and asynchronous convergence detection

In distributed numerical computation, recursive doubling is used as the core reduction primitive for convergence detection in asynchronous iterations. The iteration model begins from a matrix splitting $|D_n|=2^n$9, giving $\delta(\theta)=2\theta \pmod 1$0 with $\delta(\theta)=2\theta \pmod 1$1 and $\delta(\theta)=2\theta \pmod 1$2, and in processorwise form $\delta(\theta)=2\theta \pmod 1$3. The asynchronous update permits delayed values $\delta(\theta)=2\theta \pmod 1$4, with the standard fairness and freshness conditions that each processor updates infinitely often and the delays eventually become arbitrarily recent. The stopping test is residual-based: $\delta(\theta)=2\theta \pmod 1$5 where $\delta(\theta)=2\theta \pmod 1$6 is a distributed state assembled from local components at possibly different local times (Zou et al., 2019).

The paper “Convergence Detection of Asynchronous Iterations based on Modified Recursive Doubling” adapts standard recursive doubling to the non-power-of-two case. If

$\delta(\theta)=2\theta \pmod 1$7

then $\delta(\theta)=2\theta \pmod 1$8 is the pivot. The algorithm has three phases: a backward shift, standard recursive doubling on the first $\delta(\theta)=2\theta \pmod 1$9 processors, and a forward shift. Extra processors with ranks in $2^n$0 send their values to the first several processors in the power-of-two block; those receivers reduce immediately; the $2^n$1 base processors then perform ordinary recursive doubling; finally the global result is sent back to the extra processors. The synchronous completion cost is exactly

$2^n$2

steps, and if each processor contributes one floating-point residual value, the total exchanged data per cycle is

$2^n$3

This reduction is used in two convergence-detection algorithms. The first is an Allreduce-only method that computes local residuals such as

$2^n$4

but is explicitly inexact because asynchronous delays can make local residual sequences non-monotone. The second combines distributed snapshot collection with Allreduce, so that the residual is evaluated from a consistent solution buffer $2^n$5; this is exact in view of the residual collection. The implementation model is state-based and non-blocking, with MPI generalized requests (MPI_Grequest_start, MPI_Grequest_complete) discussed as interface support. The same paper is explicit about limitations: the approach is suitable for a relatively “close” distributed environment, whereas significant long-distance communication favors a tree-based algorithm, and asynchronous iterations themselves may become communication-heavy in tightly coupled clusters (Zou et al., 2019).

3. Symbolic and dynamical forms of doubling

In combinatorics on words, recursive doubling appears most directly in the family of period-doubling words. A string attractor of a string $2^n$6 is a set $2^n$7 of positions such that every substring of $2^n$8 has an occurrence crossing some position in $2^n$9. For the period-doubling family,

$n$0

and $n$1. The paper “The Smallest String Attractors of Fibonacci and Period-Doubling Words” gives a complete classification of smallest attractors for these words. For $n$2, the set of all smallest attractors is

$n$3

where

$n$4

Hence the smallest attractor size is $n$5, and for $n$6 there are exactly two smallest attractors: $n$7 The same paper contrasts this rigidity with Fibonacci words: both families have smallest attractor size $n$8, but for Fibonacci words the number of distinct smallest attractors is

$n$9

whereas for period-doubling words $2n$0 for $2n$1. The paper states the broader implication explicitly: strings with the same smallest attractor size can have a drastically different number of distinct smallest attractors (Banbara et al., 18 Feb 2026).

The proof theory in the period-doubling case depends on structural synchronization under a $2n$2-uniform morphism. Because $2n$3 and $2n$4, every $2n$5 in $2n$6 occurs at an even position, so $2n$7 cannot occur. The paper derives that any occurrence of a substring $2n$8 with $2n$9 has a unique parity of starting position. This parity rigidity enables desubstitution: if $2^k$0 is a smallest attractor of $2^k$1 with $2^k$2 and $2^k$3, then for $2^k$4 both positions are even and $2^k$5 is a smallest attractor of $2^k$6. In that sense, the attractor classification is not merely recursive in length but recursive in exact attractor placement.

A different symbolic-arithmetic manifestation of doubling is the angle-doubling map on the circle,

$2^k$7

The paper “Mersenne numbers and the doubling map” studies the connection between $2^k$8 and the dynamics of $2^k$9. Its central result is that for $2^{k-1}$0, an odd number

$2^{k-1}$1

divides $2^{k-1}$2 if and only if $2^{k-1}$3 is a fixed point of $2^{k-1}$4. Equivalently,

$2^{k-1}$5

For prime $2^{k-1}$6, this becomes the statement that $2^{k-1}$7 if and only if $2^{k-1}$8 has $2^{k-1}$9-period $1$0. The paper turns this into a divisor-finding method based on periodicity under modular doubling, develops a $1$1-integer doubling map $1$2, and introduces a $1$3-Poincaré integer doubling map $1$4 with “flying times” that compress several doublings into one jump. As an application, it proves that

$1$5

is composite by exhibiting the divisor

$1$6

The paper reports that $1$7 has approximately $1$8 decimal digits and that the CPU time for this case was $1$9 seconds on the authors’ server (Alsedà et al., 27 May 2026).

4. Algebraic and arithmetic doubling constructions

In fixed-precision arithmetic, recursive doubling is realized as recursive operand-size doubling. The RecInt framework restricts widths to powers of two and defines a recursive unsigned integer type RecInt<k> of size $D_n$0 bits. For $D_n$1, a value is represented by two RecInt<k-1> halves, High and Low, with the intended decomposition

$D_n$2

For $D_n$3, the recursion bottoms out in machine arithmetic: on a 32-bit architecture, RecInt\<5> is a uint32, and on a 64-bit architecture, RecInt\<6> is a uint64. The arithmetic is designed to mimic machine-word behavior modulo

$D_n$4

The paper lists classical operations, truncated arithmetic, modular arithmetic, Burnikel–Ziegler recursive Euclidean division with complexity

$D_n$5

and Montgomery reduction aligned with the High/Low split. Because $D_n$6 coincides with the radix boundary, $D_n$7 and division by $D_n$8 amounts to taking the high half in the relevant context; the paper states that REDC therefore requires only 1 truncated multiplication and 1 complete multiplication. It also states that one truncated multiplication of level $D_n$9 requires only 1 complete multiplication and 2 truncated multiplications of level $|D_n|=2^n$00, instead of 4 complete multiplications for a naïve complete multiplication. Benchmarks against GMP 5.0.1 on gcc 4.4.0, Xeon X5482, 3.2GHz were reported as comparable, with better behavior for small fixed precision, and the same recursive representation was synthesized to VHDL with GAUT and simulated on a Virtex 5 for 128-bit, 256-bit, and 512-bit words (Chabot et al., 2011).

A second algebraic use of doubling is Curtis Bright’s construction for Williamson matrices. Williamson matrices are four square, symmetric, circulant $|D_n|=2^n$01-matrices $|D_n|=2^n$02 of order $|D_n|=2^n$03 such that

$|D_n|=2^n$04

Working at the level of first-row sequences, Bright defines three elementary operations: negation, cyclic shift, and interleaving. For odd $|D_n|=2^n$05, if $|D_n|=2^n$06 are Williamson sequences of order $|D_n|=2^n$07, then

$|D_n|=2^n$08

are Williamson sequences of order $|D_n|=2^n$09, where $|D_n|=2^n$10 and $|D_n|=2^n$11 are shifted by $|D_n|=2^n$12. The proof uses the invariances

$|D_n|=2^n$13

together with the explicit periodic autocorrelation formula for interleavings. Even shifts reduce to twice the original Williamson cancellation condition, and odd shifts cancel pairwise because

$|D_n|=2^n$14

The paper is explicit that this is a doubling construction, but not a fully recursive one: unlike the constructions of Sylvester and Baumert–Hall, it cannot be applied repeatedly in general because its hypothesis requires the input order $|D_n|=2^n$15 to be odd, and after one application the new order $|D_n|=2^n$16 is even (Bright, 2018).

5. Geometric and metric manifestations

In geometric growth, doubling is a local growth rule on connected shapes in the two-dimensional square grid. Starting from an initial shape $|D_n|=2^n$17, one or more growth operations are applied in parallel at each time-step, always satisfying $|D_n|=2^n$18. The paper “On Geometric Shape Construction via Growth Operations” studies three such operations: full doubling, RC doubling, and doubling. In full doubling, every node generates a new node in a chosen direction. From a singleton initial shape, a constructor with $|D_n|=2^n$19 horizontal and $|D_n|=2^n$20 vertical full doublings produces a rectangle of size

$|D_n|=2^n$21

For a general initial shape $|D_n|=2^n$22, the effect of $|D_n|=2^n$23 east and $|D_n|=2^n$24 north full doublings is captured by a reconfiguration function $|D_n|=2^n$25, and the paper proves the additivity law

$|D_n|=2^n$26

RC doubling restricts growth to complete rows or complete columns. Its central abstraction is the baseline shape $|D_n|=2^n$27, obtained by collapsing consecutive duplicate rows and columns. The main characterization theorem states that $|D_n|=2^n$28 can generate $|D_n|=2^n$29 through RC doubling if and only if

$|D_n|=2^n$30

and the multiplicities of every row and column in $|D_n|=2^n$31 can only increase: $|D_n|=2^n$32 The same paper proves a linear-time centralized algorithm for this reachability problem and shows that whenever RC construction is possible, there exists a constructor using at most $|D_n|=2^n$33 time-steps, where $|D_n|=2^n$34. For the most general doubling operation, the paper gives two universal constructors from a singleton: one with time

$|D_n|=2^n$35

and another with time

$|D_n|=2^n$36

where $|D_n|=2^n$37 is the minimum number of rectangles in a partition of the target orthogonal shape. It also proves lower bounds: some shapes, including staircase families and exact staircases, cannot be constructed in sub-linear time-steps under the specified variants of doubling (Almalki et al., 2022).

A distinct geometric use of the adjective “doubling” occurs in metric algorithms. The paper “A Simple Randomized $|D_n|=2^n$38-Time Closest-Pair Algorithm in Doubling Metrics” considers a finite metric space $|D_n|=2^n$39 of size $|D_n|=2^n$40 and constant doubling dimension $|D_n|=2^n$41, where a ball of radius $|D_n|=2^n$42 can be covered by at most $|D_n|=2^n$43 balls of radius $|D_n|=2^n$44. The paper gives a randomized recursive algorithm that computes the closest-pair distance in $|D_n|=2^n$45 expected time. The recursive split is based on a sparse annulus separator. For a subset $|D_n|=2^n$46, the algorithm finds a center $|D_n|=2^n$47 and radius $|D_n|=2^n$48, defines

$|D_n|=2^n$49

and recurses on $|D_n|=2^n$50 and $|D_n|=2^n$51. With

$|D_n|=2^n$52

the annulus satisfies $|D_n|=2^n$53, while both recursive subproblems have size at most $|D_n|=2^n$54 for $|D_n|=2^n$55. The correctness proof uses the packing inequality

$|D_n|=2^n$56

for closest-pair distance $|D_n|=2^n$57, from which the annulus width $|D_n|=2^n$58 is obtained. The algorithm thereby gives a recursive divide-and-conquer scheme whose separator exists because of doubling-metric structure rather than Euclidean coordinates (Maheshwari et al., 2020).

6. Limits, distinctions, and comparative interpretation

Several papers are explicit that doubling constructions should not be conflated. In the period-doubling-word setting, the precise object is the family of period-doubling words, and the paper does not use “recursive doubling” as a formal term beyond that context (Banbara et al., 18 Feb 2026). In Bright’s matrix construction, the rule from order $|D_n|=2^n$59 to order $|D_n|=2^n$60 is constructive but not recursively iterable in general because the input order must be odd (Bright, 2018). In geometric growth, allowing arbitrary local doubling does not imply universal sublinear-time construction; staircase families remain $|D_n|=2^n$61 in the relevant models (Almalki et al., 2022). In distributed convergence detection, recursive doubling remains efficient on the power-of-two core, but applicability depends strongly on the communication environment, and tree-based alternatives may be preferable under significant long-distance communication (Zou et al., 2019).

These results also show that “what is being doubled” varies materially. In period-doubling words, doubling is a morphic length law $|D_n|=2^n$62. In the doubling map, it is an orbit law $|D_n|=2^n$63. In RecInt, it is operand size. In Williamson matrices, it is matrix order. In grid growth, it is row, column, or node multiplicity. In doubling metrics, it is not the instance size that doubles, but the covering property that bounds geometry across scales (Alsedà et al., 27 May 2026, Chabot et al., 2011, Bright, 2018, Almalki et al., 2022, Maheshwari et al., 2020).

Taken together, these papers suggest that the most stable encyclopedic meaning of recursive doubling is not a single algorithm but a recurring dyadic self-similarity principle. Its concrete realization may be a communication schedule, a substitution system, a modular orbit, a recursive representation, a geometric growth rule, or a separator theorem. What remains invariant is that one stage is designed so that the next stage is naturally indexed by $|D_n|=2^n$64, $|D_n|=2^n$65, $|D_n|=2^n$66, or an equivalent dyadic refinement, and the analytical consequences—exact classification, logarithmic-time construction, efficient reduction, or divisor detection—follow from that structure.