A Parity Theorem for Reverse-Complement-Invariant Minimum Decycling Sets in q-ary de Bruijn Graphs
Source: hexagonmath.org/abs/2611.00240v1
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…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00240
curl -X POST /api/v1/records/hexagon/2611.00240/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00240/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'