Generic common minor expansions

A classical variation on the Laplace expansion theorem relates the product of the determinant of a matrix and one of its fixed submatrices to an expansion by minors. This paper explores the extensions of this highly combinatorial result to generic matrix functions. The principal tool is the shuffle product. These ideas are used to extend the corresponding classical results for determinants and to study the case of permanents. An application is given to the problem of characterizing the actions (as differential operators) of exterior powers of the classical Cayley operators. The resulting identities involve hook length products of frames of integral partitions and generalize classical results of Cayley concerning the action of determinantal differential operators on polynomial functions of generic determinants.     

Spectral asymptotics for Kac–Murdock–Szegő matrices

Szeg?’s First Limit Theorem provides the limiting statistical distribution of the eigenvalues of large Toeplitz matrices. Szeg?’s Second (or Strong) Limit Theorem for Toeplitz matrices gives a second order correction to the First Limit Theorem, and allows one to calculate asymptotics for the determinants of large Toeplitz matrices. In this paper we survey results extending the First and Second Limit Theorems to Kac–Murdock–Szeg? (KMS) matrices. These are matrices whose entries along the diagonals are not necessarily constants, but modeled by functions. We clarify and extend some existing results, and explain some apparently contradictory results in the literature.     

Minimum Permanents of Tridiagonal Doubly Stochastic Matrices

We determine the minimum permanents and minimizing matrices of the tridiagonal doubly stochastic matrices and of certain doubly stochastic matrices with prescribed zero entries.     

Minimum Permanents of Tridiagonal Doubly Stochastic Matrices

We determine the minimum permanents and minimizing matrices of the tridiagonal doubly stochastic matrices and of certain doubly stochastic matrices with prescribed zero entries.     

Calculating the Lyapunov exponent for generalized linear systems with exponentially distributed elements of the transition matrix

A stochastic dynamic system of second order is considered. The system evolution is described by a dynamic equation with a stochastic transition matrix, which is linear in the idempotent algebra with operations of maximum and addition. It is assumed that some entries of the matrix are zero constants and all other entries are mutually independent and exponentially distributed. The problem considered is the computation of the Lyapunov exponent, which is defined as the average asymptotic rate of growth of the state vector of the system. The known results related to this problem are limited to systems whose matrices have zero off-diagonal entries. In the cases of matrices with a zero row, zero diagonal entries, or only one zero entry, the Lyapunov exponent is calculated using an approach which is based on constructing and analyzing a certain sequence of one-dimensional distribution functions. The value of the Lyapunov exponent is calculated as the average value of a random variable determined by the limiting distribution of this sequence.     

Non-denseness of factorable matrix functions

It is proved that for certain algebras of continuous functions on compact abelian groups, the set of factorable matrix functions with entries in the algebra is not dense in the group of invertible matrix functions with entries in the algebra, assuming that the dual abelian group contains a subgroup isomorphic to Z³. These algebras include the algebra of all continuous functions and the Wiener algebra. More precisely, it is shown that infinitely many connected components of the group of invertible matrix functions do not contain any factorable matrix functions, again under the same assumption. Moreover, these components actually are disjoint with the subgroup generated by the triangularizable matrix functions.     

Computing permanents via determinants for some classes of sparse matrices

Starting from recent formulas for calculating the permanents of some sparse circulant matrices, we obtain more general formulas expressing the permanents of a wider class of matrices as a linear combination of appropriate determinants.     

Enumeration of symmetry classes of alternating sign matrices and characters of classical groups

An alternating sign matrix is a square matrix with entries 1, 0 and −1 such that the sum of the entries in each row and each column is equal to 1 and the nonzero entries alternate in sign along each row and each column. To some of the symmetry classes of alternating sign matrices and their variations, G. Kuperberg associate square ice models with appropriate boundary conditions, and give determinant and Pfaffian formulae for the partition functions. In this paper, we utilize several determinant and Pfaffian identities to evaluate Kuperberg's determinants and Pfaffians, and express the round partition functions in terms of irreducible characters of classical groups. In particular, we settle a conjecture on the number of vertically and horizontally symmetric alternating sign matrices (VHSASMs). Dedicated to the memory of David Robbins.     

Pseudospectra of isospectrally reduced matrices

