Criteria for the stability of the finiteness property and for the uniqueness of Barabanov norms

A set of matrices is said to have the finiteness property if the maximal rate of exponential growth of long products of matrices drawn from that set is realised by a periodic product. The extent to which the finiteness property is prevalent among finite sets of matrices is the subject of ongoing research. In this article, we give a condition on a finite irreducible set of matrices which guarantees that the finiteness property holds not only for that set, but also for all sufficiently nearby sets of equal cardinality. We also prove a theorem giving conditions under which the Barabanov norm associated to a finite irreducible set of matrices is unique up to multiplication by a scalar, and show that in certain cases these conditions are also persistent under small perturbations.     

Finiteness property of pairs of 2×2 sign-matrices via real extremal polytope norms

This paper deals with the joint spectral radius of a finite set of matrices. We say that a set of matrices has the finiteness property if the maximal rate of growth, in the multiplicative semigroup it generates, is given by the powers of a finite product.Here we address the problem of establishing the finiteness property of pairs of $2\times 2$ sign-matrices. Such problem is related to the conjecture that pairs of sign-matrices fulfil the finiteness property for any dimension. This would imply, by a recent result by Blondel and Jungers, that finite sets of rational matrices fulfil the finiteness property, which would be very important in terms of the computation of the joint spectral radius. The technique used in this paper could suggest an extension of the analysis to $n\times n$ sign-matrices, which still remains an open problem.As a main tool of our proof we make use of a procedure to find a so-called real extremal polytope norm for the set. In particular, we present an algorithm which, under some suitable assumptions, is able to check if a certain product in the multiplicative semigroup is spectrum maximizing.For pairs of sign-matrices we develop the computations exactly and hence are able to prove analytically the finiteness property. On the other hand, the algorithm can be used in a floating point arithmetic and provide a general tool for approximating the joint spectral radius of a set of matrices.     

Rational realization of the minimum ranks of nonnegative sign pattern matrices

A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set {+,?, 0} ({+, 0}, respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix A is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of A. Using a correspondence between sign patterns with minimum rank r ≥ 2 and point-hyperplane configurations in R^r?1 and Steinitz’s theorem on the rational realizability of 3-polytopes, it is shown that for every nonnegative sign pattern of minimum rank at most 4, the minimum rank and the rational minimum rank are equal. But there are nonnegative sign patterns with minimum rank 5 whose rational minimum rank is greater than 5. It is established that every d-polytope determines a nonnegative sign pattern with minimum rank d + 1 that has a (d + 1) × (d + 1) triangular submatrix with all diagonal entries positive. It is also shown that there are at most min{3m, 3n} zero entries in any condensed nonnegative m × n sign pattern of minimum rank 3. Some bounds on the entries of some integer matrices achieving the minimum ranks of nonnegative sign patterns with minimum rank 3 or 4 are established.     

Residuated Structures,Concentric Sums and Finiteness Conditions

This article is motivated by a concern with finiteness conditions on varieties of residuated structures—particularly residuated meet semilattice-ordered commutative monoids. A “concentric sum” construction is developed and is used to prove, among other results, a local finiteness theorem for a class that encompasses all n-potent hoops and all idempotent subdirect products of residuated chains. This in turn implies that a range of residuated lattice-based varieties have the finite embeddability property, whence their quasi-equational theories are decidable. Applications to substructural logics are discussed.     

Asymptotics of products of nonnegative random matrices

Asymptotic properties of products of random matrices ξ _k = X _k …X ₁ as k → ∞ are analyzed. All product terms X _i are independent and identically distributed on a finite set of nonnegative matrices A = {A ₁, …, A _m }. We prove that if A is irreducible, then all nonzero entries of the matrix ξ _k almost surely have the same asymptotic growth exponent as k→∞, which is equal to the largest Lyapunov exponent λ(A). This generalizes previously known results on products of nonnegative random matrices. In particular, this removes all additional “nonsparsity” assumptions on matrices imposed in the literature.We also extend this result to reducible families. As a corollary, we prove that Cohen’s conjecture (on the asymptotics of the spectral radius of products of random matrices) is true in case of nonnegative matrices.     

Nonnegative matrix semigroups with finite diagonals

Let S be a multiplicative semigroup of matrices with nonnegative entries. Assume that the diagonal entries of the members of S form a finite set. This paper is concerned with the following question: Under what circumstances can we deduce that S itself is finite?     

INERTIA SETS OF SYMMETRIC SIGN PATTERN MATRICES

1　IntroductionIn qualitative and combinatorial matrix theory,we study properties ofa matrix basedon combinatorial information,such as the signs of entries in the matrix.A matrix whoseentries are from the set{ + ,-,0 } is called a sign pattern matrix ( or sign pattern,or pat-tern) .We denote the setof all n× n sign pattern matrices by Qn.For a real matrix B,sgn( B) is the sign pattern matrix obtained by replacing each positive( respectively,negative,zero) entry of B by+ ( respectively,-,0 )…     

Counting matrices over finite fields with support on skew Young diagrams and complements of Rothe diagrams

We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook placements). For general sets of entries, these numbers of matrices are not polynomials in q (Stembridge in Ann. Comb. 2(4):365, 1998); however, when the set of entries is a Young diagram, the numbers, up to a power of q?1, are polynomials with nonnegative coefficients (Haglund in Adv. Appl. Math. 20(4):450, 1998). In this paper, we give a number of conditions under which these numbers are polynomials in q, or even polynomials with nonnegative integer coefficients. We extend Haglund’s result to complements of skew Young diagrams, and we apply this result to the case where the set of entries is the Rothe diagram of a permutation. In particular, we give a necessary and sufficient condition on the permutation for its Rothe diagram to be the complement of a skew Young diagram up to rearrangement of rows and columns. We end by giving conjectures connecting invertible matrices whose support avoids a Rothe diagram and Poincaré polynomials of the strong Bruhat order.     

