Search results for "symmetric group"

showing 10 items of 43 documents

Some results concerning simple locally finite groups of 1-type

2005

AbstractIn this paper several aspects of infinite simple locally finite groups of 1-type are considered. In the first part, the classes of diagonal limits of finite alternating groups, of diagonal limits of finite direct products of alternating groups, and of absolutely simple groups of 1-type are distinguished from each other. In the second part, inductive systems of representations over fields of characteristic zero (which are known to correspond to ideals in the group algebra) are studied in general for groups of 1-type. The roles of primitive respectively imprimitive representations in inductive systems are investigated. Moreover it is shown that in any proper inductive system the depth…

Discrete mathematicsAlgebra and Number TheoryProfinite groupGroup ringsGroup (mathematics)Inductive systemsSimple groupsCovering groups of the alternating and symmetric groupsLocally finite groupsGroup of Lie typeSymmetric groupSimple groupClassification of finite simple groupsGroup theoryMathematicsJournal of Algebra
researchProduct

A matrix of combinatorial numbers related to the symmetric groups

1979

For permutation groups G of finite degree we define numbers t"B(G)=|G|^-^[email protected]?"R"@?"[email protected]?"1(1a"1(g))^b^"^i, where B=(b"1,...,b"1) is a tuple of non-negative integers and a"1(g) denotes the number of i cycles in the element g. We show that t"B(G) is the number of orbits of G, acting on a set @D"B(G) of tuples of matrices. In the case G=S"n we get a natural interpretation for combinatorial numbers connected with the Stiring numbers of the second kind.

Discrete mathematicsCombinatoricsMatrix (mathematics)Degree (graph theory)Symmetric groupDiscrete Mathematics and CombinatoricsFunction compositionPermutation groupTupleElement (category theory)Theoretical Computer ScienceInterpretation (model theory)MathematicsDiscrete Mathematics
researchProduct

Symmetric (79, 27, 9)-designs Admitting a Faithful Action of a Frobenius Group of Order 39

1997

AbstractIn this paper we present the classification of symmetric designs with parameters (79, 27, 9) on which a non-abelian group of order 39 acts faithfully. In particular, we show that such a group acts semi-standardly with 7 orbits. Using the method of tactical decompositions, we are able to construct exactly 1320 non-isomorphic designs. The orders of the full automorphism groups of these designs all divide 8 · 3 · 13.

Discrete mathematicsKlein four-groupG-moduleQuaternion groupAlternating groupOuter automorphism groupGroup representationsymmetric design; Frobenius group; orbit structureTheoretical Computer ScienceCombinatoricsComputational Theory and MathematicsSymmetric groupDiscrete Mathematics and CombinatoricsGeometry and TopologyFrobenius groupMathematicsEuropean Journal of Combinatorics
researchProduct

Group graded algebras and multiplicities bounded by a constant

2013

AbstractLet G be a finite group and A a G-graded algebra over a field of characteristic zero. When A is a PI-algebra, the graded codimensions of A are exponentially bounded and one can study the corresponding graded cocharacters via the representation theory of products of symmetric groups. Here we characterize in two different ways when the corresponding multiplicities are bounded by a constant.

Discrete mathematicsPure mathematicsFinite groupAlgebra and Number TheoryMathematics::Commutative AlgebraGroup (mathematics)Zero (complex analysis)Polynomial identities Graded algebras cocharactersRepresentation theorySettore MAT/02 - AlgebraSymmetric groupBounded functionAlgebra over a fieldConstant (mathematics)MathematicsJournal of Pure and Applied Algebra
researchProduct

Symmetry-assisted adversaries for quantum state generation

2011

