Deferred Cyclotomic Representation (DCR)
- DCR is a framework that reformulates finite q-hypergeometric series by compiling multiplicative structures into sparse cyclotomic factors, enabling exact cancellation.
- It employs a two-stage process—first compiling algebraic exponent data, then projecting to a target field—to effectively decouple representation from evaluation.
- DCR is applied to quantum 6j-symbols and other q-deformed amplitudes, reducing numerical instability and mitigating catastrophic cancellation.
Deferred Cyclotomic Representation (DCR) is a representation-theoretic and computational framework for finite -hypergeometric series in which the multiplicative structure of each summand is compiled once into sparse integer data over irreducible cyclotomic factors, and only afterward evaluated in a chosen target field. In the formulation introduced for finite -hypergeometric series and -deformed amplitudes, DCR separates algebraic structure from evaluation, resolves numerator–denominator cancellations exactly before any projection to floating-point or exact arithmetic, and treats the compiled object as a parameter-independent combinatorial object whose realizations at specific -values are obtained by ring-homomorphic evaluation (Asante, 14 Apr 2026).
1. Definition and conceptual scope
DCR is designed for finite alternating -hypergeometric series whose summands are products and ratios of quantum factorials, with additional monomial prefactors in . Its central claim is that catastrophic cancellation in floating-point arithmetic and expression swell in exact symbolic arithmetic are largely artifacts of representing multiplicative -factorial structure as dense rational functions or polynomials in , rather than intrinsic features of the amplitudes themselves (Asante, 14 Apr 2026).
The deferred aspect consists in splitting computation into two stages. In the compilation stage, the full algebraic structure of the series is converted into sparse cyclotomic exponent data. In the projection stage, that compiled object is evaluated in a target field . The compiled DCR object contains the cyclotomic monomial for the initial summand, the multiplicative update ratios between consecutive summands, and the global geometric prefactor split into perfect-square and square-free parts. The source paper describes this compiled object as parameter-independent: its data depend on the combinatorial parameters of the series, such as summation bounds and affine factorial arguments, rather than on any chosen value of (Asante, 14 Apr 2026).
This formulation is especially aimed at 0-deformed amplitudes arising from quantum recoupling theory. The detailed application in the paper is the quantum 1-symbol, but the framework is presented for finite 2-hypergeometric factorial-ratio sums more generally. A plausible implication is that DCR is best understood not merely as a numerical trick, but as a change of representation in which multiplicative structure is preserved and evaluation is postponed.
2. Cyclotomic exponent basis and exact cancellation
The algebraic basis of DCR is cyclotomic factorization. Using
3
the paper rewrites quantum integers in the convention
4
as
5
and quantum factorials as
6
Thus every factorial ratio in a summand becomes a signed 7-monomial times a product of irreducible cyclotomic factors with integer exponents (Asante, 14 Apr 2026).
A cyclotomic exponent vector is a map
8
equivalently a vector 9, with support size
0
A cyclotomic monomial is then
1
representing
2
Multiplication and division reduce to integer arithmetic on 3: signs multiply, exponents of 4 add or subtract, and cyclotomic exponent vectors add or subtract componentwise. Consequently, numerator–denominator cancellation is performed exactly by integer subtraction of exponent vectors, rather than by polynomial expansion followed by GCD reduction (Asante, 14 Apr 2026).
This exact exponent-level cancellation is the defining algebraic advantage of DCR. For example, the paper gives
5
6
and
7
with all cancellation completed before any evaluation (Asante, 14 Apr 2026).
3. Deferred evaluation, recurrence propagation, and complexity
The evaluation map is a field projection
8
defined by
9
The paper states that this map is multiplicative by construction and extends linearly to sums of monomials. At the series level, this yields the statement that if 0 admits a DCR, then
1
so 2-deformation is implemented by changing the projection, not by changing the underlying combinatorial object (Asante, 14 Apr 2026).
Successive summands are propagated multiplicatively. Instead of recomputing factorial ratios from scratch, the series is updated through local ratios
3
For the quantum 4-symbol, the update ratio is
5
In exponent form this becomes sparse integer propagation of phase exponents and cyclotomic exponent vectors. Radical prefactors are handled by exact square-root decomposition
6
where 7 collects even exponents and 8 is square-free with 9. This avoids adjoining square roots of dense polynomials during compilation (Asante, 14 Apr 2026).
The compilation procedure described in the paper consists of determining the summation bounds, building the geometric prefactor in cyclotomic form, splitting it into 0, constructing the base monomial at the initial summation index, and encoding each update ratio in cyclotomic exponent form. Projection then precomputes 1, iterates the update ratios, accumulates the projected sum, and finally multiplies by the projected root and radical factors (Asante, 14 Apr 2026).
The paper gives explicit asymptotic complexity bounds. If 2, 3 is the largest cyclotomic index, 4 is the number of cyclotomic factors touched per update ratio, and 5 is the maximum sparse support size per factor, then compilation requires
6
integer operations and stores a representation of the same asymptotic size. Evaluation requires
7
where 8 is the cost of one arithmetic operation in the target field. For floating point, 9, so evaluation is effectively 0 up to divisor-function corrections (Asante, 14 Apr 2026).
4. Numerical conditioning, stability, and benchmark behavior
The numerical motivation for DCR is quantified by the condition number
1
where 2. If 3 is large, the number of lost decimal digits is approximately 4. In the symmetric 5 benchmarks reported in the paper, this intrinsic cancellation can be severe: at 6, the maximum term is about 7 while the final value is about 8, implying about 9 digits of precision are needed merely to resolve the signal (Asante, 14 Apr 2026).
DCR does not change the intrinsic 0, but it reduces what the paper calls representation-induced dynamic-range amplification. The forward-error model is written as
1
where 2 is unit roundoff and
3
The paper characterizes DCR as an algebraic preconditioner because it suppresses the representation-dependent term 4 without altering the underlying conditioning of the alternating sum (Asante, 14 Apr 2026).
The quantitative benchmark results reported are substantial. For symmetric 5-symbols at 6,
7
so the reported compression is
8
orders of magnitude. In exact arithmetic, memory usage at 9 is reported as 0 KB for DCR construction, 1 MB for exact projection, and 2 GB for eager CAS exact evaluation. For floating-point latency at 3, the reported figures are 4 ms for DCR build and 5 ms for DCR Float64 projection. At fixed 6, the eager LSE implementation becomes unreliable around 7, even producing wrong signs, whereas DCR projection preserves the correct sign over a wider range and greatly reduces relative error (Asante, 14 Apr 2026).
These results situate DCR as a representation change with numerical consequences. A plausible implication is that its main benefit appears when large algebraic cancellations are known symbolically but are unstable under eager evaluation.
5. Applications, roots of unity, and classical limit
The principal detailed application is the quantum 8-symbol, treated through the Racah-type finite alternating sum with triangle-coefficient prefactors. DCR applies by encoding the triangle coefficients and summand ratios in cyclotomic exponent form, compiling once, and then projecting to a desired target field. The paper also notes that the implementation QRecoupling.jl extends the same framework beyond the 9-symbol to quantum 0-symbols, fusion tensors, braiding 1-matrices, and general finite 2-hypergeometric series, although the detailed mathematics in the paper is centered on the 3-benchmark (Asante, 14 Apr 2026).
One of the strongest structural consequences concerns roots of unity. If
4
then 5 is a primitive 6-th root of unity and
7
Hence for a cyclotomic monomial 8 with exponent vector 9,
0
Similarly, if 1, the projection has a pole. Thus admissibility, vanishing, and singularity at a primitive root of unity are encoded directly in the cyclotomic support. The paper explicitly notes that this is useful for root-of-unity state-sum computations such as Turaev–Viro-type amplitudes (Asante, 14 Apr 2026).
The same representation also contains the classical limit 2. The key identity is
3
Accordingly, cyclotomic exponent data collapse to prime-exponent data for ordinary factorials, and the paper connects this directly to Legendre’s formula
4
In this sense, DCR encodes both the 5-deformed amplitude and its undeformed limit within the same abstract combinatorial object (Asante, 14 Apr 2026).
The paper also remarks that for any cyclotomic monomial
6
which suggests a structural route toward semiclassical analysis, although no full asymptotic theorem is derived there.
6. Antecedents, related cyclotomic representations, and acronymic ambiguity
The 2026 DCR formulation appears within a broader landscape of cyclotomic representation schemes. A particularly close antecedent is Koshkin’s classification of divisibility polynomials, although that paper does not use the phrase “Deferred Cyclotomic Representation.” It classifies polynomials 7 such that
8
shows that normal divisibility polynomials factor as
9
and encodes them by finite saturated sets, order-reversing multiplicity maps, and multiplicity-labeled Hasse diagrams. The decomposition formula
00
turns composition 01 into a combinatorial operation on cyclotomic support. This suggests a DCR-style representation in which cyclotomic support and divisibility-poset structure are stored instead of expanded coefficients (Koshkin, 2022).
Other neighboring constructions are more specialized. Binary cyclotomic polynomials 02 can be represented as words over the ternary alphabet 03, with a compact block decomposition and an optimal 04 generation algorithm, giving a deferred coefficient representation tailored to the binary case (Cafure et al., 2021). Cyclotomic fields and their subfields admit quotient-based matrix representations of the form
05
especially via circulant matrices and 06-07 companion matrices, which separates an ambient structured matrix from the polynomial relation selecting the target field (Reddy et al., 2011). In prime cyclotomic function fields, norm-08 units admit a unique decomposition as a bounded power of a distinguished cyclotomic unit times a quotient of conjugate units,
09
which is a canonical cyclotomic decomposition on a restricted unit group (Nguyen, 2015). In representation theory, cyclotomic Hecke algebras and Hecke–Clifford superalgebras admit seminormal and residue-based constructions organized by Jucys–Murphy spectra, standard Young 10-tableaux, multipartitions, and strict partitions, providing recursive spectral encodings that are compatible with a deferred viewpoint on representation data (Ogievetsky et al., 2010, Shi et al., 12 Jan 2025).
The acronym itself is not unique. In unrelated literatures, DCR denotes “Default Completion Repulsion,” a training-free diffusion guidance method for rare compositional generation (Kang et al., 7 May 2026), and DCR graphs, a declarative process formalism used for smart-contract design (Eshghie et al., 2023). Those usages are terminologically independent of Deferred Cyclotomic Representation.
Within cyclotomic computation proper, DCR therefore denotes a specific 2026 framework for compiling finite 11-hypergeometric amplitudes into sparse exponent data over the basis 12, together with a deferred projection map. Its distinctive features are exact exponent-level cancellation, square-root handling by parity splitting, projection to multiple target fields from a single compiled object, and explicit control of stability through reduction of representation-induced dynamic range (Asante, 14 Apr 2026).
