Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1904.04979

The lattice Burnside rings

Fumihito Oda·Yugen Takegahara·Tomoyuki Yoshida
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce the concept of lattice Burnside ring for a finite group G associated to a family of nonempty sublattices of a finite G-lattice assigned to subgroups of G. The slice Burnside ring introduced by S. Bouc is isomorphic to a lattice Burnside ring. Any lattice Burnside ring is isomorphic to an abstract Burnside ring. The ring structure of a lattice Burnside ring is explored on the basis of the fundamental theorem of abstract Burnside rings. We study the units and the primitive idempotents of a lattice Burnside ring. There are certain rings called partial lattice Burnside rings. Any partial lattice Burnside ring, which is isomorphic to an abstract Burnside ring, consists of elements of a lattice Burnside ring; it is not necessarily a subring. The section Burnside ring introduced by S. Bouc is isomorphic to a partial lattice Burnside ring.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Fumihito Oda, Yugen Takegahara, Tomoyuki Yoshida. 2019-04-10. The lattice Burnside rings. https://arxiv.org/abs/1904.04979

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