SearcharxivSearch

arXiv · 1604.06765

On Boolean intervals of finite groups

Abstract

We prove a dual version of {\O}ystein Ore's theorem on distributive intervals in the subgroup lattice of finite groups, having a nonzero dual Euler totient $\hat{\varphi}$. For any Boolean group-complemented interval, we observe that $\hat{\varphi} = \varphi \neq 0$ by the original Ore's theorem. We also discuss some applications in representation theory. We conjecture that $\hat{\varphi}$ is always nonzero for Boolean intervals. In order to investigate it, we prove that for any Boolean group-complemented interval $[H,G]$, the graded coset poset $\hat{P} = \hat{C}(H,G)$ is Cohen-Macaulay and the nontrivial reduced Betti number of the order complex $\Delta(P)$ is $\hat{\varphi}$, so nonzero. We deduce that these results are true beyond the group-complemented case with $|G:H|<32$. One observes that they are also true when $H$ is a Borel subgroup of $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Mamta Balodi, Sebastien Palcoux. 2016-04-22. On Boolean intervals of finite groups. https://doi.org/10.1016/j.jcta.2018.02.004

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