ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a finite connected simple graph, and fix a vertex of GG. The Terwilliger algebra of GG is the matrix algebra generated by the adjacency matrix of GG and the idempotents corresponding to the distance partition with respect to the fixed vertex.

Koolen's conjecture. For almost all finite connected simple graphs, the Terwilliger algebras coincide with the full matrix algebras.

This conjecture concerns when the distance-based algebra associated with a graph is as large as possible. The source gives no resolution or further qualification of the phrase “almost all,” so the conjecture's precise asymptotic interpretation and current status should be checked.

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.