Cyclotomic Weight Chambers for Reverse-Complement-Invariant Minimum Decycling Sets

Primarily AI-generated textHuman understanding: no partsmath.CO — Combinatorics

Contributed by Oleksiy Babanskyy ↗

Version 1 / Nov 18, 2026 / CC BY 4.0

Abstract

For DNA order eight, the fixed labelled weights (s(A),s(C),s(G),s(T))=(−ρ,−1,1,ρ)(s(A),s(C),s(G),s(T))=(-\rho,-1,1,\rho) in W\mathcal W, ρ>1\rho>1, with fixed A<C<G<TA<C<G<T ties meet 21 ordinary complete-move components. Their entire union has optimum residual path length 141, including non-RC endpoints. A certified reverse-complement-invariant minimum decycling set of 8230 words instead attains 107 and is optimal in a different component. The atlas classifies W\mathcal W, not all labelled antisymmetric weight maps. Certified 8232-word RC feedback sets attain length 105; the global cardinality problem remains 8230≤τRC(106)≤82328230\le\tau_{\mathrm{RC}}(106)\le8232. A two-family selector determines equality strata, and an exact atlas has 86 walls, 173 strata and 114 terminals. Boolean classical retiming optimizes entire components; prescribed RC mate sums give two paired-move sectors, each costing at most one additional path unit. Beyond a component, conditional stable completion is exactly 2-SAT; bounded coordinates and antisymmetric heights describe endpoint and cardinality problems. Balanced closed-walk loads have an exact signed-real finite-pool closure. A certified exterior passes one such relaxation but requires at least 8235 selections in its stated real-gradient class at bound 106, without a global lower-bound claim. Classical cyclotomic tensor relations and bounded signed-one-hot realization also give an all-order Farey spectrum of rational DNA embedding resonances. A real algebraic ratio is positionally realizable at some even order exactly when it belongs to a cyclotomic field. Complete arithmetic proofs and finite local exclusions are retained in the technical supplement.

Author comments: 56 pages (57 in the original aiXiv 2610.00003 v1 compilation). Mathematical content unchanged; explicit LaTeX counter aliases preserve lemma/proposition reference types across toolchain versions; companion version 3.2.0. The 141 optimum concerns the union of components met by the specified labelled weight family. The 8230-word RC witness attains length 107 and is optimal in its own component; global optimality remains open. Companion and reproduction instructions: https://github.com/aconsciousfractal/FCIG-Cyclotomic-Weight-Chambers-for-RC-Invariant-MDS/tree/752199436a9605798af9dc9117577724002a750a

Provenance statement

AI systems substantially assisted proof exploration, counterexample search, exact-check implementation, drafting and editorial revision under the author's direction, as disclosed in the manuscript. The author reports using OpenAI Codex; a complete historical model/version inventory is not documented. GPT-6.1 Sol was used in the publication review of 1 October 2026 and is not presented as an identified historical author of the proofs. Individual lemmas are not attributed to a particular model. Oleksiy Babanskyy is the human author and is responsible for the claims and attributions. The author declares that no part of the contribution has been checked and understood by a human; computational replays and author-side AI reviews are not represented as human understanding or independent specialist review. The construction fixes the labelled DNA weights (-rho,-1,1,rho), rho>1, and the stated tie rules. The 21-component atlas and union optimum 141 are restricted to that family. A separate reverse-complement-invariant minimum decycling set has 8230 words and length 107, optimal in its ordinary component but not proved globally optimal. Length counts residual arcs in the lower de Bruijn graph, equivalently vertices in the upper residual graph. At lower-graph path bound 106 the global RC cardinality remains between 8230 and 8232. Signed-real finite-pool closure does not guarantee a Boolean endpoint; the 8235 lower bound applies only to its stated real-gradient class. Imported parity, cyclotomic, retiming, 2-SAT and linear-programming tools are attributed. No general asymptotic conjecture, exhaustive priority or biological performance claim is made. The author-side review of 1 October 2026 recorded manifest and package checks, extended exact replay, endpoint and balanced-load checks, and separately implemented verification of the literal M107 witness and the path-length convention. Those finite checks do not replace the general written proofs, establish global optimality, or constitute end-to-end formal verification. This Hexagon deposit retains all mathematical content, labels and bibliography. A preamble-only compatibility adjustment gives shared theorem counters explicit aliases so that the target compiler preserves lemma and proposition cross-reference names. The different toolchain produces 56 pages instead of 57. Package integrity, source differences, reference types, metadata and the target PDF are checked without repeating the complete scientific review. Prior deposit: https://aixiv.online/abs/2610.00003v1 Pinned source, companion and reproduction instructions: https://github.com/aconsciousfractal/FCIG-Cyclotomic-Weight-Chambers-for-RC-Invariant-MDS/tree/752199436a9605798af9dc9117577724002a750a

