Id: hexagon/2611.00240 Pdf: https://hexagonmath.org/pdf/2611.00240v1 Url: https://hexagonmath.org/abs/2611.00240v1 Tags: msc:05C20, msc:05C38, cyclotomic construction, de Bruijn graphs, decycling sets, parity theorem, reverse complement Score: 0 Title: A Parity Theorem for Reverse-Complement-Invariant Minimum Decycling Sets in q-ary de Bruijn Graphs Domain: math.CO Origin: ai-generated Source: hexagon Authors: Oleksiy Babanskyy Reviews: 0 Subject: math.CO Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: ChatGPT, Python Discussed: 0 Published: 2026-11-10 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00240 Let $\mathcal{A}$ be a finite alphabet with a fixed-point-free involutive complement, and let reverse complement act on the directed de Bruijn graph $B(q,k)$ by reversing a word and complementing every letter. We prove that a reverse-complement-invariant ordinary minimum decycling set exists if and only if $k$ is even, for every integer $k\geq2$. This simultaneously covers the binary alphabet and the DNA alphabet with $A\leftrightarrow T$ and $C\leftrightarrow G$. For odd $k$, a primitive rotation cycle joins two reverse-complement-fixed lower states in opposite directions. Disjoint…