Perfect-group square clustering conjecture for Cayley graphs
Perfect-group square clustering conjecture for Cayley graphs
Let be a perfect group and let be a generating set subject to the restrictions required for the square clustering coefficient. Write for that coefficient. Perfect-group square clustering conjecture. Then
This conjecture is motivated by the observation that all perfect groups in the dataset had directed square clustering coefficient zero, suggesting that the statistic detects their strong non-abelian character. The restrictions on and the general validity of the claim are not specified here.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Rashid Barket, Enrico Grimaldi, Yacoub Hendi, Edward Hirst, Adam Onus and Harmeet Singh, “Learning the Graphical Nature of Symmetries”, arXiv:2607.12026 (2026).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.