SearcharxivSearch

arXiv · 2606.05520

Cohomology of Trivial Linear Cycle Sets

Abstract

We provide a complete classification of extensions of a trivial linear cycle set H by an abelian group I, under the assumption that both H and I are finite cyclic p-groups with p odd, or p = 2 and H has at most four elements. This yields an explicit parametrization of all possible extensions, offering a classification that is both comprehensive and computable. We also compute the socle and the center of all the linear cycle sets obtained.

Explore related subjects

Keep this discovery

BibTeXRIS

Jorge Guccione, Juan José Guccione, Christian Valqui. 2026-06-03. Cohomology of Trivial Linear Cycle Sets. https://arxiv.org/abs/2606.05520

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR