We prove an explicit formula for the number of $n \times n$ upper triangular matrices, over $GF(q)$, whose square is the zero matrix. This formula was recently conjectured by Sasha Kirillov and Anna Melnikov[KM].
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular triangular matrices A such that A and A^{-1} have the same zero-nonzero pattern are characterized. A combinatorial construction is given to construct outer inverses of the adjacency matrix of a weighted tree.
The set of n by n upper-triangular nilpotent matrices with entries in a finite field F_q has Jordan canonical forms indexed by partitions lambda of n. We present a combinatorial formula for computing the number F_λ(q) of matrices of Jordan type lambda as a weighted sum over standard Young tableaux. We also study a connection between these matrices and non-attacking rook placements, which leads to a refinement of the formula for F_λ(q).
This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics on these structures under this bijection and prove that some of these statistics are equidistributed. Several special classes of matrices are shown to have simple formulations in terms of ascent sequences. Binary matrices are shown to correspond to ascent sequences with no two adjacent entries the same. Bidiagonal matrices are shown to be related to order-co…
We give an easy algorithm which calculates the generating function of the cocharacter sequence of the T-ideal of the polynomial identities of the algebra of upper triangular matrices over a field of characteristic zero. Applying this algorithm we have found the explicit form of the multiplicities in two cases: (i) for the "largest" partitions; (ii) for matrices of small size and for all partitions.
We give an algorithm which calculates the generating function of the cocharacter sequence of the polynomial identities of the algebra of upper block triangular (p+2q) x (p+2q) matrices over a field of characteristic zero with diagonal consisting of p copies of 1 x 1 and q copies of 2 x 2 matrices. We have found the explicit form of the multiplicities and their asymptotic behaviour for small values of p and q.
We study the combinatorial description of the LDU decomposition of totally positive matrices. We give a description of the lower triangular L, the diagonal D, and the upper triangular U matrices of the LDU decomposition of totally positive matrices in terms of the combinatorial structure of essential planar networks described by Zelvinsky and Fomin. Similarly, we find a combinatorial description of the inverses of these matrices. In addition, we provide recursive formulae for computing the L, D, and U matrices of a totally positive matrix.
This paper uses the combinatorics of Young tableaux to prove the plactic monoid of infinite rank does not satisfy a non-trivial identity, by showing that the plactic monoid of rank $n$ cannot satisfy a non-trivial identity of length less than or equal to $n$. A new identity is then proven to hold for the monoid of $n \times n$ upper-triangular tropical matrices. Finally, a straightforward embedding is exhibited of the plactic monoid of rank $3$ into the direct product of two copies of the monoid of $3\times 3$ upper-triangular tropical matrices, giving a new proof that the plactic monoid of ra…
It is becoming increasingly clear that the supercharacter theory of the finite group of unipotent upper-triangular matrices has a rich combinatorial structure built on set-partitions that is analogous to the partition combinatorics of the classical representation theory of the symmetric group. This paper begins by exploring a connection to the ring of symmetric functions in non-commuting variables that mirrors the symmetric group's relationship with the ring of symmetric functions. It then also investigates some of the representation theoretic structure constants arising from the restriction, …
Fix a nonnegative integer $d$, a field $\mathbb{F}$, and a vector space $V$ over $\mathbb{F}$ with dimension $d+1$. Let $T$ denote an invertible upper triangular matrix in ${\rm Mat}_{d+1}(\mathbb{F})$. Using $T$ we construct three flags on $V$. We find a necessary and sufficient condition on $T$ for these three flags to be totally opposite. In this case, we use these three totally opposite flags to construct a Billiard Array $B$ on $V$. It is known that $B$ is determined up to isomorphism by a certain triangular array of scalar parameters called the $B$-values. We compute these $B$-values in …
Consider the random walk on the $n \times n$ upper triangular matrices with ones on the diagonal and elements over $\mathbb{F}_p$ where we pick a row at random and either add it or subtract it from the row directly above it. The main result of this paper is to prove that the dependency of the mixing time on $p$ is $p^2$. This is proven by combining super-character theory and comparison theory arguments.
We study Falconer's subadditive pressure function with emphasis on analyticity. We begin by deriving a simple closed form expression for the pressure in the case of diagonal matrices and, by identifying phase transitions with zeros of Dirichlet polynomials, use this to deduce that the pressure is piecewise real analytic. We then specialise to the iterated function system setting and use a result of Falconer and Miao to extend our results to include the pressure for systems generated by matrices which are simultaneously triangularisable. Our closed form expression for the pressure simplifies a …
The space of $L^p$ graphons, symmetric measurable functions $w: [0,1]^2 \to \mathbb{R}$ with finite $p$-norm, features heavily in the study of sparse graph limit theory. We show that the triangular cut operator $M_χ$ acting on this space is not continuous with respect to the cut norm. This is achieved by showing that as $n\to \infty$, the norm of the triangular truncation operator $\mathcal{T}_n$ on symmetric matrices equipped with the cut norm grows to infinity as well. Due to the density of symmetric matrices in the space of $L^p$ graphons, the norm growth of $\mathcal{T}_n$ generalizes to t…
A trivially zero minor of a matrix is a minor having all its terms in the Leibniz formula equal to zero. A matrix is superregular if all of its minors that are not trivially zero are nonzero. In the area of Coding Theory, superregular matrices over finite fields are connected with codes with optimum distance proprieties. When a superregular matrix has all its entries nonzero, it is called full superregular and these matrices are used to construct Maximum Distance Separable block codes. In the context of convolutional codes, lower triangular Toeplitz superregular matrices are employed to build …
We study the chromatic polynomial P_G(q) for m \times n triangular-lattice strips of widths m <= 12_P, 9_F (with periodic or free transverse boundary conditions, respectively) and arbitrary lengths n (with free longitudinal boundary conditions). The chromatic polynomial gives the zero-temperature limit of the partition function for the q-state Potts antiferromagnet. We compute the transfer matrix for such strips in the Fortuin--Kasteleyn representation and obtain the corresponding accumulation sets of chromatic zeros in the complex q-plane in the limit n\to\infty. We recompute the limiting cur…