Search results for "symmetric group"

showing 10 items of 43 documents

Invariant ordering of surface groups and 3-manifolds which fibre over $S^1$

2006

CombinatoricsDicyclic groupGeneral MathematicsInvariant (mathematics)Point groups in two dimensionsCovering groups of the alternating and symmetric groupsMathematicsNon-abelian groupMathematical Proceedings of the Cambridge Philosophical Society
researchProduct

Central Units, Class Sums and Characters of the Symmetric Group

2010

In the search for central units of a group algebra, we look at the class sums of the group algebra of the symmetric group S n in characteristic zero, and we show that they are units in very special instances.

CombinatoricsDiscrete mathematicsSymmetric algebraAlgebra and Number TheoryCharacter tableSymmetric groupQuaternion groupAlternating groupGroup algebraPermutation groupGroup ringMathematicsCommunications in Algebra
researchProduct

Characterization of chain geometries of finite dimension by their automorphism group

1990

A large class of chain geometries of finite dimension is characterized as strong chain spaces possessing a distinguished group of automorphisms fixing two distant points.

CombinatoricsInner automorphismChain (algebraic topology)HolomorphSymmetric groupSO(8)Alternating groupOuter automorphism groupGeometry and TopologyAutomorphismMathematicsGeometriae Dedicata
researchProduct

The complex of words and Nakaoka stability

2005

We give a new simple proof of the exactness of the complex of injective words and use it to prove Nakaoka's homology stability for symmetric groups. The methods are generalized to show acyclicity in low degrees for the complex of words in "general position". Hm(§ni1;Z) = Hm(§n;Z) for n=2 > m where §n denotes the permutation group of n elements. An elementary proof of this fact has not been available in the literature. In the first section the complex C⁄(m) of abelian groups is studied which in de- gree n is freely generated by injective words of length n. The alphabet consists of m letters. The complex C⁄(m) has the only non vanishing homology in degree m (Theorem 1). This is a result of F.…

CombinatoricsMathematics (miscellaneous)Symmetric groupElementary proofAbelian groupHomology (mathematics)Permutation groupPartially ordered setInjective functionMathematicsVector spaceHomology, Homotopy and Applications
researchProduct

Central polynomials and matrix invariants

1996

LetK be a field, charK=0 andM n (K) the algebra ofn×n matrices overK. If λ=(λ1,…,λ m ) andμ=(μ 1,…,μ m ) are partitions ofn 2 let $$\begin{gathered} F^{\lambda ,\mu } = \sum\limits_{\sigma ,\tau \in S_n 2} {\left( {\operatorname{sgn} \sigma \tau } \right)x_\sigma (1) \cdot \cdot \cdot x_\sigma (\lambda _1 )^{y_\tau } (1)^{ \cdot \cdot \cdot } y_\tau (\mu _1 )^{x\sigma } (\lambda _1 + 1)} \hfill \\ \cdot \cdot \cdot x_\sigma (\lambda _1 + \lambda _2 )^{y_\tau } (\mu _1 ^{ + 1} )^{ \cdot \cdot \cdot y_\tau } (\mu _1 + \mu _2 ) \hfill \\ \cdot \cdot \cdot x_\sigma (\lambda _1 + \cdot \cdot \cdot + \lambda _{\mu - 1} ^{ + 1} ) \hfill \\ \cdot \cdot \cdot x_\sigma (n^2 )^{y_\tau } (\mu _1 ^{ + \…

CombinatoricsPolynomialSymmetric groupGeneral MathematicsInvariants of tensorsField (mathematics)Algebra over a fieldLambdaMathematics
researchProduct

Central idempotents and units in rational group algebras of alternating groups

1998

Let ℚAn be the group algebra of the alternating group over the rationals. By exploiting the theory of Young tableaux, we give an explicit description of the minimal central idempotents of ℚAn. As an application we construct finitely many generators for a subgroup of finite index in the centre of the group of units of ℚAn.

CombinatoricsRational numberSymmetric groupGeneral MathematicsRational groupGenerating set of a groupYoung tableauAlternating groupGroup algebraCovering groups of the alternating and symmetric groupsMathematics
researchProduct

Transitive permutation groups in which all derangements are involutions

2006

AbstractLet G be a transitive permutation group in which all derangements are involutions. We prove that G is either an elementary abelian 2-group or is a Frobenius group having an elementary abelian 2-group as kernel. We also consider the analogous problem for abstract groups, and we classify groups G with a proper subgroup H such that every element of G not conjugate to an element of H is an involution.

CombinatoricsSubgroupAlgebra and Number TheorySymmetric groupPrimitive permutation groupElementary abelian groupAbelian groupFrobenius groupCyclic permutationMathematicsNon-abelian groupJournal of Pure and Applied Algebra
researchProduct

A series of finite groups and related symmetric designs

2007

For any odd prime power q = pe we study a certain solvable group G of order q2 · ((q-1)/2)2 · 2 and construct from its internal structure a symmetric design D with parameters (2q2+1, q2, (q2-1)/2) on which G acts as an automorphism group. As a consequence we find that the full automorphism group of D contains a subgroup of order |G| · e2.

CombinatoricsSymmetric design; automorphism groupSeries (mathematics)Solvable groupSymmetric groupGeneral MathematicsStructure (category theory)Order (group theory)Alternating groupSymmetric designPrime powerMathematicsGlasnik matematički
researchProduct

On permutations of class sums of alternating groups

1997

We prove a result concerning the class sums of the alternating group An; as a consequence we deduce that if θ is a normalized automorphism of the integral group ring then there exists such that is the identity on , where Sn:is the symmetric group and is the center of

Combinatoricsp-groupAlgebra and Number TheoryInner automorphismSymmetric groupOuter automorphism groupAlternating groupPermutation groupDihedral group of order 6Covering groups of the alternating and symmetric groupsMathematicsCommunications in Algebra
researchProduct

Complex group algebras of finite groups: Brauer’s Problem 1

2005

Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.

Computer Science::Machine LearningModular representation theoryPure mathematicsFinite groupBrauer's theorem on induced charactersGroup (mathematics)General MathematicsMathematicsofComputing_GENERALComputer Science::Digital LibrariesRepresentation theoryCombinatoricsStatistics::Machine LearningGroup of Lie typeSymmetric groupComputer Science::Mathematical SoftwareComputer Science::Programming LanguagesBrauer groupMathematicsElectronic Research Announcements of the American Mathematical Society
researchProduct