ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A cyclic (n3)(n_3) configuration is a configuration whose Levi graph is a cyclic Haar graph; write H(n,S)H(n,S) for the Haar graph associated with the integer nn and connection set SS. The configuration is unsplittable when it is neither point-splittable nor line-splittable.

Classification conjecture. A cyclic (n3)(n_3) configuration is unsplittable if and only if its Levi graph belongs to one of the following three infinite families:

  1. H(n,{0,1,3})H(n, \{0,1,3\}) for n≥7n\geq 7;
  2. H(3n,{0,1,n})H(3n, \{0,1,n\}) for n≥2n\geq 2;
  3. H(3n,{0,1,n+1})H(3n, \{0,1,n+1\}) for n≥4n\geq 4 where n≢0(mod3)n\not\equiv 0\pmod 3.

The conjecture is motivated by the known results on splittability of cyclic Haar graphs and by experimental evidence, but the classification of all remaining cyclic (n3)(n_3) configurations is left open.

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.