Related papers: A Proof of Solomon's Rule

Here we give a combinatorial interpretation of Solomon's rule for multiplication in the descent algebra of Weyl groups of type $D$, $\Sigma D_n$. From here we show that $\Sigma D_n$ is a homomorphic image of the descent algebra of the…

We show how to construct highly symmetric algorithms for matrix multiplication. In particular, we consider algorithms which decompose the matrix multiplication tensor into a sum of rank-1 tensors, where the decomposition itself consists of…

This paper introduces an analogue of the Solomon descent algebra for the complex reflection groups of type $G(r,1,n)$. As with the Solomon descent algebra, our algebra has a basis given by sums of `distinguished' coset representatives for…

A fundamental result by L. Solomon in algebraic combinatorics and representation theory states that Mackey formulas for products of characters of a symmetric group, or equivalently the computation of tensor products of representations…

We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…

Louis Solomon showed that the group algebra of the symmetric group $\mathfrak{S}_{n}$ has a subalgebra called the descent algebra, generated by sums of permutations with a given descent set. In fact, he showed that every Coxeter group has…

The number of alternating runs is a natural permutation statistic. We show it can be used to define some commutative subalgebras of the symmetric group algebra, and more precisely of the descent algebra. The Eulerian peak algebras naturally…

The faces of the braid arrangement form a monoid. The associated monoid algebra -- the face algebra -- is well-studied, especially in relation to card shuffling and other Markov chains. In this paper, we explore the action of the symmetric…

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

Introduced by Solomon, the descent algebra is a significant subalgebra of the group algebra of the symmetric group $\mathbf{k}S_n$ related to many important algebraic and combinatorial topics. It contains all the classical Lie idempotents…

It is a classical result in matrix algebra that any square matrix over a field can be conjugated to its transpose by a symmetric matrix. For $F$ a non-Archimedean local field, Tupan used this to give an elementary proof that transpose…

Let $V$ be an $r$-dimensional vector space over an infinite field $F$ of prime characteristic $p$, and let $L_n(V)$ denote the $n$-th homogeneous component of the free Lie algebra on $V$. We study the structure of $L_n(V)$ as a module for…

Recently in graph theory several authors have studied the spectrum of the Cayley graph of the symmetric group S_n generated by the transpositions (1, i) for 2 <= i <= n. Several conjectures were made and partial results were obtained. The…

We consider the group algebra of the symmetric group as a superalgebra, and describe its Lie subsuperalgebra generated by the transpositions. The updated version corrects some of the arguments made in Sections 4.5 - 4.7. The statements of…

We prove a sharp upper bound on the number of distinct columns of a totally unimodular matrix with column sums $1$ improving upon Heller's classical bound. The proof uses Seymour's decomposition theorem. Such matrices are closely related to…

We develop a new, group-theoretic approach to bounding the exponent of matrix multiplication. There are two components to this approach: (1) identifying groups G that admit a certain type of embedding of matrix multiplication into the group…

A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…

Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…

In the local, characteristic 0, non archimedean case, we consider distributions on GL(n+1) which are invariant under the adjoint action of GL(n). We prove that such distributions are invariant by transposition. This implies that an…

In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the…