A local-global principle for linear dependence of noncommutative polynomials

A set of polynomials in noncommuting variables is called locally linearly dependent if their evaluations at tuples of matrices are always linearly dependent. By a theorem of Camino, Helton, Skelton and Ye, a finite locally linearly dependent set of polynomials is linearly dependent. In this short note an alternative proof based on the theory of polynomial identities is given. The method of the proof yields generalizations to directional local linear dependence and evaluations in general algebras over fields of arbitrary characteristic. A main feature of the proof is that it makes it possible to deduce bounds on the size of the matrices where the (directional) local linear dependence needs to be tested in order to establish linear dependence.     

Bounds and a majorization for the real parts of the zeros of polynomials

We apply some eigenvalue inequalities to the real parts of the Frobenius companion matrices of monic polynomials to establish new bounds and a majorization for the real parts of the zeros of these polynomials.

     

Square-free criteria for polynomials using no derivatives

We provide some square-free criteria for primitive polynomials over unique factorization domains, which do not make use of derivatives or discriminants. Using some ideas of Ostrowski we establish nonvanishing conditions for determinants of matrices with polynomial entries and deduce square-free criteria for polynomials in several variables.

     

Bounds and majorization relations for the critical points of polynomials

We apply several matrix inequalities to the derivative companion matrices of complex polynomials to establish new bounds and majorization relations for the critical points of these polynomials in terms of their zeros.     

About Polynomials Whose Divided Differences are Integer-Valued on Prime Numbers

We first globalize some recent results about polynomials whose divided differences are integer-valued on subsets of discrete valuation domains. This allows us to describe explicit computations, in particular for polynomials which are integer-valued on the prime numbers. Then, we specialize other recent results about integer-valued polynomials on triangular matrices to matrices whose coefficients are in some subsets, and in particular, when the coefficients are primes.     

Operator algebras of functions

We present some general theorems about operator algebras that are algebras of functions on sets, including theories of local algebras, residually finite-dimensional operator algebras and algebras that can be represented as the scalar multipliers of a vector-valued reproducing kernel Hilbert space. We use these to further develop a quantized function theory for various domains that extends and unifies Agler's theory of commuting contractions and the Arveson-Drury-Popescu theory of commuting row contractions. We obtain analogous factorization theorems, prove that the algebras that we obtain are dual operator algebras and show that for many domains, supremums over all commuting tuples of operators satisfying certain inequalities are obtained over all commuting tuples of matrices.     

Immanant positivity for Catalan-Stieltjes matrices

We give some sufficient conditions for the nonnegativity of immanants of square submatrices of Catalan-Stieltjes matrices and their corresponding Hankel matrices. To obtain these sufficient conditions, we construct new planar networks with a recursive nature for Catalan-Stieltjes matrices. As applications, we provide a unified way to produce inequalities for many combinatorial polynomials, such as the Eulerian polynomials, Schröder polynomials, and Narayana polynomials.     

Algebras Generated by Linearly Dependent Elements with Prescribed Spectra

We consider associative algebras presented by a finite set of generators and relations of special form: each generator is annihilated by some polynomial, and the sum of generators is zero. The growth of this algebra in dependence on the degrees of the polynomials annihilating the generators is studied. The tuples of degrees for which the algebras are finite-dimensional, have polynomial growth, or have exponential growth are indicated. To the tuple of degrees, we assign a graph, and the above-mentioned cases correspond to Dynkin diagrams, extended Dynkin diagrams, and the other graphs, respectively. For extended Dynkin diagrams, we indicate the hyperplane in the space of parameters (roots of the polynomials) on which the corresponding algebras satisfy polynomial identities.     

On the minimal number of matrices which form a locally hypercyclic, non-hypercyclic tuple

In this paper we extend the notion of a locally hypercyclic operator to that of a locally hypercyclic tuple of operators. We then show that the class of hypercyclic tuples of operators forms a proper subclass to that of locally hypercyclic tuples of operators. What is rather remarkable is that in every finite dimensional vector space over R or C, a pair of commuting matrices exists which forms a locally hypercyclic, non-hypercyclic tuple. This comes in direct contrast to the case of hypercyclic tuples where the minimal number of matrices required for hypercyclicity is related to the dimension of the vector space. In this direction we prove that the minimal number of diagonal matrices required to form a hypercyclic tuple on Rn is n+1, thus complementing a recent result due to Feldman.     

Multiple Meixner–Pollaczek polynomials and the six-vertex model

