Explicit integer presentations for signed cactus critical groups

For a signed cactus with a chosen sink, we give an integer presentation with one coordinate per cycle. Its entries are explicit counts of overlapping root paths, with coefficients determined by the cycle signs. The presentation uses the standard integral Gram reduction and yields all invariant factors by determinantal divisors. For two unbalanced cycles joined by a path, we compute the invariant factors for every sink and every connecting path length. These formulas include an infinite family of cyclic groups whose unsigned counterparts require two generators. We also characterize when a signed reduced Laplacian has the unsigned critical group, and exhibit two cacti with identical marked abstract block-cut data but critical groups of orders 56 and 60. Thus the positions of attachment vertices within each cycle are essential data.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-03
DOI
https://doi.org/10.5281/zenodo.23918368
Primary Topic
Graph theory and applications
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Explicit integer presentations for signed cactus critical groups

Zihuan Xu
Zenodo (CERN European Organization for Nuclear Research)
Graph theory and applications
preprint

Explicit integer presentations for signed cactus critical groups

Zihuan Xu
preprint en

Abstract

For a signed cactus with a chosen sink, we give an integer presentation with one coordinate per cycle. Its entries are explicit counts of overlapping root paths, with coefficients determined by the cycle signs. The presentation uses the standard integral Gram reduction and yields all invariant factors by determinantal divisors. For two unbalanced cycles joined by a path, we compute the invariant factors for every sink and every connecting path length. These formulas include an infinite family of cyclic groups whose unsigned counterparts require two generators. We also characterize when a signed reduced Laplacian has the unsigned critical group, and exhibit two cacti with identical marked abstract block-cut data but critical groups of orders 56 and 60. Thus the positions of attachment vertices within each cycle are essential data.

Zenodo (CERN European Organization for Nuclear Research)
Capital Normal University (CN)
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon