Comtrans algebras, Thomas sums, and bilinear forms

A comtrans algebra is said to decompose as the Thomas sum of two subalgebras if it is a direct sum at the module level, and if its algebra structure is obtained from the subalgebras and their mutual interactions as a sum of the corresponding split extensions. In this paper, we investigate Thomas sums of comtrans algebras of bilinear forms. General necessary and sufficient conditions are given for the decomposition of the comtrans algebra of a bilinear form as a Thomas sum. Over rings in which 2 is not a zero divisor, comtrans algebras of symmetric bilinear forms are identified as Thomas summands of algebras of infinitesimal isometries of extended spaces, the complementary Thomas summand being the algebra of infinitesimal isometries of the original space. The corresponding Thomas duals are also identified. These results represent generalizations of earlier results concerning the comtrans algebras of finite-dimensional Euclidean spaces, which were obtained using known properties of symmetric spaces. By contrast, the methods of the current paper involve only the theory of comtrans algebras.Received: 30 March 2004     

Generic adjoints in comtrans algebras of bilinear spaces

As a first step towards a general structure theory for comtrans algebras (modeled loosely on the Cartan theory for Lie algebras), this paper investigates comtrans algebras of bilinear spaces. Attention focuses on invariants associated with comtrans algebras, and the extent to which these invariants may serve to specify the algebras up to isomorphism within certain classes. Over fields whose characteristic differs from two, comtrans algebras of symmetric forms are determined up to isomorphism by the eigenvalues of generic adjoints, while comtrans algebras of symplectic forms are determined by the dimensions of maximal abelian subalgebras. Examples show that the multiplicity of zero as a root of the characteristic polynomial is generally independent of the dimension of a maximal abelian subalgebra.     

Divisors of Zero in the Lipschitz Semigroup

The Lipschitz semigroup is generated by all (invertible and noninvertible) Clifford vectors. We show that all solutions of the equation xy = 0 (where x, y are non-zero elements of the Lipschitz semigroup) are of the form x = av₀, y = v₀b where v₀ is an isotropic vector (i.e., v₀² = 0). This problem turns out to be useful in the construction of multisoliton solutions of integrable systems of nonlinear partial differential equtions.     

Positivity Preserving Hadamard Matrix Functions

For every positive real number p that lies between even integers 2(m − 2) and 2(m − 1) we demonstrate a matrix A = [a_ij] of order 2m such that A is positive definite but the matrix with entries |a_ij|^p is not.     

Extension to maximal semidefinite invariant subspaces for hyponormal matrices in indefinite inner products

It is proved that under certain essential additional hypotheses, a nonpositive invariant subspace of a hyponormal matrix admits an extension to a maximal nonpositive subspace which is invariant for both the matrix and its adjoint. Nonpositivity of subspaces and the hyponormal property of the matrix are understood in the sense of a nondegenerate inner product in a finite dimensional complex vector space. The obtained theorem combines and extends several previously known results. A Pontryagin space formulation, with essentially the same proof, is offered as well.     

A min-max theorem for complex symmetric matrices

We optimize the form Re x^tTx to obtain the singular values of a complex symmetric matrix T. We prove that for ,

     

Positivity of quiver coefficients through Thom polynomials

We use the Thom Polynomial theory developed by Fehér and Rimányi to prove the component formula for quiver varieties conjectured by Knutson, Miller, and Shimozono. This formula expresses the cohomology class of a quiver variety as a sum of products of Schubert polynomials indexed by minimal lace diagrams, and implies that the quiver coefficients of Buch and Fulton are non-negative. We also apply our methods to give a new proof of the component formula from the Gröbner degeneration of quiver varieties, and to give generating moves for the KMS-factorizations that form the index set in K-theoretic versions of the component formula.     

Quartic residues and binary quadratic forms

Let be a prime, m∈Z and . In this paper we obtain a general criterion for m to be a quartic residue in terms of appropriate binary quadratic forms. Let d>1 be a squarefree integer such that , where is the Legendre symbol, and let ε_d be the fundamental unit of the quadratic field . Since 1942 many mathematicians tried to characterize those primes p so that ε_d is a quadratic or quartic residue . In this paper we will completely solve these open problems by determining the value of , where p is an odd prime, and . As an application we also obtain a general criterion for , where {u_n(a,b)} is the Lucas sequence defined by and .     

Generalizing inplace multiplicity identities for integer compositions

