Search results for "group theory"

showing 10 items of 703 documents

On self-normalising subgroups of finite groups

2010

[EN] The aim of this paper is to characterise the classes of groups in which every subnormal subgroup is normal, permutable, or S-permutable by the embedding of the subgroups (respectively, subgroups of prime power order) in their normal, permutable, or S-permutable closure, respectively.

Discrete mathematicsFinite groupPst-groupAlgebra and Number TheoryMathematics::CombinatoricsGrups Teoria deAlgebraMathematics::Group TheoryT-groupPt-groupT-groupPermutabilitySylow permutabilityÀlgebraAlgebra over a fieldFinite groupPermutable closureSubnormal closureMATEMATICA APLICADAGroup theoryMathematics
researchProduct

On the orders of zeros of irreducible characters

2009

Let G be a finite group and p a prime number. We say that an element g in G is a vanishing element of G if there exists an irreducible character χ of G such that χ (g) = 0. The main result of this paper shows that, if G does not have any vanishing element of p-power order, then G has a normal Sylow p-subgroup. Also, we prove that this result is a generalization of some classical theorems in Character Theory of finite groups. © 2008 Elsevier Inc. All rights reserved.

Discrete mathematicsFinite groupPure mathematicsBrauer's theorem on induced charactersAlgebra and Number Theoryirreducible character zeroCharacter theorySylow theoremsPrime numberIrreducible elementFinite groupsCharacter (mathematics)Order (group theory)Zeros of charactersCharactersMathematics
researchProduct

On a graph related to permutability in finite groups

2010

For a finite group G we define the graph $\Gamma(G)$ to be the graph whose vertices are the conjugacy classes of cyclic subgroups of G and two conjugacy classes $\{\mathcal {A}, \mathcal {B}\}$ are joined by an edge if for some $\{A \in \mathcal {A},\, B \in \mathcal {B}\, A\}$ and B permute. We characterise those groups G for which $\Gamma(G)$ is complete.

Discrete mathematicsFinite groupSoluble groupApplied MathematicsGrups Teoria deGraphGraphCombinatoricsMathematics::Group TheoryConjugacy classPermutabilityÀlgebraFinite groupMATEMATICA APLICADAMathematics
researchProduct

Locality of order-invariant first-order formulas

2000

A query is local if the decision of whether a tuple in a structure satisfies this query only depends on a small neighborhood of the tuple. We prove that all queries expressible by order-invariant first-order formulas are local.

Discrete mathematicsGeneral Computer ScienceLogicLocalityStructure (category theory)InformationSystems_DATABASEMANAGEMENTFirst orderTheoretical Computer ScienceFirst-order logicCombinatoricsComputational MathematicsOrder (group theory)TupleInvariant (mathematics)MathematicsACM Transactions on Computational Logic
researchProduct

A Motzkin filter in the Tamari lattice

2015

The Tamari lattice of order n can be defined on the set T n of binary trees endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we restrict our attention to the subset M n of Motzkin trees. This set appears as a filter of the Tamari lattice. We prove that its diameter is 2 n - 5 and that its radius is n - 2 . Enumeration results are given for join and meet irreducible elements, minimal elements and coverings. The set M n endowed with an order relation based on a restricted rotation is then isomorphic to a ranked join-semilattice recently defined in Baril and Pallo (2014). As a consequence, we deduce an upper bound for the rotation distan…

Discrete mathematicsMathematics::CombinatoricsBinary tree010102 general mathematicsLattice (group)0102 computer and information sciences[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesUpper and lower boundsTheoretical Computer ScienceCombinatoricsJoin and meet010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Discrete Mathematics and CombinatoricsOrder (group theory)Ideal (order theory)0101 mathematicsFilter (mathematics)Tamari latticeComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Fixed point properties and proximinality in Banach spaces

2009

Abstract In this paper we prove the existence of a fixed point for several classes of mappings (mappings admitting a center, nonexpansive mappings, asymptotically nonexpansive mappings) defined on the closed convex subsets of a Banach space satisfying some proximinality conditions. In particular, we derive a sufficient condition, more general than weak star compactness, such that if C is a bounded closed convex subset of l 1 satisfying this condition, then every nonexpansive mapping T : C → C has a fixed point.

Discrete mathematicsMathematics::Functional AnalysisPure mathematicsApplied MathematicsRegular polygonBanach spaceCenter (group theory)Star (graph theory)Fixed pointCompact spaceBounded functionCoincidence pointAnalysisMathematicsNonlinear Analysis: Theory, Methods & Applications
researchProduct

Unconditional Basis and Gordon–Lewis Constants for Spaces of Polynomials

2001

Abstract No infinite dimensional Banach space X is known which has the property that for m ⩾2 the Banach space of all continuous m -homogeneous polynomials on X has an unconditional basis. Following a program originally initiated by Gordon and Lewis we study unconditionality in spaces of m -homogeneous polynomials and symmetric tensor products of order m in Banach spaces. We show that for each Banach space X which has a dual with an unconditional basis ( x * i ), the approximable (nuclear) m -homogeneous polynomials on X have an unconditional basis if and only if the monomial basis with respect to ( x * i ) is unconditional. Moreover, we determine an asymptotically correct estimate for the …

Discrete mathematicsMathematics::Functional AnalysisPure mathematicsPolynomialBanach spacepolynomialBasis (linear algebra)Banach spaceMonomial basisunconditional basisUnconditional convergenceOrder (group theory)Interpolation spaceSymmetric tensorsymmetric tensor productGordon–Lewis propertyAnalysisMathematicsJournal of Functional Analysis
researchProduct

Fitting classes and lattice formations I

2004

AbstractA lattice formation is a class of groups whose elements are the direct product of Hall subgroups corresponding to pairwise disjoint sets of primes. In this paper Fitting classes with stronger closure properties involving F-subnormal subgroups, for a lattice formation F of full characteristic, are studied. For a subgroup-closed saturated formation G, a characterisation of the G-projectors of finite soluble groups is also obtained. It is inspired by the characterisation of the Carter subgroups as the N-projectors, N being the class of nilpotent groups.

Discrete mathematicsMathematics::Group TheoryClass (set theory)Pure mathematicsGeneral MathematicsClosure (topology)Lattice (group)Fitting subgroupMathematicsJournal of the Australian Mathematical Society
researchProduct

THE STRUCTURE OF MUTUALLY PERMUTABLE PRODUCTS OF FINITE NILPOTENT GROUPS

2007

We consider mutually permutable products G = AB of two nilpotent groups. The structure of the Sylow p-subgroups of its nilpotent residual is described.

Discrete mathematicsMathematics::Group TheoryPure mathematicsNilpotentGeneral MathematicsMathematics::Rings and AlgebrasSylow theoremsStructure (category theory)Permutable primeNilpotent groupMathematics::Representation TheoryMathematicsInternational Journal of Algebra and Computation
researchProduct

ℏ-Normalizers and local definitions of saturated formations of finite groups

1989

We define, in each finite groupG, h-normalizers associated with a Schunck class ℏ of the formEΦ f with f a formation. We use these normalizers in order to give some sufficient conditions for a saturated formation of finite groups to have a maximal local definition.

Discrete mathematicsMaximal subgroupClass (set theory)Pure mathematicsFinite groupConjugacy classGeneral MathematicsOrder (group theory)Algebra over a fieldNilpotent groupMathematicsIsrael Journal of Mathematics
researchProduct