Convolution semigroups of states

Convolution semigroups of states on a quantum group form the natural noncommutative analogue of convolution semigroups of probability measures on a locally compact group. Here we initiate a theory of weakly continuous convolution semigroups of functionals on a C*-bialgebra, the noncommutative counterpart of a locally compact semigroup. On locally compact quantum groups we obtain a bijective correspondence between such convolution semigroups and a class of C ₀-semigroups of maps which we characterise. On C*-bialgebras of discrete type we show that all weakly continuous convolution semigroups of states are automatically norm-continuous. As an application we deduce a known characterisation of continuous conditionally positive-definite Hermitian functions on a compact group.     

Binary quadratic and cubic forms,and unipositive matrices

The classical method of reducing a positive binary quadratic form to a semi-reduced form applies translations alternately left and right to minimize the absolute value of the middle coefficient — and may therefore be called absolute reduction. There is an alternative method which keeps the sign of the middle coefficient constant before the end: we call this method positive reduction. Positive reduction seems to make possible an algorithm for finding the representations of 1 by a binary cubic form with real linear factors, and has various properties somewhat simpler than those of absolute reduction. Some of these properties involve unipositive matrices (with nonnegative integer elements and determinant 1). Certain semigroups of unipositive matrices with unique factorization into primes are described. Two of these semigroups give a neat approach to the reduction of indefinite binary quadratic forms—which may generalize. Some remarks on unimodular automorphs occur in Section 6.     

Row reduced matrices and annihilator semigroups 1

Throughout we are discussing matrices with entries from a field K. It was first proved in [1] that a product of row reduced matrices is row reduced. This means that the set of row reduced matrices in any matrix ring form a semigroup. It is also the case that every matrix A ? M_n(K)has the property that it has the same right annihilator as its row reduced form, and distinct row reduced matrice have distinct right annihilators. Let R be a ring. Motivated by these observations, we call a multiplicative semigroup S in R a right annihilator semigroup for R if every element in R has the same right annihilator as exactly one element in S. Reasoning that row reduced matrices are very important we study semigroups that share their formal properties. Ultimately we would like to know all right annihilator semigroups in M_n(K).This seems to be a formidable task. Here we determine all right annihila-tor semigroups in M₃(K) up to a change of basis, that is conjugation.     

Constructing numerical semigroups of a given genus

Let n _g denote the number of numerical semigroups of genus g. Bras-Amorós conjectured that n _g possesses certain Fibonacci-like properties. Almost all previous attempts at proving this conjecture were based on analyzing the semigroup tree. We offer a new, simpler approach to counting numerical semigroups of a given genus. Our method gives direct constructions of families of numerical semigroups, without referring to the generators or the semigroup tree. In particular, we give an improved asymptotic lower bound for n _g .     

Multiplicative maps preserving the higher rank numerical ranges and radii

Let M_n be the semigroup of n×n complex matrices under the usual multiplication, and let S be different subgroups or semigroups in M_n including the (special) unitary group, (special) general linear group, the semigroups of matrices with bounded ranks. Suppose Λ_k(A) is the rank-k numerical range and r_k(A) is the rank-k numerical radius of A∈M_n. Multiplicative maps ?:S→M_n satisfying r_k(?(A))=r_k(A) are characterized. From these results, one can deduce the structure of multiplicative preservers of Λ_k(A).     

Distinct degree factorizations in additive arithmetical semigroups

The probability that an element of degreen has a given factorization pattern is computed within the context of a certain class of additive arithmetical semigroups. Concrete cases of these semigroups include the semigroup, of monic polynomials in one indeterminate over a finite fieldF _q , the multiplicative semigroups of ideals in principal orders within algebraic function fields overF _q and semigroups of integral divisors in algebraic function fields overF _q .     

Generalized doubly stochastic and permutation matrices over a ring

Let R be a ring with unity. A combinatorial argument is used to show that the R-module Δ_n(R) of all n × n matrices over R with constant row and column sums has a basis consisting of permutation matrices. This is used to characterize orthogonal matrices which are linear combinations of permutation matrices. It is shown that all bases of Δ_n(R) consisting of permutation matrices have the same cardinality, and other properties of bases of Δ_n(R) are investigated.     

Nonnegative factorization of positive semidefinite nonnegative matrices

We give simple geometric proofs of the known results that, for n ?4, n × n nonnegative positive semidefinite matrices can be factored into n × n nonnegative factors and that, for n ? 5, these conditions are not sufficient to guarantee the existence of such a factorization.     

Noncommutative convexity arises from linear matrix inequalities

This paper concerns polynomials in g noncommutative variables x=(x₁,…,xg), inverses of such polynomials, and more generally noncommutative “rational expressions” with real coefficients which are formally symmetric and “analytic near 0.” The focus is on rational expressions r=r(x) which are “matrix convex” near 0; i.e., those rational expressions r for which there is an ?>0 such that if X=(X₁,…,Xg) is a g-tuple of n×n symmetric matrices satisfying

     

Maximum and minimum diagonal sums of doubly stochastic matrices

Let Ω_n denote the convex polyhedron of all n×n doubly stochastic (d.s.) matrices. The purpose of this paper is to investigate some of the numerical properties of the maximum and the minimum diagonal sums of the matrices in Ω_n. A few conjectures that naturally arise will be mentioned.     

Lyapunov,Bézout,and Hankel

Given a polynomial f of degree n, we denote by C its companion matrix, and by S the truncated shift operator of order n. We consider Lyapunov-type equations of the form X?SXC=>W and X?CXS=W. We derive some properties of these equations which make it possible to characterize Bezoutian matrices as solutions of the first equation with suitable right-hand sides W (similarly for Hankel and the second equation) and to write down explicit expressions for these solutions. This yields explicit factorization formulae for polynomials in C, for the Schur-Cohn matrix, and for matrices satisfying certain intertwining relations, as well as for Bezoutian matrices.     

