Largest cyclic critical group conjecture for arithmetical structures on star and complete graphs
Statement
Let and for . For an arithmetical structure on the star graph or the complete graph , its critical group is a finite abelian group; a cyclic critical group is one isomorphic to for some positive integer . The construction considered has critical group . Largest cyclic critical group conjecture. For , the largest cyclic group that can be realized as a critical group of an arithmetical structure on or on is
The preceding construction realizes this cyclic critical group using the Sylvester-sequence arithmetical structure. The conjecture asserts that no arithmetical structure on either graph realizes a cyclic critical group of larger order for .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.