In a recent paper, the authors gave two new identities for compositions, or ordered partitions, of integers. These identities were based on closely-related integer partition functions which have recently been studied. In the process, we also extensively generalized both of these identities. Since then, we asked whether one could generalize one of these results even further by considering compositions in which certain parts could come from t kinds (rather than just two kinds, which was the crux of the original result). In this paper, we provide such a generalization. A straightforward bijective proof is given and generating functions are provided for each of the types of compositions which arise. We close by briefly mentioning some arithmetic properties satisfied by the functions which count such compositions.     

Oscillation Criteria for First Order Delay Difference Equations

Oscillation criteria for all solutions of the first order delay difference equation of the form where {p_n} is a sequence of nonnegative real numbers and k is a positive integer are established especially in the case that the well-known oscillation conditions are not satisfied. Dedicated to Professor Y.G. Sficas on the occasion of his 60h birthday     

Suborthogonality and orthocentricity of matrices

We present some results on submatrices of orthogonal and unitary matrices and their relation to so called orthocentric matrices. These are then completely characterized.     

Eine Charakterisierung quadratischer Formen durch eine Funktionalgleichung

Ohne Zusammenfassung

---

     

Hyponormal and strongly hyponormal matrices in inner product spaces

Complex matrices that are structured with respect to a possibly degenerate indefinite inner product are studied. Based on earlier works on normal matrices, the notions of hyponormal and strongly hyponormal matrices are introduced. A full characterization of such matrices is given and it is shown how those matrices are related to different concepts of normal matrices in degenerate inner product spaces. Finally, the existence of invariant semidefinite subspaces for strongly hyponormal matrices is discussed.     

On the quadratic character of quadratic units

Let be a prime. Let a,b∈Z with p?a(a²+b²). In the paper we mainly determine by assuming p=c²+d² or p=Ax²+2Bxy+Cy² with AC−B²=a²+b². As an application we obtain simple criteria for εD to be a quadratic residue , where D>1 is a squarefree integer such that D is a quadratic residue of p, εD is the fundamental unit of the quadratic field with negative norm. We also establish the congruences for and obtain a general criterion for p|U(p−1)/4, where {Un} is the Lucas sequence defined by U₀=0, U₁=1 and Un+1=bUn+k²Un−1(n?1).     

Lattices and infinite-dimensional forms. ‘The Lattice Method’

Hermitean vector spaces E of infinite dimensions are considered. Let G be a subgroup of the orthogonal group of E acting on a set M. The Lattice Method is a technique for classifying the orbits in M under G. We discuss the method in abstract terms and we illustrate it by means of three classification results showing that it is decisive to do a considerable amount of explicit calculations with vector subspace lattices.     

Algorithmic copositivity detection by simplicial partition

We present new criteria for copositivity of a matrix, i.e., conditions which ensure that the quadratic form induced by the matrix is nonnegative over the nonnegative orthant. These criteria arise from the representation of the quadratic form in barycentric coordinates with respect to the standard simplex and simplicial partitions thereof. We show that, as the partition gets finer and finer, the conditions eventually capture all strictly copositive matrices. We propose an algorithmic implementation which considers several numerical aspects. As an application, we present results on the maximum clique problem. We also briefly discuss extensions of our approach to copositivity with respect to arbitrary polyhedral cones.     

An algorithm for determining copositive matrices

In this paper, we present an algorithm of simple exponential growth called COPOMATRIX for determining the copositivity of a real symmetric matrix. The core of this algorithm is a decomposition theorem, which is used to deal with simplicial subdivision of on the standard simplex Δ_m, where each component of the vector β is −1, 0 or 1.     

Eine Charakterisierung der positiv definiten quadratischen Formen

Ohne Zusammenfassung

---

Herrn Prof. Dr. Alexander Dinghas zum 65. Geburtstag in Verehrung und Dankbarkeit gewidmet     

Mean matrices and infinite divisibility

We consider matrices M with entries m_ij = m(λ_i, λ_j) where λ₁, … ,λ_n are positive numbers and m is a binary mean dominated by the geometric mean, and matrices W with entries w_ij = 1/m (λ_i, λ_j) where m is a binary mean that dominates the geometric mean. We show that these matrices are infinitely divisible for several much-studied classes of means.     

Groups acting on circulant matrices

Summary If a groupG permutes a setI, andM is a multiplicative abelian group, a representation ofG onM ^I is given by permutation of coordinates. TheG-module homomorphisms intoM ^I arise from exponential maps. This framework encompasses those systems of functional equations that characterize generalized hyperbolic functions.