Related papers: Finite Groups with a Trivial Chermak-Delgado Subgr…

A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…

If $m$ is a positive integer or infinity, the $m$-layer (or briefly, the layer) of a group $G$ is the subgroup $G_m$ generated by all elements of $G$ of order $m$. This notion goes back to some contributions of Ya.D. Polovickii of almost 60…

The first aim of this work is to characterize when the lattice of all submodules of a module is a direct product of two lattices. In particular, which decompositions of a module $M$ produce these decompositions: the \emph{lattice…

We classify t-structures and thick subcategories in discrete cluster categories $\mathcal{C}(\mathcal{Z})$ of Dynkin type $A$, and show that the set of all t-structures on $\mathcal{C}(\mathcal{Z})$ is a lattice under inclusion of aisles,…

An important and long-standing open problem in universal algebra asks whether every finite lattice is isomorphic to the congruence lattice of a finite algebra. Until this problem is resolved, our understanding of finite algebras is…

The concept of a C-approximable group, for a class of finite groups C, is a common generalization of the concepts of a sofic, weakly sofic, and linear sofic group. Glebsky raised the question whether all groups are approximable by finite…

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

We study certain lattices constructed from finite abelian groups. We show that such a lattice is eutactic, thereby confirming a conjecture by B\"ottcher, Eisenbarth, Fukshansky, Garcia, Maharaj. Our methods also yield simpler proofs of two…

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

We show that, in an Artin-Tits group of spherical type, the intersection of two parabolic subgroups is a parabolic subgroup. Moreover, we show that the set of parabolic subgroups forms a lattice with respect to inclusion. This extends to…

The subgroup lattice of a group is a great source of information about the structure of the group itself. The aim of this paper is to use a similar tool for studying profinite groups. In more detail, we study the lattices of closed or open…

Let $G$ be a non-compact semisimple Lie group with finite centre and finitely many components. We show that any finitely generated group $\Gamma$ which is quasi-isometric to an irreducible lattice in $G$ has the $R_\infty$-property, namely,…

We introduce the notion of the depth of a finite group $G$, defined as the minimal length of an unrefinable chain of subgroups from $G$ to the trivial subgroup. In this paper we investigate the depth of (non-abelian) finite simple groups.…

Let $G$ be a linear semisimple Lie group without compact factors. We show that uniform approximate lattices $\Lambda$ arising as regular model sets in $G$ determine the ambient group $G$ in a strong sense. Specifically, for every…

Let $\Gamma$ be a Zariski-dense subgroup of a reductive group $\mathbf{G}$ defined over a field $F$. Given a finite collection of finite subgroups $H_i$ ($i \in I$) of $\mathbf{G}(F)$ avoiding the center, we establish a criterion to ensure…

We study the intersection lattice of the arrangement $\mathcal{A}^G$ of subspaces fixed by subgroups of a finite linear group $G$. When $G$ is a reflection group, this arrangement is precisely the hyperplane reflection arrangement of $G$.…

We study the class of densely related groups. These are finitely generated (or more generally, compactly generated locally compact) groups satisfying a strong negation of being finitely presented, in the sense that new relations appear at…

An easily computable dimension (or ECD) group code in the group algebra $\mathbb{F}_{q}G$ is an ideal of dimension less than or equal to $p=char(\mathbb{F}_{q})$ that is generated by an idempotent. This paper introduces an easily computable…

We prove a decomposition of definable groups in o-minimal structures generalizing the Jordan-Chevalley decomposition of linear algebraic groups. It follows that any definable linear group G is a semidirect product of its maximal normal…

We show that if G is a finite group then no chain of modular elements in its subgroup lattice L(G) is longer than a chief series. Also, we show that if G is a nonsolvable finite group then every maximal chain in L(G) has length at least two…