نتایج جستجو برای: maximal chains of subgroups

تعداد نتایج: 21176502  

Journal: :Boletim da Sociedade Paranaense de Matemática 2017

A subgroup $H$ is said to be $nc$-supplemented in a group $G$ if there exists a subgroup $Kleq G$ such that $HKlhd G$ and $Hcap K$ is contained in $H_{G}$, the core of $H$ in $G$. We characterize the supersolubility of finite groups $G$ with that every maximal subgroup of the Sylow subgroups is $nc$-supplemented in $G$.

Journal: :international journal of group theory 2013
hoang dung duong andrea lucchini

we discuss whether finiteness properties of a profinite group $g$ can be deduced from the coefficients of the probabilisticzeta function $p_g(s)$. in particular we prove that if $p_g(s)$ is rational and all but finitely many non abelian composition factors of $g$ are isomorphic to $psl(2,p)$ for some prime $p$, then $g$ contains only finitely many maximal subgroups.

An MI-group is an algebraic structure based on a generalization of the concept of a monoid that satisfies the cancellation laws and is endowed with an invertible anti-automorphism representing inversion. In this paper, a topology is defined on an MI-group $G$ under which $G$ is  a topological MI-group. Then we will identify open, discrete and compact MI-subgroups. The connected components of th...

Journal: :International Electronic Journal of Algebra 2019

2002
Alexis De Vos Birger Raa Leo Storme

Reversible logic plays a fundamental role both in ultra-low power electronics and in quantum computing. It is therefore important to have an insight into the structure of the group formed by the reversible logic gates and their cascading into reversible circuits. Such insight is gained from constructing chains of maximal subgroups. The subgroup of control gates plays a prominent role, as it is ...

Journal: :Electronic Journal of Combinatorics 2022

Let $G$ be a graph with vertex set $\{1,2,\ldots,n\}$. Its bond lattice, $BL(G)$, is sublattice of the partition lattice. The elements $BL(G)$ are partitions whose blocks induce connected subgraphs $G$.
 In this article, we consider graphs lattice consists only noncrossing partitions. We define family graphs, called triangulation property and show that any two produce isomorphic lattices. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید