Related papers: Matrices, Characters and Descents
We find the spectrum of the Walsh-Hadamard type matrices defined by R.Adin and Y.Roichman in their recent work on character formulas and descent sets for the symmetric group.
A general setting to study a certain type of formulas, expressing characters of the symmetric group $\mathfrak{S}_n$ explicitly in terms of descent sets of combinatorial objects, has been developed by two of the authors. This theory is…
We give a new formula for the values of an irreducible character of the symmetric group S_n indexed by a partition of rectangular shape. Some observations and a conjecture are given concerning a generalization to arbitrary shapes.
In this investigation of character tables of finite groups we study basic sets and associated representation theoretic data for complementary sets of conjugacy classes. For the symmetric groups we find unexpected properties of characters on…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
The theory of matrix models is reviewed from the point of view of its relation to integrable hierarchies. Discrete 1-matrix, 2-matrix, ``conformal'' (multicomponent) and Kontsevich models are considered in some detail, together with the…
In this article we present a new characterization of inverse M-matrices, inverse row diagonally dominant M-matrices and inverse row and column diagonally dominant M-matrices, based on the positivity of certain inner products.
By exploiting relationships between the values taken by ordinary characters of symmetric groups we prove two theorems in the modular representation theory of the symmetric group. 1. The decomposition matrices of symmetric groups in odd…
We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…
Eigenvectors associated with non-degenerate eigenvalues are shown to correspond to columns of the adjugate of the characteristic matrix. Degenerate eigenvalues are associated with eigenvectors that correspond to reduced complement tensors…
It is well known that many problems in interval computation are intractable, which restricts our attempts to solve large problems in reasonable time. This does not mean, however, that all problems are computationally hard. Identifying…
The irreducible characters of the symmetric group are a symmetric polynomial in the eigenvalues of a permutation matrix. They can therefore be realized as a symmetric function that can be evaluated at a set of variables and form a basis of…
We prove an identity conjectured by Adin and Roichman involving the descent set of $\lambda$-unimodal cyclic permutations. These permutations appear in formulas for characters of certain representations of the symmetric group. Such formulas…
A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.
This article gives a new matrix function named "twisted immanant," which can be regarded as an analogue of the immanant. This is defined for each self-conjugate partition through a "twisted" analogue of the irreducible character of the…
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
We determine the eigenvalues with multiplicity of each element of an alternating group in any irreducible representation. This is equivalent to determining the decomposition of cyclic representations of alternating groups into irreducibles.…
In math.CO/0109093 the author obtained a formula for the value of an irreducible symmetric group character indexed by a partition of rectangular shape. In the present paper this formula is (conjecturally) generalized to arbitrary shapes.
We recently introduced the notion of an idempotent system. This linear algebraic object is motivated by the structure of an association scheme. There is a type of idempotent system, said to be symmetric. In the present paper we classify up…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…