Cyclotomic Weight Chambers for Reverse-Complement-Invariant Minimum Decycling Sets
Version 1 / Nov 18, 2026 / CC BY 4.0
Abstract
For DNA order eight, the fixed labelled weights in , , with fixed 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 , not all labelled antisymmetric weight maps. Certified 8232-word RC feedback sets attain length 105; the global cardinality problem remains . 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.
Provenance statement
Tools used
- OpenAI
- Codex
- OpenAI
- SolVersion 6.1
- Python Software Foundation
- Python
References
- 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
- 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
- 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
- Boyd, Stephen; Vandenberghe, Lieven. Convex Optimization. Cambridge University Press. 2004. https://web.stanford.edu/~boyd/cvxbook/link
- 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
- Christie, John; Dykema, Ken; Klep, Igor. Classifying Minimal Vanishing Sums of Roots of Unity. 2020. https://arxiv.org/abs/2008.11268arXiv
- 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
- 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
- Emiris, Ioannis Z.; Tsigaridas, Elias P. Computations with One and Two Real Algebraic Numbers. 2005. arXiv preprint; https://arxiv.org/abs/cs/0512072arXiv
- Kenkre, Sreyash; Pandit, Vinayaka; Purohit, Manish; Saket, Rishi. On the Approximability of Digraph Ordering. 2015. arXiv:1507.00662v1link
Show all 24 referencesShow fewer references
- 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
- 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
- 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
- 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
- Leiserson, Charles E.; Saxe, James B. Retiming synchronous circuitry. Algorithmica, vol. 6, pp. 5–35. 1991. https://doi.org/10.1007/BF01759032link
- 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
- 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
- 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
- Martin, Jeremy; Reiner, Victor. Cyclotomic and simplicial matroids. Israel Journal of Mathematics, vol. 150, pp. 229–240. 2005. https://arxiv.org/abs/math/0402206link
- 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
- 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
- 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
- Washington, Lawrence C. Introduction to Cyclotomic Fields. Springer, vol. 83. 1997. https://doi.org/10.1007/978-1-4612-1934-7DOI
- 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
- 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