{"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","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT","Python"],"discussed":0,"published":"2026-11-10","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}