Tools used

OpenAI
Codex
OpenAI
SolVersion 6.1
Python Software Foundation
Python

References

  1. Aspvall, Bengt; Plass, Michael F.; Tarjan, Robert Endre. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters, vol. 8, no. 3, pp. 121–123. 1979. Erratum: 14(4), 195 (1982). Used for the classical 2-SAT implication-graph criterionDOI
  2. Babanskyy, Oleksiy. A Parity Theorem for Reverse-Complement-Invariant Minimum Decycling Sets in q-ary de Bruijn Graphs. 2026. Release v2.0.0, commit 89a29a90962d02add6690d6411db927c4788371a; https://github.com/aconsciousfractal/FCIG-RC-Invariant-Minimum-Decycling-Setslink
  3. Björner, Anders; Las Vergnas, Michel; Sturmfels, Bernd; White, Neil; Ziegler, Günter M. Oriented Matroids. Cambridge University Press, vol. 46. 1999. https://doi.org/10.1017/CBO9780511586507DOI
  4. Boyd, Stephen; Vandenberghe, Lieven. Convex Optimization. Cambridge University Press. 2004. https://web.stanford.edu/~boyd/cvxbook/link
  5. Champarnaud, Jean-Marc; Hansel, Georges; Perrin, Dominique. Unavoidable Sets of Constant Length. International Journal of Algebra and Computation, vol. 14, no. 2, pp. 241–251. 2004. https://doi.org/10.1142/S0218196704001700DOI
  6. Christie, John; Dykema, Ken; Klep, Igor. Classifying Minimal Vanishing Sums of Roots of Unity. 2020. https://arxiv.org/abs/2008.11268arXiv
  7. Conway, John H.; Jones, A. J. Trigonometric Diophantine Equations. Acta Arithmetica, vol. 30, pp. 229–240. 1976. https://doi.org/10.4064/aa-30-3-229-240DOI
  8. De Carli, Laura; Laporta, Maurizio. Divisibility Criteria and Coefficient Formulas for Cyclotomic Polynomials. Ramanujan Journal, vol. 70, pp. 44. 2026. https://doi.org/10.1007/s11139-026-01421-6DOI
  9. Emiris, Ioannis Z.; Tsigaridas, Elias P. Computations with One and Two Real Algebraic Numbers. 2005. arXiv preprint; https://arxiv.org/abs/cs/0512072arXiv
  10. Kenkre, Sreyash; Pandit, Vinayaka; Purohit, Manish; Saket, Rishi. On the Approximability of Digraph Ordering. 2015. arXiv:1507.00662v1link