We study multiple orthogonal polynomials of Meixner–Pollaczek type with respect to a symmetric system of two orthogonality measures. Our main result is that the limiting distribution of the zeros of these polynomials is one component of the solution to a constrained vector equilibrium problem. We also provide a Rodrigues formula and closed expressions for the recurrence coefficients. The proof of the main result follows from a connection with the eigenvalues of (locally) block Toeplitz matrices, for which we provide some general results of independent interest.The motivation for this paper is the study of a model in statistical mechanics, the so-called six-vertex model with domain wall boundary conditions, in a particular regime known as the free fermion line. We show how the multiple Meixner–Pollaczek polynomials arise in an inhomogeneous version of this model.     

On the factorization of polynomial matrices over the domain of principal ideals

We consider the problem of decomposition of polynomial matrices over the domain of principal ideals into a product of factors of lower degrees with given characteristic polynomials. We establish necessary and, under certain restrictions, sufficient conditions for the existence of the required factorization.     

When Does a Submodule of (ℝ[x 1 ⋯, x k]) n Contain a Positive Element?

We characterize for modules consisting of tuples of Laurent polynomials with real coefficients whether such a module contains a positive element. The two conditions needed are numerical and directional positivity. The proof applies universal Gröbner bases.     

Nonlinearity of the Automorphism Groups of Some Free Algebras

We prove that the groups of tame automorphisms of a free Lie algebra (free associative algebra, absolutely free algebra, algebra of polynomials) of rank at least four over a field of characteristic zero admit no faithful representation by matrices over any field.     

Nonsingularity of some classes of matrices, and minimal solutions of Silverman''s game on discrete sets

We establish the irreducibility of each game in four infinite three-parameter families of even order Silverman games, and the major step in doing so is to prove that certain matrices A, related in a simple way to the payoff matrices, are nonsingular for all relevant values of the parameters. This nonsingularity is established by, in effect, producing a matrix D such that AD is known to be nonsingular. The elements of D are polynomials from six interrelated sequences of polynomials closely related to the Chebyshev polynomials of the second kind. Each of these sequences satisfies a second order recursion, and consequently has many Fibonacci-like properties, which play an essential role in proving that the product AD is what we claim it is. The matrices D were found experimentally, by discovering patterns in low order cases worked out with the help of some computer algebra systems. The corresponding results for four families of odd order games were reported in an earlier paper.     

Hypercyclic tuples of operators and somewhere dense orbits

In this paper we prove that there are hypercyclic (n+1)-tuples of diagonal matrices on Cn and that there are no hypercyclic n-tuples of diagonalizable matrices on Cn. We use the last result to show that there are no hypercyclic subnormal tuples in infinite dimensions. We then show that on real Hilbert spaces there are tuples with somewhere dense orbits that are not dense, but we also give sufficient conditions on a tuple to insure that a somewhere dense orbit, on a real or complex space, must be dense.     

Some Spectral Properties of Infinite Band Matrices

For operators generated by a certain class of infinite band matrices we establish a characterization of the resolvent set in terms of polynomial solutions of the underlying higher order recurrence relations. This enables us to describe some asymptotic behaviour of the corresponding systems of vector orthogonal polynomials. Finally, we provide some new convergence results for matrix Padé approximants.     

On the eigenvalues of quaternion matrices

This article is a continuation of the article [F. Zhang, Ger?gorin type theorems for quaternionic matrices, Linear Algebra Appl. 424 (2007), pp. 139–153] on the study of the eigenvalues of quaternion matrices. Profound differences in the eigenvalue problems for complex and quaternion matrices are discussed. We show that Brauer's theorem for the inclusion of the eigenvalues of complex matrices cannot be extended to the right eigenvalues of quaternion matrices. We also provide necessary and sufficient conditions for a complex square matrix to have infinitely many left eigenvalues, and analyse the roots of the characteristic polynomials for 2?×?2 matrices. We establish a characterisation for the set of left eigenvalues to intersect or be part of the boundary of the quaternion balls of Ger?gorin.     

Singular, nonsingular, and bounded rank completions of ACI-matrices

An affine column independent matrix is a matrix whose entries are polynomials of degree at most 1 in a number of indeterminates where no indeterminate appears with a nonzero coefficient in two different columns. A completion is a matrix obtained by giving values to each of the indeterminates. Affine column independent matrices are more general than partial matrices where each entry is either a constant or a distinct indeterminate. We determine when the rank of all completions of an affine column independent matrix is bounded by a given number, generalizing known results for partial matrices. We also characterize the square partial matrices over a field all of whose completions are nonsingular. The maximum number of free entries in such matrices of a given order is determined as well as the partial matrices with this maximum number of free entries.     

On the eigenvalues of some transfer matrices

We consider the roots of two families of polynomials which can be derived as the characteristic polynomials of some (generalized) transfer matrices. We study the possible multiplicities and the number of real roots. Moreover, the number of roots lying inside the unit disk is determined, and bounds for their modulus and for the modulus of the other roots are given.