Related papers: A Proof of Solomon's Rule

This paper provides a new version of matrix semi-tensor product method based on adjacent transpositions to test symmetric games. The advantage of using adjacent transpositions lies in the great simplification of analysis of symmetric games.…

Descent algebras of graded bialgebras were introduced by F. Patras as a generalization of Solomon's descent algebras for Coxeter groups of type $A$, i.e. symmetric groups. The universal enveloping algebra of the free Lie algebra on a…

Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…

For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2. We then use the constructed invariants to describe the…

We investigate products of certain double cosets for the symmetric group and use the findings to derive some multiplication formulas for q-Schur superalgebras. This gives a combinatorialisation of the relative norm approach developed by the…

We present a formula for the trace of any symmetric power of a $n\times n$ matrix (with coefficients in a field) in terms of the ordinary powers of the matrix, an arbitrarily chosen linear function which vanishes on the identity matrix, and…

The descent algebra of a finite Coxeter group W is a subalgebra of the group algebra defined by Solomon. Descent algebras of symmetric groups have properties that are not shared by other Coxeter groups. For instance, the natural map from…

We propose an analogue of Solomon's descent theory for the case of a wreath product G ~ S_n, where G is a finite abelian group. Our construction mixes a number of ingredients: Mantaci-Reutenauer algebras, Specht's theory for the…

This paper proves explicit formulas for the number of dissections of a convex regular polygon modulo the action of the cyclic and dihedral groups. The formulas are obtained by making use of the Cauchy-Frobenius Lemma as well as bijections…

The Murnaghan--Nakayama rule is a combinatorial rule for the character values of symmetric groups. We give a new combinatorial proof by explicitly finding the trace of the representing matrices in the standard basis of Specht modules. This…

The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…

We provide a matrix-based formula for the Tutte symmetric function of a graph. In particular, for any graph $G$ with a designated head and tail vertex, we describe an infinite matrix $M_G$ from which the Tutte symmetric function can be…

We consider a special symmetric matrix and obtain a similar formula as the one obtained by Weyl's criterion. Some applications of the formula are given, where we give a new way to calculate the integral of $\ln\Gamma(x)$ on $[0,1]$, and we…

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…

In these notes we present a closed-formula solution to the problem of decomposing traces of Lie algebra generators into symmetrized traces and structure constants. The solution is written in terms of Solomon idempotents and exploits a…

We derive a formula for the entries in the change-of-basis matrix between Young's seminormal and natural representations of the symmetric group. These entries are determined as sums over weighted paths in the weak Bruhat graph on standard…

In this paper we extend the idea of integration to generic algebras. In particular we concentrate over a class of algebras, that we will call self-conjugated, having the property of possessing equivalent right and left multiplication…

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…

The subgroup pattern of a finite groups $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we present an algorithm for the computation of the subgroup…

It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of $k$ cycles of given lengths has a very simple formula: it is $n^{k-1}$ where $n$ is the rank of the underlying symmetric group…