We introduce a new quantum adversary method to prove lower bounds on the query complexity of the quantum state generation problem. This problem encompasses both, the computation of partial or total functions and the preparation of target quantum states. There has been hope for quite some time that quantum state generation might be a route to tackle the $backslash$sc Graph Isomorphism problem. We show that for the related problem of $backslash$sc Index Erasure our method leads to a lower bound of $backslash Omega(backslash sqrt N)$ which matches an upper bound obtained via reduction to quantum search on $N$ elements. This closes an open problem first raised by Shi [FOCS'02]. Our approach is …

Discrete mathematicsQuantum PhysicsReduction (recursion theory)Informatique généraleOpen problemMultiplicative function0102 computer and information sciences01 natural sciencesUpper and lower boundsComputer Science - Computational ComplexityRepresentation theory of the symmetric group010201 computation theory & mathematicsQuantum state0103 physical sciencesGraph isomorphism010306 general physicsQuantumMathematics
researchProduct

Automorphism groups of some affine and finite type Artin groups

2004

We observe that, for fixed n ≥ 3, each of the Artin groups of finite type An, Bn = Cn, and affine type ˜ An−1 and ˜ Cn−1 is a central extension of a finite index subgroup of the mapping class group of the (n + 2)-punctured sphere. (The centre is trivial in the affine case and infinite cyclic in the finite type cases). Using results of Ivanov and Korkmaz on abstract commensurators of surface mapping class groups we are able to determine the automorphism groups of each member of these four infinite families of Artin groups. A rank n Coxeter matrix is a symmetric n × n matrix M with integer entries mij ∈ N ∪ {∞} where mij ≥ 2 for ij, and mii = 1 for all 1 ≤ i ≤ n. Given any rank n Coxeter matr…

Discrete mathematics[ MATH.MATH-GR ] Mathematics [math]/Group Theory [math.GR]General Mathematics010102 general mathematicsCoxeter groupBraid group20F36Group Theory (math.GR)Automorphism01 natural sciences[MATH.MATH-GR]Mathematics [math]/Group Theory [math.GR]ConductorCombinatoricsMathematics::Group TheoryGroup of Lie typeSymmetric group0103 physical sciencesFOS: MathematicsRank (graph theory)Artin group010307 mathematical physics0101 mathematicsMathematics - Group Theory[MATH.MATH-GR] Mathematics [math]/Group Theory [math.GR]Mathematics
researchProduct

New Refinements of the McKay Conjecture for Arbitrary Finite Groups

2004

Let $G$ be an arbitrary finite group and fix a prime number $p$. The McKay conjecture asserts that $G$ and the normalizer in $G$ of a Sylow $p$-subgroup have equal numbers of irreducible characters with degrees not divisible by $p$. The Alperin-McKay conjecture is a version of this as applied to individual Brauer $p$-blocks of $G$. We offer evidence that perhaps much stronger forms of both of these conjectures are true.

Finite groupConjecture20C15Sylow theoremsPrime numberGroup Theory (math.GR)Centralizer and normalizerCollatz conjectureCombinatoricsMathematics::Group TheoryMathematics (miscellaneous)Character (mathematics)Symmetric groupFOS: MathematicsStatistics Probability and UncertaintyMathematics::Representation TheoryMathematics - Group TheoryMathematicsThe Annals of Mathematics
researchProduct

Formal Group Laws for Affine Kac-Moody groups and group quantization

1987

We describe a method for obtaining Formal Group Laws from the structure constants of Affine Kac-Moody groups and then apply a group manifold quantization procedure which permits construction of physical representations by using only canonical structures on the group. As an intermediate step we get an explicit expression for two-cocycles on Loop Groups. The programme is applied to the AffineSU(2) group.

Group (mathematics)Formal groupStatistical and Nonlinear Physics17B6758D05Group representationAlgebra81D07Affine representationSymmetric groupUnitary groupLawAffine group22E65Mathematical PhysicsMathematicsSchur multiplierCommunications in Mathematical Physics
researchProduct

Trace cocharacters and the Kronecker products of Schur functions

2003

Abstract It follows from the theory of trace identities developed by Procesi and Razmyslov that the trace cocharacters arising from the trace identities of the algebra Mr(F) of r×r matrices over a field F of characteristic zero are given by TCr,n=∑λ∈Λr(n)χλ⊗χλ where χλ⊗χλ denotes the Kronecker product of the irreducible characters of the symmetric group associated with the partition λ with itself and Λr(n) denotes the set of partitions of n with r or fewer parts, i.e. the set of partitions λ=(λ1⩽⋯⩽λk) with k⩽r. We study the behavior of the sequence of trace cocharacters TCr,n. In particular, we study the behavior of the coefficient of χ(ν,n−m) in TCr,n as a function of n where ν=(ν1⩽⋯⩽νk) i…

Kronecker productCombinatoricssymbols.namesakeAlgebra and Number TheorySymmetric groupKronecker deltasymbolsPartition (number theory)Mathematics
researchProduct

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

2007

Abstract 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 present 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 of isomorphic summands, then its dimension is bounded in terms of m . We prove that this is true for every finite group if it is true for the symmetric groups. The problem for symmetric groups reduces to an explicitly stated question in number theory or combinatorics.

Mathematics(all)Modular representation theoryPure mathematicsFinite groupBrauer's Problem 1Group (mathematics)General MathematicsCharacter degreesCombinatoricsRepresentation theory of the symmetric groupGroup of Lie typeSymmetric groupSimple groupGroup algebraFinite groupRepresentation theory of finite groupsMathematicsAdvances in Mathematics
researchProduct