ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Σ\Sigma be a finite nonempty alphabet of size qq with a fixed-point-free involution a↦aˉa\mapsto\bar a, and let k≥2k\ge2. The directed de Bruijn graph B(q,k)B(q,k) has length-kk words as vertices and one-symbol-shift edges, including loops. Put ρ(a1⋯ak)=aˉk⋯aˉ1\rho(a_1\cdots a_k)=\bar a_k\cdots\bar a_1.

What is the minimum cardinality τRC(q,k)\tau_{\rm RC}(q,k) of a set M⊆ΣkM\subseteq\Sigma^k such that ρ(M)=M\rho(M)=M and deleting MM makes B(q,k)B(q,k) acyclic?

This is the minimum-size symmetric-decycling problem described as open by Marçais, Elder and Kingsford (2024), Section 6. Section 5.1 also identifies the lack of constructions of symmetric ordinary minimum decycling sets. The classical minimum without symmetry is Nq(k)=1k∑d∣kφ(d)qk/dN_q(k)=\frac1k\sum_{d\mid k}\varphi(d)q^{k/d}. This entry reports a parity theorem toward the symmetry-constrained problem.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.