Results 11 to 20 of about 1,034,541 (233)
Combinatorial Gelfand Models [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 A combinatorial construction of Gelfand models for the symmetric group, for its Iwahori-Hecke algebra and for the hyperoctahedral group is presented.
Ron M. Adin +2 more
doaj +1 more source
Symmetric groups and expanders [PDF]
Electronic Research Announcements of the American Mathematical Society, 2005 We construct explicit generating sets F n F_n and F ~ n \tilde F_n of the alternating and the symmetric groups, which turn the Cayley graphs C ( A l t (
openaire +3 more sources
Geometry of configurations in tangent groups
AIMS Mathematics, 2020 This article relates the Grassmannian complexes of geometric configurations to the tangent to the Bloch-Suslin complex and to the tangent to Goncharov’s motivic complex. By means of morphisms, we bring the geometry of configurations in tangent groups, $T\
Raziuddin Siddiqui
doaj +1 more source
Minimal Factorizations of Permutations into Star Transpositions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form $(1 i)$. Our result generalizes earlier work of Pak ($\textit{Reduced decompositions of permutations in terms of star ...
J. Irving, A. Rattan
doaj +1 more source
Symmetric difference in abelian groups [PDF]
Pacific Journal of Mathematics, 1978 A groupoid 21 = ζA; *> is called a left (resp. right) difference group if there is a binary operation + in A such that the system is an abelian group and x*y — —x + y (resp. x * y = x ~ y). A symmetric difference group is a groupoid satisfying all the identities common to both left and right difference groups.
Grätzer, G., Padmanabhan, R.
openaire +2 more sources
The Symmetric Group Defies Strong Fourier Sampling [PDF]
, 2008 The dramatic exponential speedups of quantum algorithms over their best existing classical counterparts were ushered in by the technique of Fourier sampling, introduced by Bernstein and Vazirani and developed by Simon and Shor into an approach to the ...
Moore, Christopher +2 more
core +2 more sources
The Bruhat order on conjugation-invariant sets of involutions in the symmetric group [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 12 pages, 3 ...
Mikael Hansson
doaj +1 more source
Comparison of Gelfand-Tsetlin Bases for Alternating and Symmetric Groups [PDF]
, 2017 Young's orthogonal basis is a classical basis for an irreducible representation of a symmetric group. This basis happens to be a Gelfand-Tsetlin basis for the chain of symmetric groups. It is well-known that the chain of alternating groups, just like the
Geetha, T., Prasad, Amritanshu
core +1 more source
Long Cycle Factorizations: Bijective Computation in the General Case [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 This paper is devoted to the computation of the number of ordered factorizations of a long cycle in the symmetric group where the number of factors is arbitrary and the cycle structure of the factors is given. Jackson (1988) derived the first closed form
Ekaterina A. Vassilieva
doaj +1 more source
Number of terms in the group determinant
Examples and Counterexamples, 2023 In this paper, we prove that when the number of terms in the group determinant of order odd prime p is divided by p, the remainder is 1. In addition, we give a table of the number of terms in kth power of the group determinant of the cyclic group of ...
Naoya Yamaguchi, Yuka Yamaguchi
doaj +1 more source