An isospectral matrix reduction is a procedure that reduces the size of a matrix while maintaining its eigenvalues up to a known set. As to not violate the fundamental theorem of algebra, the reduced matrices have rational functions as entries. Because isospectral reductions can preserve the spectrum of a matrix, they are fundamentally different from say the restriction of a matrix to an invariant subspace. We show that the notion of pseudospectrum can be extended to a wide class of matrices with rational function entries and that the pseudospectrum of such matrices shrinks with isospectral reductions. Hence, the eigenvalues of a reduced matrix are more robust to entry‐wise perturbations than the eigenvalues of the original matrix. Moreover, the isospectral reductions considered here are more general than those considered elsewhere. We also introduce the notion of an inverse pseudospectrum (or pseudoresonances), which indicates how stable the poles of a rational function valued matrix are to entry‐wise perturbations. Illustrations of these concepts are given for mass‐spring networks. Copyright © 2014 John Wiley & Sons, Ltd.     

Limit theorems for random permanents with exchangeable structure

Permanents of random matrices extend the concept of U-statistics with product kernels. In this paper, we study limiting behavior of permanents of random matrices with independent columns of exchangeable components. Our main results provide a general framework which unifies already existing asymptotic theory for projection matrices as well as matrices of all-iid entries. The method of the proofs is based on a Hoeffding-type orthogonal decomposition of a random permanent function. The decomposition allows us to relate asymptotic behavior of permanents to that of elementary symmetric polynomials based on triangular arrays of rowwise independent rv's.     

关于行列式计算的另类降阶法

由于二阶行列式的计算仅须求两对角线元素的乘积之差,所以计算非常简单．一般地,对高阶行列式求值,虽然可用Laplace展开公式或Gauss消去法,但是展开式会非常繁杂或计算量会很大．本文利用降阶原理,得到一种只需计算二阶行列式就可求出n（n≥3）阶方阵行列式值的另类方法．     

Matrix algebras with direct product

The algebra over an algebraically closed field K generated by the similarity classes of matrices with entries in a field k and with the operations of direct sum and direct (tensor) product proved to be semisimple.     

The Spectral Theory of Upper Triangular Matrices with Entries in a Banach Algebra

Assume that T is an upper triangular square matrix with entries in a unital Banach algebra. The main question studied here is: Under what conditions on the entries in T is it true that the spectrum of T is the union of the spectra of the diagonal entries of T? Also some results are proved concerning the Fredholm theroy of matrices with operator entries.     

Uniform diagonalisation of matrices over regular rings

The fundamental Separativity Problem for von Neumann regular rings is shown to be equivalent to a linear algebra problem: for a field F, is there a ``uniform formula' for diagonalising a matrix A over , independently of n? Here P and Q are required to be invertible matrices whose entries are fixed regular algebra expressions in the entries of A. Received July 10, 2000; accepted in final form September 26, 2000.     

Polynomial functions on upper triangular matrix algebras

There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras of upper triangular matrices over a commutative ring, we characterize the former in terms of the latter (which are easier to handle because of substitution homomorphism). We conclude that the set of integer-valued polynomials with matrix coefficients on an algebra of upper triangular matrices is a ring, and that the set of null-polynomials with matrix coefficients on an algebra of upper triangular matrices is an ideal.     

Circular law for random matrices with exchangeable entries

An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the uniform law on the unit disc. This is an instance of the universality phenomenon known as the circular law, for a model of random matrices with dependent entries, rows, and columns. It is also a non‐Hermitian counterpart of a result of Chatterjee on the semi‐circular law for random Hermitian matrices with exchangeable entries. The proof relies in particular on a reduction to a simpler model given by a random shuffle of a rigid deterministic matrix, on hermitization, and also on combinatorial concentration of measure and combinatorial Central Limit Theorem. A crucial step is a polynomial bound on the smallest singular value of exchangeable random matrices, which may be of independent interest. © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 48, 454–479, 2016     

Bounds for permanents and determinants

An inequality of Johnson and Newman for determinants of real matrices is extended to complex matrices. A related inequality for permanents of real matrices is improved by means of a new rearrangement theorem.     

Branching rules in the ring of superclass functions of unipotent upper-triangular matrices

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, tensor products and superinduction of supercharacters in this context.     

Minimal primes over permanental ideals

In this paper we discuss minimal primes over permanental ideals of generic matrices. We give a complete list of the minimal primes over ideals of permanents of a generic matrix, and show that there are monomials in the ideal of maximal permanents of a matrix if the characteristic of the ground field is sufficiently large. We also discuss the Alon-Jaeger-Tarsi Conjecture, using our results and techniques to strengthen the previously known results.