Search results for "Subgroup"
showing 10 items of 237 documents
A note on easy and efficient computation of full abelian periods of a word
2016
Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(n\log\log n)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem.
On minimal non-PC-groups
2009
On dit qu'un groupe G est un PC-groupe, si pour tout x ∈ G, G/C G (x G ) est une extension d'un groupe polycyclique par un groupe fini. Un non-PC-groupe minimal est un groupe qui n'est pas un PC-groupe mais dont tous les sous-groupes propres sont des PC-groupes. Notre principal resultat est qu'un non-PC-groupe minimal ayant un groupe quotient fini non-trivial est une extension cyclique finie d'un groupe abelien divisible de rang fini.
On sigma-subnormal subgroups of factorised finite groups
2020
Abstract Let σ = { σ i : i ∈ I } be a partition of the set P of all prime numbers. A subgroup X of a finite group G is called σ-subnormal in G if there is chain of subgroups X = X 0 ⊆ X 1 ⊆ ⋯ ⊆ X n = G with X i − 1 normal in X i or X i / C o r e X i ( X i − 1 ) is a σ i -group for some i ∈ I , 1 ≤ i ≤ n . In the special case that σ is the partition of P into sets containing exactly one prime each, the σ-subnormality reduces to the familiar case of subnormality. If a finite soluble group G = A B is factorised as the product of the subgroups A and B, and X is a subgroup of G such that X is σ-subnormal in 〈 X , X g 〉 for all g ∈ A ∪ B , we prove that X is σ-subnormal in G. This is an extension…
Non-vanishing elements of finite groups
2010
AbstractLet G be a finite group, and let Irr(G) denote the set of irreducible complex characters of G. An element x of G is non-vanishing if, for every χ in Irr(G), we have χ(x)≠0. We prove that, if x is a non-vanishing element of G and the order of x is coprime to 6, then x lies in the Fitting subgroup of G.
FINITE TRIFACTORISED GROUPS AND -DECOMPOSABILITY
2018
We derive some structural properties of a trifactorised finite group $G=AB=AC=BC$, where $A$, $B$, and $C$ are subgroups of $G$, provided that $A=A_{\unicode[STIX]{x1D70B}}\times A_{\unicode[STIX]{x1D70B}^{\prime }}$ and $B=B_{\unicode[STIX]{x1D70B}}\times B_{\unicode[STIX]{x1D70B}^{\prime }}$ are $\unicode[STIX]{x1D70B}$-decomposable groups, for a set of primes $\unicode[STIX]{x1D70B}$.
SURFACE SUBGROUPS OF RIGHT-ANGLED ARTIN GROUPS
2007
We consider the question of which right-angled Artin groups contain closed hyperbolic surface subgroups. It is known that a right-angled Artin group $A(K)$ has such a subgroup if its defining graph $K$ contains an $n$-hole (i.e. an induced cycle of length $n$) with $n\geq 5$. We construct another eight "forbidden" graphs and show that every graph $K$ on $\le 8$ vertices either contains one of our examples, or contains a hole of length $\ge 5$, or has the property that $A(K)$ does not contain hyperbolic closed surface subgroups. We also provide several sufficient conditions for a \RAAG to contain no hyperbolic surface subgroups. We prove that for one of these "forbidden" subgraphs $P_2(6)$, …
Algorithms for permutability in finite groups
2013
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.
On generalised FC-groups in which normality is a transitive relation
2016
We extend to soluble FC∗ -groups, the class of generalised FC-groups introduced in [F. de Giovanni, A. Russo, G. Vincenzi, Groups with restricted conjugacy classes , Serdica Math. J. 28(3) (2002), 241 254], the characterisation of finite soluble T-groups obtained recently in [G. Kaplan, On T-groups, supersolvable groups and maximal subgroups , Arch. Math. 96 (2011), 19 25].
On a class of generalised Schmidt groups
2015
In this paper families of non-nilpotent subgroups covering the non-nilpotent part of a finite group are considered. An A 5 -free group possessing one of these families is soluble, and soluble groups with this property have Fitting length at most three. A bound on the number of primes dividing the order of the group is also obtained.
The probability that $x$ and $y$ commute in a compact group
2010
We show that a compact group $G$ has finite conjugacy classes, i.e., is an FC-group if and only if its center $Z(G)$ is open if and only if its commutator subgroup $G'$ is finite. Let $d(G)$ denote the Haar measure of the set of all pairs $(x,y)$ in $G \times G$ for which $[x,y] = 1$; this, formally, is the probability that two randomly picked elements commute. We prove that $d(G)$ is always rational and that it is positive if and only if $G$ is an extension of an FC-group by a finite group. This entails that $G$ is abelian by finite. The proofs involve measure theory, transformation groups, Lie theory of arbitrary compact groups, and representation theory of compact groups. Examples and re…