Search arXivSearch

arXiv · 2012.00108

The combinatorics of normal subgroups in the unipotent upper triangular group

Abstract

Describing the conjugacy classes of the unipotent upper triangular groups $\mathrm{UT}_{n}(\mathbb{F}_{q})$ uniformly (for all or many values of $n$ and $q$) is a nearly impossible task. This paper takes on the related problem of describing the normal subgroups of $\mathrm{UT}_{n}(\mathbb{F}_{q})$. For $q$ a prime, a bijection will be established between these subgroups and pairs of combinatorial objects with labels from $\mathbb{F}_{q}^{\times}$. Each pair comprises a loopless binary matroid and a tight splice, an apparently new kind of combinatorial object which interpolates between nonnesting partitions and shortened polyominoes. For arbitrary $q$, the same approach describes a natural subset of normal subgroups: those which correspond to the ideals of the Lie algebra $\mathfrak{ut}_{n}(\mathbb{F}_{q})$ under an approximation of the exponential map.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lucas Gagnon. 2021-08-14. The combinatorics of normal subgroups in the unipotent upper triangular group. https://arxiv.org/abs/2012.00108

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO