A Quiver Analogue of Higman's Conjecture
Lucien Hennecart, Nikolai Perry

TL;DR
This paper introduces a quiver-based generalization of Higman's conjecture on conjugacy class counts in unitriangular groups, proving the conjecture for specific quivers with limited path lengths.
Contribution
It generalizes Higman's conjecture to quivers and proves it for quivers with no paths longer than two, providing explicit formulas.
Findings
Proved invariance of conjugacy class counts under certain quiver operations.
Solved the conjecture for quivers with maximum path length of two.
Provided explicit formulas for these cases.
Abstract
An unresolved conjecture by Graham Higman states that for all the number of conjugacy classes of the group of unitriangular matrices with entries in the finite field is a polynomial in . In this paper we introduce a new quiver generalization of the conjecture. Motivated by this generalization, we prove that certain operations on quivers leave the relevant counts unchanged. Based on these invariance properties, we solve the introduced conjecture for quivers containing no path of length exceeding two, providing explicit formulas.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic structures and combinatorial models · Advanced Combinatorial Mathematics · Quantum Computing Algorithms and Architecture
