Search results for "Group Theory"

showing 10 items of 703 documents

On the Deskins index complex of a maximal subgroup of a finite group

1999

AbstractLet M be a maximal subgroup of a finite group G. A subgroup C of G is said to be a completion of M in G if C is not contained in M while every proper subgroup of C which is normal in G is contained in M. The set, I(M), of all completions of M is called the index complex of M in G. Set P(M) = {C ϵ I(M) ¦ C} is maximal in I(M) and G = CM. The purpose of this note is to prove: A finite group G is solvable if and only if, for each maximal subgroup M of G, P(M) contains element C with CK(C) nilpotent.

CombinatoricsNormal subgroupDiscrete mathematicsMathematics::Group TheoryNilpotentFinite groupMaximal subgroupAlgebra and Number TheorySubgroupIndex of a subgroupSubgroup CMathematicsJournal of Pure and Applied Algebra
researchProduct

On the normal index of maximal subgroups in finite groups

1990

AbstractFor a maximal subgroup M of a finite group G, the normal index of M is the order of a chief factor H/K where H is minimal in the set of normal supplements of M in G. We use the primitive permutation representations of a finite group G and the normal index of its maximal subgroups to obtain results about the influence of the set of maximal subgroups in the structure of G.

CombinatoricsNormal subgroupMaximal subgroupFinite groupNormal p-complementMathematics::Group TheoryAlgebra and Number TheoryOrder (group theory)CosetCharacteristic subgroupIndex of a subgroupMathematics
researchProduct

p-Brauer characters ofq-defect 0

1994

For ap-solvable groupG the number of irreducible Brauer characters ofG with a given vertexP is equal to the number of irreducible Brauer characters of the normalizer ofP with vertexP. In this paper we prove in addition that for solvable groups one can control the number of those characters whose degrees are divisible by the largest possibleq-power dividing the order of |G|.

CombinatoricsNumber theoryBrauer's theorem on induced charactersSolvable groupGeneral MathematicsOrder (group theory)Algebraic geometryMathematics::Representation TheoryCentralizer and normalizerMathematicsManuscripta Mathematica
researchProduct

Asymptotics for the standard and the Capelli identities

2003

Let {c n (St k )} and {c n (C k )} be the sequences of codimensions of the T-ideals generated by the standard polynomial of degreek and by thek-th Capelli polynomial, respectively. We study the asymptotic behaviour of these two sequences over a fieldF of characteristic zero. For the standard polynomial, among other results, we show that the following asymptotic equalities hold: $$\begin{gathered} c_n \left( {St_{2k} } \right) \simeq c_n \left( {C_{k^2 + 1} } \right) \simeq c_n \left( {M_k \left( F \right)} \right), \hfill \\ c_n \left( {St_{2k + 1} } \right) \simeq c_n \left( {M_{k \times 2k} \left( F \right) \oplus M_{2k \times k} \left( F \right)} \right), \hfill \\ \end{gathered} $$ wher…

CombinatoricsPolynomialGeneral MathematicsZero (complex analysis)Block (permutation group theory)Triangular matrixAlgebra over a fieldMathematicsIsrael Journal of Mathematics
researchProduct

Numerical bounds for semi-stable families of curves or of certain higher-dimensional manifolds

2005

Given an open subset U U of a projective curve Y Y and a smooth family f : V → U f:V\to U of curves, with semi-stable reduction over Y Y , we show that for a subvariation V \mathbb {V} of Hodge structures of R 1 f ∗ C V R^1f_*\mathbb {C}_V with rank ( V ) > 2 \textrm {rank} (\mathbb {V})>2 the Arakelov inequality must be strict. For families of n n -folds we prove a similar result under the assumption that the ( n , 0 ) (n,0) component of the Higgs bundle of V \mathbb {V} defines a birational map.

CombinatoricsProjective curveAlgebra and Number TheoryReduction (recursion theory)Hodge bundleComponent (group theory)Geometry and TopologyRank (differential topology)MathematicsHiggs bundleJournal of Algebraic Geometry
researchProduct

Soluble groups with their centralizer factor groups of bounded rank

2007

Abstract For a group class X , a group G is said to be a C X -group if the factor group G / C G ( g G ) ∈ X for all g ∈ G , where C G ( g G ) is the centralizer in G of the normal closure of g in G . For the class F f of groups of finite order less than or equal to f , a classical result of B.H. Neumann [Groups with finite classes of conjugate elements, Proc. London Math. Soc. 1 (1951) 178–187] states that if G ∈ C F f , the commutator group G ′ belongs to F f ′ for some f ′ depending only on f . We prove that a similar result holds for the class S r ( d ) , the class of soluble groups of derived length at most d which have Prufer rank at most r . Namely, if G ∈ C S r ( d ) , then G ′ ∈ S d…

CombinatoricsPure mathematicsAlgebra and Number TheoryGroup (mathematics)Bounded functionPrüfer rankOrder (group theory)Rank (differential topology)Conjugate elementCentralizer and normalizerMathematicsJournal of Pure and Applied Algebra
researchProduct

Brauer's fixed-point-formula as a consequence of Thompson's order-formula

1991

CombinatoricsPure mathematicsBrauer's theorem on induced charactersGeneral MathematicsOrder (group theory)Fixed pointMathematicsArchiv der Mathematik
researchProduct

Y-proper graded cocharacters of upper triangular matrices of order m graded by the m-tuple ϕ=(0,0,1,…,m−2)

2015

Abstract Let F be a field of characteristic 0. We consider the algebra UT m ( F ) of upper triangular matrices of order m endowed with an elementary Z m -grading induced by the m-tuple ϕ = ( 0 , 0 , 1 , … , m − 2 ) , then we compute its Y-proper graded cocharacter sequence and we give the explicit formulas for the multiplicities in the case m = 2 , 3 , 4 , 5 .

CombinatoricsSequenceAlgebra and Number TheoryTriangular matrixOrder (group theory)Field (mathematics)Algebra over a fieldTupleMathematicsJournal of Algebra
researchProduct

On bijections vs. unary functions

1996

A set of finite structures is in Binary NP if it can be characterized by existential second order formulas in which second order quantification is over relations of arity 2. In [DLS95] subclasses of Binary NP were considered, in which the second order quantifiers range only over certain classes of relations. It was shown that many of these subclasses coincide and that all of them can be ordered in a three-level linear hierarchy, the levels of which are represented by bijections, successor relations and unary functions respectively.

CombinatoricsSet (abstract data type)Range (mathematics)Unary operationHierarchy (mathematics)Computer Science::Logic in Computer ScienceOrder (group theory)Unary functionArityBijection injection and surjectionComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

$n$-th relative nilpotency degree and relative $n$-isoclinism classes

2011

P. Hall introduced the notion of isoclinism between two groups more than 60 years ago. Successively, many authors have extended such a notion in different contexts. The present paper deals with the notion of relative n-isoclinism, given by N. S. Hekster in 1986, and with the notion of n-th relative nilpotency degree, recently introduced in literature.

CombinatoricsSettore MAT/02 - AlgebraSettore MAT/05 - Analisi MatematicaGeneral MathematicsFOS: Mathematicsnilpotency degree commutativity degree Haar measure $p$-groupsGroup Theory (math.GR)Settore MAT/03 - GeometriaMathematics - Group TheoryHaar measureDegree (temperature)Mathematics
researchProduct