Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0709.2920

From Littlewood-Richardson sequences to subgroup embeddings and back

Markus Schmidmeier
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $α$, $β$, and $γ$ be partitions describing the isomorphism types of the finite abelian $p$-groups $A$, $B$, and $C$. From theorems by Green and Klein it is well-known that there is a short exact sequence $0\to A\to B\to C\to 0$ of abelian groups if and only if there is a Littlewood-Richardson sequence of type $(α,β,γ)$. Starting from the observation that a sequence of partitions has the LR property if and only if every subsequence of length 2 does, we demonstrate how LR-sequences of length two correspond to embeddings of a $p^2$-bounded subgroup in a finite abelian $p$-group. Using the known classification of all such embeddings we derive short proofs of the theorems by Green and Klein.

Explore related subjects

math.GRmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Markus Schmidmeier. 2007-09-18. From Littlewood-Richardson sequences to subgroup embeddings and back. https://arxiv.org/abs/0709.2920

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

KEEP EXPLORING

Related papers

arXiv2026

Compressed primitivity problem in free groups

For a fixed integer $r\ge 2$, we prove that the \emph{compressed primitivity problem} in the free group $F_r=F(x_1,\dots,x_r)$ is decidable in non-deterministic polynomial time. That is, for a \emph{straight-line program} $\mathcal A$ over $\{x_1,\dots,x_r\}^{\pm1}$ representing an element $g\in F_r$, the problem of deciding whether $g$ is primitive in $F_r$ belongs to $\mathsf{NP}$, with input measured by the size of $\mathcal A$. For $r=2$, we prove that this problem is decidable in deterministic polynomial time. We also show that, in every fixed rank $r\ge 2$, automorphic minimality of the conjugacy class of a compressed word in $F_r$ is decidable in deterministic polynomial time.

math.GR↗
arXiv2026

Property $(T)$ and nonlinearity of mapping class group quotients

We give a general method for proving Kazhdan's property $(T)$ for quotients $G/K_{[c+1]}$, where $G$ is countable, $K$ is a normal subgroup and $K_{[j]}$ denotes its lower central series. The method combines an affine realization of $G/[K,K]$, a contraction argument, and permanence for nilpotent normal subgroups. We apply this method to several classes of groups by means of homological representations. For the Torelli lower-central series quotients $\operatorname{Mod}(Σ_g)/(\mathcal{T}_g)_{[c+1]}$ for $g\ge3$ we show that they have property $(T)$ for every $c\ge1$. We also prove property $(T)$ for $\operatorname{Aut}(F_3)/(\mathrm{IA}_3)_{[c+1]}$ for every $c\ge1$, relating these groups to the tame nilpotent images studied by Lubotzky and Pak. Several other classes of examples are discussed as well. We also prove that the Torelli lower-central series quotients for $c\ge2$ are not residually finite, and thus non-linear.

math.GR↗
arXiv2026

Classes of Subgroups of a finite group with isomorphic quotient groups

In this paper, we study the poset QIso(G) of classes of subgroups of a finite group G having isomorphic quotients. Particularly, we study it for finite abelian groups and for some classes of non-abelian metacyclic groups, namely dihedral groups Dn, the group U2np and affine groups Aff(F) over finite field F. In the case of abelian groups G, we show that there exists a duality from QIso(G) to Iso(G). We show that cyclic groups are the only groups for which QIso(G), up to duality is isomorphic to its subgroup lattice. We also show that cyclic groups are the only nilpotent groups for which QIso(G), up to duality is isomorphic to its lattice of normal subgroups. We characterize finite 2-groups all of whose subgroups are q-self dual with QIso(G) being a chain. We also characterize all p-groups G of order at most p4 whose QIso(G) is a chain.

math.GR↗