Search results for "Combinatorics"

showing 10 items of 1770 documents

On σ-subnormality criteria in finite groups

2022

Abstract Let σ = { σ i : i ∈ I } be a partition of the set P of all prime numbers. A subgroup H of a finite group G is called σ-subnormal in G if there is a chain of subgroups H = H 0 ⊆ H 1 ⊆ ⋯ ⊆ H n = G where, for every i = 1 , … , n , H i − 1 normal in H i or H i / C o r e H i ( H i − 1 ) is a σ j -group for some j ∈ I . 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. In this paper some σ-subnormality criteria for subgroups of finite groups are studied.

CombinatoricsFinite groupAlgebra and Number TheoryGroup (mathematics)Prime numberPartition (number theory)Prime (order theory)MathematicsJournal of Pure and Applied Algebra
researchProduct

On formations of finite groups with the generalised Wielandt property for residuals

2014

Abstract A formation F of finite groups has the generalised Wielandt property for residuals, or F is a GWP-formation, if the F -residual of a group generated by two F -subnormal subgroups is the subgroup generated by their F -residuals. We prove that every GWP-formation is saturated. This is one of the crucial steps in the hunt for a solution of the classification problem.

CombinatoricsFinite groupAlgebra and Number TheoryProperty (philosophy)Group (mathematics)ResidualMathematicsJournal of Algebra
researchProduct

On complements of 𝔉-residuals of finite groups

2016

ABSTRACTA formation 𝔉 of finite groups has the generalized Wielandt property for residuals, or 𝔉 is a GWP-formation, if the 𝔉-residual of a group generated by two 𝔉-subnormal subgroups is the subgroup generated by their 𝔉-residuals. The main aim of the paper is to determine some sufficient conditions for a finite group to split over its 𝔉-residual.

CombinatoricsFinite groupAlgebra and Number TheoryProperty (programming)Group (mathematics)010102 general mathematics0103 physical sciences010307 mathematical physics0101 mathematics01 natural sciencesMathematicsCommunications in Algebra
researchProduct

Characters and Sylow 2-subgroups of maximal class revisited

2018

Abstract We give two ways to distinguish from the character table of a finite group G if a Sylow 2-subgroup of G has maximal class. We also characterize finite groups with Sylow 3-subgroups of order 3 in terms of their principal 3-block.

CombinatoricsFinite groupClass (set theory)Algebra and Number TheoryCharacter table010102 general mathematics0103 physical sciencesSylow theoremsOrder (group theory)010307 mathematical physics0101 mathematics01 natural sciencesMathematicsJournal of Pure and Applied Algebra
researchProduct

Number of Sylow subgroups in $p$-solvable groups

2003

If G is a finite group and p is a prime number, let vp(G) be the number of Sylow p-subgroups of G. If H is a subgroup of a p-solvable group G, we prove that v p (H) divides v p (G).

CombinatoricsFinite groupComplement (group theory)Solvable groupGroup (mathematics)Applied MathematicsGeneral MathematicsSylow theoremsPrime numberMathematicsProceedings of the American Mathematical Society
researchProduct

A Dual Version of Huppert's  -  Conjecture

2010

Huppert’s ρ-σ conjecture asserts that any finite group has some character degree that is divisible by “many” primes. In this note, we consider a dual version of this problem, and we prove that for any finite group there is some prime that divides “many” character degrees.

CombinatoricsFinite groupConjectureCharacter (mathematics)Mathematics::Number TheoryGeneral MathematicsMathematics::Metric GeometryDegree (angle)Prime (order theory)Dual (category theory)MathematicsInternational Mathematics Research Notices
researchProduct

The McKay conjecture and Galois automorphisms

2004

The main problem of representation theory of finite groups is to find proofs of several conjectures stating that certain global invariants of a finite group G can be computed locally. The simplest of these conjectures is the ?McKay conjecture? which asserts that the number of irreducible complex characters of G of degree not divisible by p is the same if computed in a p-Sylow normalizer of G. In this paper, we propose a much stronger version of this conjecture which deals with Galois automorphisms. In fact, the same idea can be applied to the celebrated Alperin and Dade conjectures.

CombinatoricsFinite groupMathematics (miscellaneous)ConjectureStatistics Probability and UncertaintyInvariant (mathematics)AutomorphismMathematical proofCentralizer and normalizerRepresentation theory of finite groupsGroup representationMathematicsAnnals of Mathematics
researchProduct

On groups with abelian Sylow 2-subgroups

1970

Finite groups with abelian Sylow 2-subgroups have been classified by Walter [8]. In this note I want to describe an alternate proof of some partial result of Walter's work, namely the theorem stated below. It represents the first major reduction step in that classification. The approach used here is to some extent derived from [1]. ! Besides the groups L 2 (q)= PSL(2, q) another class of simple groups enters our discussion: We say that a simple group G with abelian Sz-subgroups is of type JR (Janko-Ree) if, for any involution t in G, CG (t) is a maximal subgroup of G isomorphic to ( t ) | E where PSL(2, q)~ E ~_ PFL(2, q) with odd q > 5. In fact, E = L 2 (q), as proved by Walter 1-7] ; and …

CombinatoricsFinite groupMaximal subgroupGeneral MathematicsSimple groupSylow theoremsAbelian groupPSLDirect productMathematicsMathematische Zeitschrift
researchProduct

An optimal method for the mixed postman problem

2005

CombinatoricsFlow unitComputer scienceSymmetric graph
researchProduct

New structural parameters of fullerenes for principal component analysis

2003

The Kekule structure count and the permanent of the adjacency matrix of fullerenes are related to structural parameters involving the presence of contiguous pentagons p, q, r, q/p and r/p, where p is the number of edges common to two pentagons, q is the number of vertices common to three pentagons and r is the number of pairs of nonadjacent pentagons adjacent to another common pentagon. The cluster analysis of the structural parameters allows classification these parameters. Principal component analysis (PCA) of the structural parameters and the cluster analyses of the fullerenes permit their classification. PCA clearly distinguishes five classes of fullerenes. The cluster analysis of fulle…

CombinatoricsFullereneSimilarity (network science)Principal component analysisCluster (physics)Adjacency matrixPhysical and Theoretical ChemistryMathematicsTheoretical Chemistry Accounts: Theory, Computation, and Modeling (Theoretica Chimica Acta)
researchProduct