Results 21 to 30 of about 7,164 (304)

Irredundant families of maximal subgroups of finite solvable groups [PDF]

open access: yesInternational Journal of Group Theory, 2023
Let $\mathcal{M}$ be a family of maximal subgroups of a group $G.$ We say that $\mathcal{M}$ is irredundant if its intersection is not equal to the intersection of any proper subfamily of $\mathcal{M}$. The maximal dimension of $G$ is the maximal size of
Agnieszka Stocka
doaj   +1 more source

The 3-closure of a solvable permutation group is solvable [PDF]

open access: yesJournal of Algebra, 2022
Let $m$ be a positive integer and let $Ω$ be a finite set. The $m$-closure of $G\leq\operatorname{Sym}(Ω)$ is the largest permutation group on $Ω$ having the same orbits as $G$ in its induced action on the Cartesian product $Ω^m$. The $1$-closure and $2$-closure of a solvable permutation group need not be solvable.
E.A. O'Brien   +3 more
openaire   +2 more sources

The codegrees of real-valued Irreducible characters of finite groups [PDF]

open access: yesریاضی و جامعه, 2023
In this note we show that if every codegree of real-valued irreducible characters of a finite group $G$ is either a $2$-number or $2'$-number, then $G$ is ...
Zeynab Akhlaghi
doaj   +1 more source

Partition numbers of finite solvable groups [PDF]

open access: yesAdvances in Group Theory and Applications, 2018
A group partition is a group cover in which the elements have trivial pairwise intersection. Here we define the partition number of a group - the minimal number of subgroups necessary to form a partition - and examine some of its properties, including ...
Tuval Foguel, Nick Sizemore
doaj   +1 more source

Solvable groups whose monomial, monolithic characters have prime power codegrees [PDF]

open access: yesInternational Journal of Group Theory, 2023
In this note, we prove that if $G$ is solvable and ${\rm cod}(\chi)$ is a $p$-power for every nonlinear, monomial, monolithic $\chi\in {\rm Irr}(G)$ or every nonlinear, monomial, monolithic $\chi \in {\rm IBr} (G)$, then $P$ is normal in $G$, where $p ...
Xiaoyou Chen, Mark Lewis
doaj   +1 more source

Finite groups whose maximal subgroups of even order are MSN-groups

open access: yesOpen Mathematics, 2022
A finite group GG is called an MSN-group if all maximal subgroups of the Sylow subgroups of GG are subnormal in GG. In this article, we investigate the structure of finite groups GG such that GG is a non-MSN-group of even order in which every maximal ...
Wang Wanlin, Guo Pengfei
doaj   +1 more source

Profinite just infinite residually solvable Lie algebras [PDF]

open access: yesInternational Journal of Group Theory, 2023
We provide some characterization theorems about just infinite profinite residually solvable Lie algebras, similarly to what C. Reid has done for just infinite profinite groups.
Dario Villanis Ziani
doaj   +1 more source

Controllability of affine right-invariant systems on solvable Lie groups [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 1997
The aim of this paper is to present some recent results on controllability of right-invariant systems on Lie groups. From the Lie-theoretical point of view, we study conditions under which subsemigroups generated by half-planes in the Lie algebra of ...
Yuri L. Sachkov
doaj   +2 more sources

Solvable Lie A-algebras. [PDF]

open access: yes, 2011
A finite-dimensional Lie algebra $L$ over a field $F$ is called an $A$-algebra if all of its nilpotent subalgebras are abelian. This is analogous to the concept of an $A$-group: a finite group with the property that all of its Sylow subgroups are abelian.
Towers, David A., David A. Towers
core   +1 more source

Some remarks on unipotent automorphisms [PDF]

open access: yesInternational Journal of Group Theory, 2020
An automorphism $\alpha$ of the group $G$ is said to be $n$-unipotent if $[g,_n\alpha]=1$ for all $g\in G$‎. ‎In this paper we obtain some results related to nilpotency of groups of $n$-unipotent automorphisms of solvable groups‎.
Orazio Puglisi, Gunnar Traustason
doaj   +1 more source

Home - About - Disclaimer - Privacy