Show all 24 referencesShow fewer references
  1. Kiss, Gergely; Łaba, Izabella; Marshall, Caleb; Somlai, Gábor. Lower Bounds for Mask Polynomials with Many Cyclotomic Divisors. Advances in Mathematics, vol. 494, pp. 110932. 2026. https://doi.org/10.1016/j.aim.2026.110932DOI
  2. Koley, Biswajit; Arikatla, Satyanarayana Reddy. Cyclotomic Factors of Borwein Polynomials. Bulletin of the Australian Mathematical Society, vol. 100, no. 1, pp. 41–47. 2019. https://doi.org/10.1017/S0004972719000339DOI
  3. Lahiri, Shuvendu K.; Musuvathi, Madanlal. An Efficient Decision Procedure for UTVPI Constraints. no. MSR-TR-2005-67. 2005. https://www.microsoft.com/en-us/research/publication/an-efficient-decision-procedure-for-utvpi-constraints/link
  4. Lam, T. Y.; Leung, K. H. On Vanishing Sums of Roots of Unity. Journal of Algebra, vol. 224, no. 1, pp. 91–109. 2000. https://doi.org/10.1006/jabr.1999.8089DOI
  5. Leiserson, Charles E.; Saxe, James B. Retiming synchronous circuitry. Algorithmica, vol. 6, pp. 5–35. 1991. https://doi.org/10.1007/BF01759032link
  6. Mann, Henry B. On Linear Relations Between Roots of Unity. Mathematika, vol. 12, no. 2, pp. 107–117. 1965. https://doi.org/10.1112/S0025579300005210DOI
  7. Marçais, Guillaume; DeBlasio, Dan; Kingsford, Carl. Sketching Methods with Small Window Guarantee Using Minimum Decycling Sets. Journal of Computational Biology, vol. 31, no. 7, pp. 597–615. 2024. https://doi.org/10.1089/cmb.2024.0544DOI
  8. Marçais, Guillaume; Elder, Charles S.; Kingsford, Carl. k-nonical Space: Sketching with Reverse Complements. Bioinformatics, vol. 40, no. 11, pp. btae629. 2024. https://doi.org/10.1093/bioinformatics/btae629DOI
  9. Martin, Jeremy; Reiner, Victor. Cyclotomic and simplicial matroids. Israel Journal of Mathematics, vol. 150, pp. 229–240. 2005. https://arxiv.org/abs/math/0402206link
  10. Mykkeltveit, Johannes. A Proof of Golomb's Conjecture for the de Bruijn Graph. Journal of Combinatorial Theory, Series B, vol. 13, no. 1, pp. 40–45. 1972. https://doi.org/10.1016/0095-8956(72)90006-8DOI
  11. Pellow, David; Pu, Lianrong; Ekim, Bariş; Kotlar, Lior; Berger, Bonnie; Shamir, Ron; Orenstein, Yaron. Efficient Minimizer Orders for Large Values of k Using Minimum Decycling Sets. Genome Research, vol. 33, no. 7, pp. 1154–1161. 2023. https://doi.org/10.1101/gr.277644.123DOI
  12. Steinberger, J. P. Minimal Vanishing Sums of Roots of Unity with Large Coefficients. Proceedings of the London Mathematical Society, vol. 97, no. 3, pp. 689–717. 2008. https://doi.org/10.1112/plms/pdn006DOI
  13. Washington, Lawrence C. Introduction to Cyclotomic Fields. Springer, vol. 83. 1997. https://doi.org/10.1007/978-1-4612-1934-7DOI
  14. Zheng, Hongyu; Kingsford, Carl; Marçais, Guillaume. Lower Density Selection Schemes via Small Universal Hitting Sets with Short Remaining Path Length. Journal of Computational Biology, vol. 28, no. 4, pp. 395–409. 2021. https://doi.org/10.1089/cmb.2020.0432DOI

Version history

  1. v1 · 56 pagesSubmitted by Oleksiy Babanskyy56 pages (57 in the original aiXiv 2610.00003 v1 compilation). Mathematical content unchanged; explicit LaTeX counter aliases preserve lemma/proposition reference types across toolchain versions; companion version 3.2.0. The 141 optimum concerns the union of components met by the specified labelled weight family. The 8230-word RC witness attains length 107 and is optimal in its own component; global optimality remains open. Companion and reproduction instructions: https://github.com/aconsciousfractal/FCIG-Cyclotomic-Weight-Chambers-for-RC-Invariant-MDS/tree/752199436a9605798af9dc9117577724002a750aCurrentNov 17, 2026