Isospectral flow method for nonnegative inverse eigenvalue problem with prescribed structure

The nonnegative inverse eigenvalue problem is that given a family of complex numbers λ={λ₁,…,λ_n}, find a nonnegative matrix of order n with spectrum λ. This problem is difficult and remains unsolved partially. In this paper, we focus on its generalization that the reconstructed nonnegative matrices should have some prescribed entries. It is easy to see that this new problem will come back to the common nonnegative inverse eigenvalue problem if there is no constraint of the locations of entries. A numerical isospectral flow method which is developed by hybridizing the optimization theory and steepest descent method is used to study the reconstruction. Moreover, an error estimate of the numerical iteration for ordinary differential equations on the matrix manifold is presented. After that, a numerical method for the nonnegative symmetric inverse eigenvalue problem with prescribed entries and its error estimate are considered. Finally, the approaches are verified by the numerical test results.     

Torus-invariant prime ideals in quantum matrices, totally nonnegative cells and symplectic leaves

The algebra of quantum matrices of a given size supports a rational torus action by automorphisms. It follows from work of Letzter and the first named author that to understand the prime and primitive spectra of this algebra, the first step is to understand the prime ideals that are invariant under the torus action. In this paper, we prove that a family of quantum minors is the set of all quantum minors that belong to a given torus-invariant prime ideal of a quantum matrix algebra if and only if the corresponding family of minors defines a non-empty totally nonnegative cell in the space of totally nonnegative real matrices of the appropriate size. As a corollary, we obtain explicit generating sets of quantum minors for the torus-invariant prime ideals of quantum matrices in the case where the quantisation parameter q is transcendental over ${\mathbb{Q}}$ .     

Weak ergodicity and products of random matrices

A representation for a weakly ergodic sequence of (nonstochastic) matrices allows products of nonnegative matrices which eventually become strictly positive to be expressed via products of some associated stochastic matrices and ratios of values of a certain function. This formula used in a random setup leads to a representation for the logarithm of a random matrix product. If the sequence of random matrices is in addition stationary then automatically almost all sequences are weakly ergodic, and the representation is expressed in terms of an one-dimensional stationary process. This permits properties of products of random matrices to be deduced from the latter. Second moment assumptions guarantee that central limit theorems and laws of the iterated logarithm hold for the random matrix products if and only if they hold for the corresponding stationary process. Finally, a central limit theorem for some classes of weakly dependent stationary random matrices is derived doing away with the restriction of boundedness of the ratios of colum entries assumed by previous studies. Extensions beyond stationarity are discussed.     

Strongly nonatomic densities defined by certain matrices

Drewnowski and Paúl proved about ten years ago that for any strongly nonatomic submeasure η on the power set P(?) of the set ? of all natural numbers the ideal of all null sets of η has the Nikodym property (NP). They stated the problem whether the converse is true in general. By presenting an example, Alon, Drewnowski and ?uczak proved recently that the answer is negative. Nevertheless, it is of mathematical interest to identify classes of submeasures η such that η is strongly nonatomic if and only if the set of all null sets of η has the Nikodym property. In this context, the authors proved some years ago that this equivalence holds, for instance, if one restricts the attention to the case of densities defined by regular Riesz matrices or by nonnegative regular Hausdorff methods. Also sufficient and necessary conditions in terms of the matrix coefficients are given, that the defined density is strongly nonatomic. In this paper we extend these investigations to the class of generalized Riesz matrices, introduced by Drewnowski, Florencio and Paúl in 1994.     

