ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an equiangular set have angle α=15\alpha=\frac{1}{5} and base size K=4K=4, and consider a (4,2)(4,2) pillar and its Seidel graph. Finite-family conjecture for (4,2)(4,2) pillars. In the case where α=15\alpha = \frac{1}{5} and base size K=4K=4, there are only a finite number of families of connected graphs SiS_i's such that the connected components of the Seidel graph of any (4,2)(4,2) pillar in an equiangular set is either a graph or a subgraph of a graph in SiS_i. This conjecture concerns the remaining (4,2)(4,2)-pillar case in the Lemmens–Seidel problem; the supplied text gives no proof or disproof.

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.