A quantum-mechanical functional central limit theorem

Continuing an earlier work [4], properties of canonical Wiener processes are investigated. An analog of the sample path continuity property is obtained. A noncommutative counterpart of weak convergence is formulated. Operator processes (P_n, Q_n) analogous to the random-walk approximating processes of the Donsker invariance principle are defined in terms of a sequence (p_i, q_i) of pairs of quantum mechanical canonical observables satisfying hypotheses analogous to those of the classical central limit theorem. It is shown that P_n, Q_n) converges weakly to a canonical Wiener process.     

Semigroups of matrices of intermediate growth

Finitely generated linear semigroups over a field K that have intermediate growth are considered. New classes of such semigroups are found and a conjecture on the equivalence of the subexponential growth of a finitely generated linear semigroup S and the nonexistence of free noncommutative subsemigroups in S, or equivalently the existence of a nontrivial identity satisfied in S, is stated. This ‘growth alternative’ conjecture is proved for linear semigroups of degree 2, 3 or 4. Certain results supporting the general conjecture are obtained. As the main tool, a new combinatorial property of groups is introduced and studied.     

Green’s matrices

Our goal is to identify and understand matrices A that share essential properties of the unitary Hessenberg matrices M that are fundamental for Szegö’s orthogonal polynomials. Those properties include: (i) Recurrence relations connect characteristic polynomials {r_k(x)} of principal minors of A. (ii) A is determined by generators (parameters generalizing reflection coefficients of unitary Hessenberg theory). (iii) Polynomials {r_k(x)} correspond not only to A but also to a certain “CMV-like” five-diagonal matrix. (iv) The five-diagonal matrix factors into a product BC of block diagonal matrices with 2 × 2 blocks. (v) Submatrices above and below the main diagonal of A have rank 1. (vi) A is a multiplication operator in the appropriate basis of Laurent polynomials. (vii) Eigenvectors of A can be expressed in terms of those polynomials.Conditions (v) connects our analysis to the study of quasi-separable matrices. But the factorization requirement (iv) narrows it to the subclass of “Green’s matrices” that share Properties (i)-(vii).The key tool is “twist transformations” that provide 2ⁿ matrices all sharing characteristic polynomials of principal minors with A. One such twist transformation connects unitary Hessenberg to CMV. Another twist transformation explains findings of Fiedler who noticed that companion matrices give examples outside the unitary Hessenberg framework. We mention briefly the further example of a Daubechies wavelet matrix. Infinite matrices are included.     

Identities of the Semigroup of Upper Triangular Tropical Matrices

A new family of identities satisfied by the semigroups U _n (𝕋) of n × n upper triangular tropical matrices is constructed and an elementary proof is given.     

Algebraic properties of Manin matrices 1

We study a class of matrices with noncommutative entries, which were first considered by Yu.I. Manin in 1988 in relation with quantum group theory. They are defined as “noncommutative endomorphisms” of a polynomial algebra. More explicitly their defining conditions read: (1) elements in the same column commute; (2) commutators of the cross terms are equal: [M_ij,M_kl]=[M_kj,M_il] (e.g. [M₁₁,M₂₂]=[M₂₁,M₁₂]). The basic claim is that despite noncommutativity many theorems of linear algebra hold true for Manin matrices in a form identical to that of the commutative case. Moreover in some examples the converse is also true, that is, Manin matrices are the most general class of matrices such that linear algebra holds true for them. The present paper gives a complete list and detailed proofs of algebraic properties of Manin matrices known up to the moment; many of them are new. In particular we provide complete proofs that an inverse to a Manin matrix is again a Manin matrix and for the Schur formula for the determinant of a block matrix; we generalize the noncommutative Cauchy–Binet formulas discovered recently arXiv:0809.3516, which includes the classical Capelli and related identities. We also discuss many other properties, such as the Cramer formula for the inverse matrix, the Cayley–Hamilton theorem, Newton and MacMahon–Wronski identities, Plücker relations, Sylvester's theorem, the Lagrange–Desnanot–Lewis Carroll formula, the Weinstein–Aronszajn formula, some multiplicativity properties for the determinant, relations with quasideterminants, calculation of the determinant via Gauss decomposition, conjugation to the second normal (Frobenius) form, and so on and so forth. Finally several examples and open question are discussed. We refer to [A. Chervov, G. Falqui, Manin matrices and Talalaev's formula, J. Phys. A 41 (2008) 194006; V. Rubtsov, A. Silantiev, D. Talalaev, Manin matrices, elliptic commuting families and characteristic polynomial of quantum gl_n elliptic Gaudin model, in press] for some applications in the realm of quantum integrable systems.     

Semigroups Generated by Similarity Orbits

\noindent We investigate the semigroups in M _n (\smallbf F) generated by the similarity orbit of single matrices. February 11, 2000     

Characterizations of rectangular totally and strictly totally positive matrices

An n×m real matrix A is said to be totally positive (strictly totally positive) if every minor is nonnegative (positive). In this paper, we study characterizations of these classes of matrices by minors, by their full rank factorization and by their thin QR factorization.     

Strongly clean matrix rings over commutative local rings

We will completely characterize the commutative local rings for which M_n(R) is strongly clean, in terms of factorization in R[t]. We also obtain similar elementwise results which show additionally that for any monic polynomial f∈R[t], the strong cleanness of the companion matrix of f is equivalent to the strong cleanness of all matrices with characteristic polynomial f.