A finiteness theorem for W-graphs

A W-graph for a Coxeter group W is a combinatorial structure that encodes a module for the group algebra of W, or more generally, a module for the associated Iwahori–Hecke algebra. Of special interest are the W-graphs that encode the action of the Hecke algebra on its Kazhdan–Lusztig basis, as well as the action on individual cells. In previous work, we isolated a few basic features common to the W-graphs in Kazhdan–Lusztig theory and used these to define the class of “admissible” W-graphs. The main result of this paper resolves one of the basic question about admissible W-graphs: there are only finitely many admissible W-cells (i.e., strongly connected admissible W-graphs) for each finite Coxeter group W. Ultimately, the finiteness depends only on the fact that admissible W-graphs have nonnegative integer edge weights. Indeed, we formulate a much more general finiteness theorem for “cells” in finite-dimensional algebras which in turn is fundamentally a finiteness theorem for nonnegative integer matrices satisfying a polynomial identity.     

Generalizing pairs of complementary sequences and a construction of combinatorial structures

Pairs of complementary sequences such as Golay pairs have zero sum autocorrelation at all non-trivial phases. Several generalizations are known where conditions on either the autocorrelation function, or the entries of the sequences are altered. We aim to unify most of these ideas by introducing autocorrelation functions that apply to any sequences with entries in a set equipped with a ring-like structure which is closed under multiplication and contains multiplicative inverses. Depending on the elements of the chosen set, the resulting complementary pairs may be used to construct a variety of combinatorial structures such as Hadamard matrices, complex generalized weighing matrices, and signed group weighing matrices. We may also construct quasi-cyclic and quasi-constacyclic linear codes which over finite fields of order less than 5 are also Hermitian self-orthogonal. As the literature on binary and ternary Golay sequences is already quite deep, one intention of this paper is to survey and assimilate work on more general pairs of complementary sequences and related constructions of combinatorial objects, and to combine the ideas into a single theoretical framework.     

Drazin-monotonicity characterizations for property-n matrices

A square matrix A is said to have property n if there exists a nonnegative power of A. In this paper, necessary and sufficient conditions for such matrices to have a nonnegative Drazin inverse are presented.     

Intrinsic products and factorizations of matrices

We say that the product of a row vector and a column vector is intrinsic if there is at most one nonzero product of corresponding coordinates. Analogously we speak about intrinsic product of two or more matrices, as well as about intrinsic factorizations of matrices. Since all entries of the intrinsic product are products of entries of the multiplied matrices, there is no addition. We present several examples, together with important applications. These applications include companion matrices and sign-nonsingular matrices.     

Nonnegative rank-preserving operators

Analogues of characterizations of rank-preserving operators on field-valued matrices are determined for matrices witheentries in certain structures $\text{S}$ contained in the nonnegative reals. For example, if $\text{S}$ is the set of nonnegative members of a real unique factorization domain (e.g. the nonnegative reals or the nonnegative integers), M is the set of m×n matrices with entries in $\text{S}$, and min(m,n)?4, then a “linear” operator on M preserves the “rank” of each matrix in M if and only if it preserves the ranks of those matrices in M of ranks 1, 2, and 4. Notions of rank and linearity are defined analogously to the field-valued concepts. Other characterizations of rank-preserving operators for matrices over these and other structures $\text{S}$ are also given.     

Sylow 2-subgroups of rational solvable groups

A long-standing conjecture proposes that a Sylow 2-subgroup S of a finite rational group must be rational. In this paper we provide a counterexample to this conjecture, but we show that if G is solvable and S has nilpotence class 2, then S actually is rational.     

Partition and composition matrices

This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A partition matrix is a composition matrix in which an order is placed on where entries may appear relative to one-another.We show that partition matrices are in one-to-one correspondence with inversion tables. Non-decreasing inversion tables are shown to correspond to partition matrices with a row ordering relation. Partition matrices which are s-diagonal are classified in terms of inversion tables. Bidiagonal partition matrices are enumerated using the transfer-matrix method and are equinumerous with permutations which are sortable by two pop-stacks in parallel.We show that composition matrices on X are in one-to-one correspondence with (2+2)-free posets on X. Also, composition matrices whose rows satisfy a column-ordering relation are shown to be in one-to-one correspondence with parking functions. Finally, we show that pairs of ascent sequences and permutations are in one-to-one correspondence with (2+2)-free posets whose elements are the cycles of a permutation, and use this relation to give an expression for the number of (2+2)-free posets on {1,…,n}.