Related papers: Branch groups with many maximal subgroups
Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…
In this paper one construction of composition formations was introduced. This construction contains formations of quasinilpotent groups, $c$-supersoluble groups, groups defined by ranks of chief factors and some new classes of groups. A…
Two classic results, due to K. Doerk and P. Hall respectively, establish the solvability of those finite groups all of whose maximal subgroups are supersolvable, and the solvability of finite groups in which all maximal subgroups have prime…
We apply Voronoi's algorithm to compute representatives of the conjugacy classes of maximal finite subgroups of the unit group of a maximal order in some simple $\QQ $-algebra. This may be used to show in small cases that non-conjugate…
Necessary and sufficient conditions for finite commutative semihypergroups to be built from abelian groups of the same order are established.
We provide a class of non-contracting groups containing an infinite family of fractal and weakly regular branch groups, and study certain properties including abelianization, just infiniteness, and word problem. We present an example of a…
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which…
The problem of enumeration of conjugacy classes of finite abelian subgroups of the mapping class group $\mathcal{M}_{\sigma}$ of a compact closed surface $X$ of genus $\sigma$ is considered. A complete method of enumeration is achieved for…
We describe and count the maximal subsemigroups of many well-known monoids of transformations and monoids of partitions. More precisely, we find the maximal subsemigroups of the full spectrum of monoids of order- or orientation-preserving…
We use topological methods to study the maximal subgroups of the free idempotent generated semigroup on a biordered set. We use these to give an example of a free idempotent generated semigroup with maximal subgroup isomorphic to the free…
In this paper we survey a new criteria for solvability of finite groups in terms of number of supersolvable (also known as polycyclic) and non-supersolvable subgroups. In particular, we present original examples of supersolvable groups such…
In 1933 B.~H.~Neumann constructed uncountably many subgroups of ${\rm SL}_2(\mathbb Z)$ which act regularly on the primitive elements of $\mathbb Z^2$. As pointed out by Magnus, their images in the modular group ${\rm PSL}_2(\mathbb Z)\cong…
We present a new class of multifractal process on R, constructed using an embedded branching process. The construction makes use of known results on multitype branching random walks, and along the way constructs cascade measures on the…
We study the subgroup structure, Hecke algebras, quasi-regular representations, and asymptotic properties of some fractal groups of branch type. We introduce parabolic subgroups, show that they are weakly maximal, and that the corresponding…
Following the work done by Olshanskii for groups, we describe, for a given semigroup $S$, which functions $l : S \rightarrow \mathbb{N}$ can be realized up to equivalence as length functions $g \mapsto |g|_{H}$ by embedding $S$ into a…
This article extends the works of Gon\c{c}alves, Guaschi, Ocampo [GGO] and Marin [MAR2] on finite subgroups of the quotients of generalized braid groups by the derived subgroup of their pure braid group. We get explicit criteria for…
We construct a finitely presented group with infinitely many non-homeomorphic asymptotic cones. We also show that the existence of cut points in asymptotic cones of finitely presented groups does, in general, depend on the choice of scaling…
Let $d$ be a positive integer. A finite group is called $d$-maximal if it can be generated by precisely $d$ elements, while its proper subgroups have smaller generating sets. For $d\in\{1,2\}$, the $d$-maximal groups have been classified up…
We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…