Results 41 to 50 of about 686,790 (292)
Avoiding maximal parabolic subgroups of S_k [PDF]
We find an explicit expression for the generating function of the number of permutations in S_n avoiding a subgroup of S_k generated by all but one simple transpositions. The generating function turns out to be rational, and its denominator is a rook polynomial for a rectangular board.
Toufik Mansour, Alek Vainshtein
openaire +7 more sources
Some Characterizations for Approximate Biflatness of Semigroup Algebras
In this paper, we study an approximate biflatness of l1S, where S is a Clifford semigroup. Indeed, we show that a Clifford semigroup algebra l1S is approximately biflat if and only if every maximal subgroup of S is amenable, ES is locally finite, and l1S
N. Razi, A. Sahami
doaj +1 more source
Burnside Groups and Groups Acting on Rooted Trees [PDF]
Branch groups stem from one of the most influential problems in group theory: The famous Burnside Problem, which arose in 1902 and asks if a finitely generated torsion group, i.e. in which every element has finite order, can be itself infinite.
Anitha Thillaisundaram
doaj +1 more source
Generating Finite Groups with Maximal Subgroups of Maximal Subgroups
The author develops a theory of \(\gamma\)-triples \((G,M, H)\) where \(G\) is a finite group with proper subgroups \(H< M< G\) such that \(\langle H,g \rangle \cap M= H\) for all \(g\in G\setminus M\). He proves that in this situation the \(M\)-core \(H_M\) of \(H\) is subnormal in \(G\) and \(H/H_M\) is cyclic. If in addition \(H_G= 1\) and \(H_M< H\)
openaire +1 more source
ON A GRAPH RELATED TO THE MAXIMAL SUBGROUPS OF A GROUP [PDF]
AbstractLet G be a finitely generated group. We investigate the graph ΓM(G), whose vertices are the maximal subgroups of G and where two vertices M1 and M2 are joined by an edge whenever M1∩M2≠1. We show that if G is a finite simple group then the graph ΓM(G) is connected and its diameter is 62 at most. We also show that if G is a finite group, then ΓM(
M. HERZOG +2 more
openaire +3 more sources
Maximal subgroups of free idempotent-generated semigroups over the full transformation monoid [PDF]
Let Tn be the full transformation semigroup of all mappings from the set {1, . . . , n} to itself under composition. Let E = E(Tn) denote the set of idempotents of Tn and let e ∈ E be an arbitrary idempotent satisfying |im (e)| = r ≤ n − 2. We prove that
Ruskuc, N. +4 more
core +1 more source
Words for maximal Subgroups of Fi24‘
Group Theory is the mathematical application of symmetry to an object to obtain knowledge of its physical properties. The symmetry of a molecule provides us with the various information, such as - orbitals energy levels, orbitals symmetries, type of ...
Yasin Faisal +2 more
doaj +1 more source
The maximal subgroups of the Monster
The classification of the maximal subgroups of the Monster $\mathbf{M}$ is a long-standing problem in finite group theory. According to the literature, the classification is complete apart from the question of whether $\mathbf{M}$ contains maximal subgroups that are almost simple with socle $\mathrm{PSL}_2(13)$.
Dietrich, Heiko +2 more
openaire +3 more sources
Maximal finite subgroups and minimal classes [PDF]
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 \mathbf Q -algebra.
Renaud Coulangeon, Gabriele Nebe
openaire +2 more sources
In this paper we consider finite p′-nilpotent groups which is a generalization of finite p-nilpotent groups. This generalization leads us to consider the various special subgroups such as the Frattini subgroup, Fitting subgroup, and the hypercenter in ...
S. Srinivasan
doaj +1 more source

