SearcharxivSearch

arXiv · 1906.02880

Congruences on Orthogonal Rook Monoids and Symplectic Rook Monoids

Abstract

We give a complete classification of all nonuniform congruences on orthogonal rook monoids and symplectic rook monoids. We find that there are four kinds of nonuniform congruences on the orthogonal rook monoids ${OR}_n$ for even $n\ne 4$, and we describe each kind of the congruences explicitly in terms of normal subgroups of maximal subgroups. We also find that if $n = 4$, there are six kinds of nonuniform congruences on ${OR}_4$, and we describe these congruences using both $\mathcal{H}$-relations and certain normal subgroups of some maximal subgroups. In contrast, we find that there is only one kind of congruences on the symplectic rook monoids for all even $n\ge 2.$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianqiang Feng, Zhenheng Li. 2019-06-07. Congruences on Orthogonal Rook Monoids and Symplectic Rook Monoids. https://arxiv.org/abs/1906.02880

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