Related papers: A Proof of Solomon's Rule

Given a finite group G, we address the following question: which multiples of the trivial representation are linear combinations of inductions of trivial representations from proper subgroups of G? By Solomon's induction theorem, all…

We prove Levinson's theorem for scattering on an (m+n)-vertex graph with n semi-infinite paths each attached to a different vertex, generalizing a previous result for the case n=1. This theorem counts the number of bound states in terms of…

In this paper, we establish an explicit isomorphism between the symmetric group algebra and the path algebra of the Young graph. Specifically, we construct a family of matrix units in the group algebra. As a main application of this…

Galois/monodromy groups attached to parametric systems of polynomial equations provide a method for detecting the existence of symmetries in solution sets. Beyond the question of existence, one would like to compute formulas for these…

Let $\mathcal{N}[k]$ be the multiset containing the $\binom{n-1}{k}$ products of $k$-subsets of $\{1,\ldots, n-1\}$. We show that if $n\geq (2c+3)^2$, then \begin{gather*}\left((-1)^c+\sum_{M\in \mathcal{N}[n-1-c]}M\right)\cdot(c+1)\equiv…

Let $G$ be a finite nilpotent group and $n\in \{3,4, 5\}$. Consider $S_n\times G$ as a subgroup of $S_n\times S_{|G|}\subset S_{n|G|}$, where $G$ embeds into the second factor of $S_n\times S_{|G|}$ via the regular representation. Over any…

The paper is devoted to the study of some well-knonw combinatorial functions on the symmetric group $\sn$ --- the major index $\maj$, the descent number $\des$, and the inversion number $\inv$ --- from the representation-theoretic point of…

In this paper we give a Casimir Invariant for the Symmetric group $S_n$. Furthermore we obtain and present, for the first time in the literature, explicit formulas for the matrices of the standard representation in terms of the matrices of…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

In a recent paper we claimed that both the group algebra of a finite Coxeter group $W$ as well as the Orlik-Solomon algebra of $W$ can be decomposed into a sum of induced one-dimensional representations of centralizers, one for each…

In this paper, we use the idempotent decomposition to give an explicit isomorphism from an arbitrary semisimple Artinian ring to an external direct sum of finitely many full matrix rings over division rings.

In 2003, Cohn and Umans proposed a group-theoretic approach to bounding the exponent of matrix multiplication. Previous work within this approach ruled out certain families of groups as a route to obtaining $\omega = 2$, while other…

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

In this article we continue to develop the theory of generating symmetries for integrable equations. A technique for computation of generating symmetries using Maple is presented. The technique is based on the standard symmetry method. By…

In 1961, Solomon gave upper and lower bounds for the sum of all the entries in the character table of a finite group in terms of elementary properties of the group. In a different direction, we consider the ratio of the character table sum…

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

We extend to several combinatorial Hopf algebras the endomorphism of symmetric functions sending the first power-sum to zero and leaving the other ones invariant. As a transformation of alphabets, this is the (1-E)-transform, where E is the…

We propose a framework to prove Malle's conjecture for the compositum of two number fields based on proven results of Malle's conjecture and good uniformity estimates. Using this method we can prove Malle's conjecture for $S_n\times A$ over…

It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least $n^2$ arithmetic operations. The justification builds upon the following reasoning: given that there are $2 n^2$…

We provide a novel tool which may be used to construct new examples of positive maps in matrix algebras (or, equivalently, entanglement witnesses). It turns out that this can be used to prove positivity of several well known maps (such as…