Results 41 to 50 of about 15,374,978 (303)

FOULKES MODULES AND DECOMPOSITION NUMBERS OF THE SYMMETRIC GROUP [PDF]

open access: yes, 2013
The decomposition matrix of a finite group in prime characteristic p records the multiplicities of its p-modular irreducible representations as composition factors of the reductions modulo p of its irreducible representations in characteristic zero.
E. Giannelli, M. Wildon
semanticscholar   +1 more source

A survey on projectively equivalent representations of finite groups [PDF]

open access: yesSurveys in Mathematics and its Applications, 2020
The paper is a survey type article in which we present some results on projectively equivalent representations of finite groups.
Tania Luminiţa Costache
doaj  

Symmetric difference in abelian groups [PDF]

open access: yesPacific 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

On double cosets with the trivial intersection property and Kazhdan-Lusztig cells in S n [PDF]

open access: yesInternational Journal of Group Theory, 2015
For a composition λ of n our aim is to obtain reduced forms ‎for all the elements in the Kazhdan-Lusztig (right) cell containing ‎w J(λ) ‎, ‎the longest element of the standard parabolic‎ ‎subgroup of S n corresponding to λ ‎.
Thomas P. McDonough   +1 more
doaj  

On proximal fineness of topological groups in their right uniformity

open access: yesApplied General Topology, 2019
A uniform space X is said to be proximally fine if every proximally continuous function defined on X into an arbitrary uniform pace Y is uniformly continuous.
Ahmed Bouziad
doaj   +1 more source

The representation of the symmetric group on m-Tamari intervals [PDF]

open access: yes, 2012
An m-ballot path of size n is a path on the square grid consisting of north and east unit steps, starting at (0;0), ending at (mn;n), and never going below the line fx = myg.
M. Bousquet-M'elou   +2 more
semanticscholar   +1 more source

Combinatorial Gelfand Models [PDF]

open access: yesDiscrete 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

Minimal Factorizations of Permutations into Star Transpositions [PDF]

open access: yesDiscrete 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

Spectrum of Cayley graphs on the symmetric group generated by transpositions [PDF]

open access: yes, 2012
For an integer n ⩾ 2 , let X n be the Cayley graph on the symmetric group S n generated by the set of transpositions { ( 12 ) , ( 13 ) , … , ( 1 n ) } . It is shown that the spectrum of X n contains all integers from - ( n - 1 ) to n - 1 (except 0 if n =
Roi Krakovski, B. Mohar
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy