The critical groups of Adinkras up to 2-rank of Cayley graphs
Summary: Adinkras are graphical gadgets introduced by physicists to study supersymmetry, which can be thought of as the Cayley graphs for supersymmetry algebras. Improving the result of \textit{K. Iga} et al. [Adv. Appl. Math. 143, Article ID 102450, 45 p. (2023; Zbl 1504.05116)], we determine the critical group of an Adinkra given the \(2\)-rank of the Laplacian of the underlying Cayley graph. As a corollary, we show that the critical group is independent of the signature of the Adinkra. The proof uses the monodromy pairing on these critical groups.
- Adinkras for mathematicians
- Adinkras: graphs of Clifford algebra representations, supersymmetry, and codes
- An application of cubical cohomology to Adinkras and supersymmetry representations
- Chip firing on Dynkin diagrams and McKay quivers
- Chip-firing games, potential theory on graphs, and spanning trees
- Codes and supersymmetry in one dimension
- Critical groups of strongly regular graphs and their generalizations
- Divisors and sandpiles. An introduction to chip-firing
- Eigenvalues and critical groups of Adinkras
- Geometrization of N-extended 1-dimensional supersymmetry algebras. I.
- Geometrization of \(N\)-extended 1-dimensional supersymmetry algebras. II.
- Grothendieck's pairing on component groups of Jacobians.
- Integer invariants of abelian Cayley graphs
- On the critical group of the \(n\)-cube
- Smith normal form in combinatorics
- Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
- The mathematics of chip-firing
- The monodromy pairing and discrete logarithm on the Jacobian of finite graphs
- The Smith and critical groups of Paley graphs
This page was built for publication: The critical groups of Adinkras up to 2-rank of Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6197813)