Search results for "Number"

showing 10 items of 3939 documents

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

Multiplicity of Boardman strata and deformations of map germs

1998

AbstractWe define algebraically for each map germ f:Kn,0→Kp, 0 and for each Boardman symbol i=(i1,…,ik) a number ci(f) which is -invariant. If f is finitely determined, this number is the generalization of the Milnor number of f when p = 1, the number of cusps of f when n = p = 2, or the number of cross caps when n = 2, p = 3. We study some properties of this number and prove that, in some particular cases, this number can be interpreted geometrically as the number of Σi points that appear in a generic deformation of f. In the last part, we compute this number in the case that the map germ is a projection and give some applications to catastrophe map germs.

CombinatoricsGeneral MathematicsGermMultiplicity (mathematics)MathematicsMilnor numberGlasgow Mathematical Journal
researchProduct

A Loopless Generation of Bitstrings without p Consecutive Ones

2001

Let F n (p) be the set of all n-length bitstrings such that there are no p consecutive ls. F n (p) is counted with the pth order Fibonacci numbers and it may be regarded as the subsets of {1, 2,…, n} without p consecutive elements and bitstrings in F n (p) code a particular class of trees or compositions of an integer. In this paper we give a Gray code for F n (p) which can be implemented in a recursive generating algorithm, and finally in a loopless generating algorithm.

CombinatoricsGray codeSet (abstract data type)Discrete mathematicssymbols.namesakeCode (set theory)Fibonacci numberBinary treeIntegersymbolsOrder (group theory)Hamiltonian pathMathematics
researchProduct

On Join Properties of Hall π-Subgroups of Finite π-Soluble Groups

1998

All groups considered in the sequel are finite. K. Doerk and T. Hawkes, in Section I.4 of their recent comprehensive w x volume on finite soluble groups 1 , include background material and a proof of the following result: Let S be a Hall system of a soluble group G and let U and V be subgroups into which S reduces. Then S reduces into U l V, and if , in addition, U permutes with V, then S reduces into UV. It is clear that the second part of the above result holds equally well with a single Hall subgroup in place of a Hall system; in other words, if a Hall p-subgroup of G contains Hall p-subgroups of U and V and U permutes with V, then it also contains a Hall p-subgroup of UV.

CombinatoricsHall subgroupAlgebra and Number TheorySection (category theory)Group (mathematics)Join (sigma algebra)MathematicsJournal of Algebra
researchProduct

A Star-Variety With Almost Polynomial Growth

2000

Abstract Let F be a field of characteristic zero. In this paper we construct a finite dimensional F -algebra with involution M and we study its ∗ -polynomial identities; on one hand we determine a generator of the corresponding T -ideal of the free algebra with involution and on the other we give a complete description of the multilinear ∗ -identities through the representation theory of the hyperoctahedral group. As an outcome of this study we show that the ∗ -variety generated by M , var( M , ∗ ) has almost polynomial growth, i.e., the sequence of ∗ -codimensions of M cannot be bounded by any polynomial function but any proper ∗ -subvariety of var( M , ∗ ) has polynomial growth. If G 2 is…

CombinatoricsInvolution (mathematics)Multilinear mapAlgebra and Number TheorylawAlternating polynomialFree algebraBounded functionA* search algorithmHyperoctahedral groupRepresentation theorylaw.inventionMathematicsJournal of Algebra
researchProduct

On Banaschewski functions in lattices

1991

hold for all x, y ~ X. We call such a function z a Banaschewski function or a B-function on X. A lattice L is a B-lattice or antitonely complemented, if there is a B-function defined on the whole lattice L. For instance, Boolean lattices as well as orthocomplemented lattices are B-lattices. On the other hand, a B-lattice is not necessarily Boolean or orthocomplemented, although a distributive B-lattice is a Boolean lattice. It is shown later that a matroid (geometric) lattice is also a B-lattice. Naturally, our results include the lemma of Banaschewski [ 1, Lemma 4], by which the lattice of the subspaces of a vector space is a B-lattice. It should be emphasized that a B-function is supposed…

CombinatoricsLemma (mathematics)Algebra and Number TheoryDistributive propertyHigh Energy Physics::LatticeLattice (order)Order (group theory)Function (mathematics)Linear subspaceMatroidVector spaceMathematicsAlgebra Universalis
researchProduct

Towards Vorst's conjecture in positive characteristic

2018

Vorst's conjecture relates the regularity of a ring with the $\mathbb{A}^1$-homotopy invariance of its $K$-theory. We show a variant of this conjecture in positive characteristic.

CombinatoricsMathematics - Algebraic GeometryRing (mathematics)Algebra and Number TheoryConjectureMathematics::K-Theory and HomologyMathematics - K-Theory and HomologyFOS: MathematicsK-Theory and Homology (math.KT)Algebraic Geometry (math.AG)Valuation ringMathematicsCompositio Mathematica
researchProduct

Finite groups with subgroups supersoluble or subnormal

2009

Abstract The aim of this paper is to study the structure of finite groups whose non-subnormal subgroups lie in some subclasses of the class of finite supersoluble groups.

CombinatoricsMathematics::Group TheoryClass (set theory)Algebra and Number TheoryGroup of Lie typeLocally finite groupStructure (category theory)CA-groupCycle graph (algebra)Finite groupsSupersoluble groupsSoluble groupsMathematicsJournal of Algebra
researchProduct

A Local Approach to Certain Classes of Finite Groups

2003

Abstract We develop several local approaches for the three classes of finite groups: T-groups (normality is a transitive relation) and PT-groups (permutability is a transitive relation) and PST-groups (S-permutability is a transitive relation). Here a subgroup of a finite group G is S-permutable if it permutes with all the Sylow subgroup of G.

CombinatoricsMathematics::Group TheoryFinite groupTransitive relationMathematics::CombinatoricsAlgebra and Number TheoryLocally finite groupSylow theoremsComponent (group theory)Classification of finite simple groupsCA-groupFrobenius groupMathematicsCommunications in Algebra
researchProduct