On double-one matrices and double-zero matrices

We investigate two special classes of matrices over GF(2) with certain interesting properties. These properties can be applied to construct nonsingular matrix pairs efficiently and thus provide a solution to the long-key problems of McEIiece's public-key cryptosystem.     

On double-one matrices and double-zero matrices

We investigate two special classes of matrices over GF(2) with certain interesting properties. These properties can be applied to construct nonsingular matrix pairs efficiently and thus provide a solution to the long-key problems of McEIiece's public-key cryptosystem.     

MDS Self-Dual Codes over Large Prime Fields

Combinatorial designs have been used widely in the construction of self-dual codes. Recently a new method of constructing self-dual codes was established using orthogonal designs. This method has led to the construction of many new self-dual codes over small finite fields and rings. In this paper, we generalize this method by using generalized orthogonal designs, and we give another new method that creates and solves Diophantine equations over GF(p) in order to find suitable generator matrices for self-dual codes. We show that under the necessary conditions these methods can be applied as well to small and large fields. We apply these two methods to study self-dual codes over GF(31) and GF(37). Using these methods we obtain some new maximum distance separable self-dual codes of small orders.     

Differentiable structure of the set of coaxial stress–strain tensors

In order to study stress–strain tensors, we consider their representations as pairs of symmetric 3 × 3‐matrices and the space of such pairs of matrices partitioned into equivalence classes corresponding to change of bases. We see that these equivalence classes are differentiable submanifolds; in fact, orbits under the action of a Lie group. We compute their dimension and obtain miniversal deformations. Finally, we prove that the space of coaxial stress–strain tensors is a finite union of differentiable submanifolds. Copyright © 2008 John Wiley & Sons, Ltd.     

Parabolic Type Equations and Markov Stochastic Processes on Adeles

In this paper we study the Cauchy problem for new classes of parabolic type pseudodifferential equations over the rings of finite adeles and adeles. We show that the adelic topology is metrizable and give an explicit metric. We find explicit representations of the fundamental solutions (the heat kernels). These fundamental solutions are transition functions of Markov processes which are adelic analogues of the Archimedean Brownian motion. We show that the Cauchy problems for these equations are well-posed and find explicit representations of the evolution semigroup and formulas for the solutions of homogeneous and non-homogeneous equations.     

On the ranks of principal submatrices of diagonalizable matrices

As is well known, the rank of a diagonalizable complex matrix can be characterized as the maximum order of the nonzero principal minors of this matrix. The standard proof of this fact is based on representing the coefficients of the characteristic polynomial as the (alternating) sums of all the principal minors of appropriate order. We show that in the case of normal matrices, one can give a simple direct proof, not relying on those representations. Bibliography: 2 titles. Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 359, 2008, pp. 42–44.     

Cauchy Matrices in the Observation of Diffusion Equations

Observability Gramians of diffusion equations have been recently connected to infinite Pick and Cauchy matrices. In fact, inverse or observability inequalities can be obtained after estimating the extreme eigenvalues of these structured matrices,with respect to the diffusion semi-group matrix. The purpose is hence to conduct a spectral study of a subclass of symmetric Cauchy matrices and present an algebraic way to show the desired observability results. We revisit observability inequalities for three different observation problems of the diffusion equation and show how they can be (re)stated through simple proofs.     

Split‐type octonion matrix

The split and hyperbolic (countercomplex) octonions are eight‐dimensional nonassociative algebras over the real numbers, which are in the form , where e_m's have different properties for them. The main purpose of this paper is to define the split‐type octonion and its matrix whose inputs are split‐type octonions and give some properties for them by using the real quaternions, split, and hyperbolic (countercomplex) octonions. On the other hand, to make some definitions, we present some operations on the split‐type octonions. Also, we show that every split‐type octonions can be represented by 2 × 2 real quaternion matrix and 4 × 4 complex number matrix. The information about the determinants of these matrix representations is also given. Besides, the main features of split‐type octonion matrix concept are given by using properties of  real quaternion matrices. Then, 8n × 8nreal matrix representations of split‐type octonion matrices are shown, and some algebraic structures are examined. Additionally, we introduce real quaternion adjoint matrices of split‐type octonion matrices. Moreover, necessary and sufficient conditions and definitions are given for split‐type octonion matrices to be special split‐type octonion matrices. We describe some special split‐type octonion matrices. Finally, oct‐determinant of split‐type octonion matrices is defined. Definitive and understandable examples of all definitions, theorems, and conclusions were given for a better understanding of all these concepts.     

Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems

In this paper the problem of complexity of multiplication of a matrix with a vector is studied for Toeplitz, Hankel, Vandermonde, and Cauchy matrices and for matrices connected with them (i.e., for transpose, inverse, and transpose to inverse matrices). The proposed algorithms have complexities of at most O(n log²n) flops and in a number of cases they improve the known estimates. In these algorithms, in a separate preprocessing phase, are singled out all the actions on the preparation of a given matrix which aimed at the reduction of the complexity of the second stage of computations directly connected with multiplication by an arbitrary vector. Effective algorithms for computing the Vandermonde determinant and the determination of a Cauchy matrix are given.     

Regular sets for the affine and projective groups over the field of two elements

In this paper we show that collineation groups of affine and projective spaces over the field of two elements GF (2), except in low dimensions, have regular sets. As an application of this result, we prove that, apart from a finite number of exceptions, any collineation group of affine and projective spaces over GF (2), is geometric. In the exceptional dimensions, all primitive groups are examined.Lavoro eseguito nell'ambito dei finanziamenti del M.P.I. Italia (40%).     

Quaternionic matrices: Unitary similarity, simultaneous triangularization and some trace identities

We construct six unitary trace invariants for 2×2 quaternionic matrices which separate the unitary similarity classes of such matrices, and show that this set is minimal. We have discovered a curious trace identity for two unit-speed one-parameter subgroups of Sp(1). A modification gives an infinite family of trace identities for quaternions as well as for 2×2 complex matrices. We were not able to locate these identities in the literature. We prove two quaternionic versions of a well known characterization of triangularizable subalgebras of matrix algebras over an algebraically closed field. Finally we consider the problem of describing the semi-algebraic set of pairs (X,Y) of quaternionic n×n matrices which are simultaneously triangularizable. Even the case n=2, which we analyze in more detail, remains unsolved.     

Weaving hadamard matrices with maximum excess and classes with small excess

Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004.     

A kind of nonnegative matrices and its application on the stability of discrete dynamical systems

In this paper we introduce a new kind of nonnegative matrices which is called (sp) matrices. We show that the zero solutions of a class of linear discrete dynamical systems are asymptotically stable if and only if the coefficient matrices are (sp) matrices. To determine that a matrix is (sp) matrix or not is very simple, we need only to verify that some elements of the coefficient matrices are zero or not. According to the result above, we obtain the conditions for the stability of several classes of discrete dynamical systems.     

Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables

In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full classification of such multivariate skew polynomial rings (free or not) over finite fields. To that end, we first show that all ring morphisms from the field to the ring of square matrices are diagonalizable, and that the corresponding derivations are all inner derivations. Secondly, we show that all such multivariate skew polynomial rings over finite fields are isomorphic as algebras to a multivariate skew polynomial ring whose ring morphism from the field to the ring of square matrices is diagonal, and whose derivation is the zero derivation. Furthermore, we prove that two such representations only differ in a permutation on the field automorphisms appearing in the corresponding diagonal. The algebra isomorphisms are given by affine transformations of variables and preserve evaluations and degrees. In addition, ours proofs show that the simplified form of multivariate skew polynomial rings can be found computationally and explicitly.     

On the matrix algebra of elliptic biquaternions

In this study, we introduce the concept of elliptic biquaternion matrices. Firstly, we obtain elliptic matrix representations of elliptic biquaternion matrices and establish a universal similarity factorization equality for elliptic biquaternion matrices. Afterwards, with the aid of these representations and this equality, we obtain various results on some basic topics such as generalized inverses, eigenvalues and eigenvectors, determinants, and similarity of elliptic biquaternion matrices. These valuable results may be useful for developing a perfect theory on matrix analysis over elliptic biquaternion algebra in the future.     

Stationary,completely mixed and symmetric optimal and equilibrium strategies in stochastic games

In this paper, we address various types of two-person stochastic games—both zero-sum and nonzero-sum, discounted and undiscounted. In particular, we address different aspects of stochastic games, namely: (1) When is a two-person stochastic game completely mixed? (2) Can we identify classes of undiscounted zero-sum stochastic games that have stationary optimal strategies? (3) When does a two-person stochastic game possess symmetric optimal/equilibrium strategies? Firstly, we provide some necessary and some sufficient conditions under which certain classes of discounted and undiscounted stochastic games are completely mixed. In particular, we show that, if a discounted zero-sum switching control stochastic game with symmetric payoff matrices has a completely mixed stationary optimal strategy, then the stochastic game is completely mixed if and only if the matrix games restricted to states are all completely mixed. Secondly, we identify certain classes of undiscounted zero-sum stochastic games that have stationary optima under specific conditions for individual payoff matrices and transition probabilities. Thirdly, we provide sufficient conditions for discounted as well as certain classes of undiscounted stochastic games to have symmetric optimal/equilibrium strategies—namely, transitions are symmetric and the payoff matrices of one player are the transpose of those of the other. We also provide a sufficient condition for the stochastic game to have a symmetric pure strategy equilibrium. We also provide examples to show the sharpness of our results.     

Sufficient matrices belong to L

In this paper, we establish a significant matrix class inclusion that seems to have been overlooked in the literature of the linear complementarity problem. We show that P_*, the class of sufficient matrices, is a subclass of L. In the course of demonstrating this inclusion, we introduce other new matrix classes that forge interesting new connections between known matrix classes.     

On L-spaces and left-orderable fundamental groups

Examples suggest that there is a correspondence between L-spaces and three-manifolds whose fundamental groups cannot be left-ordered. In this paper we establish the equivalence of these conditions for several large classes of manifolds. In particular, we prove that they are equivalent for any closed, connected, orientable, geometric three-manifold that is non-hyperbolic, a family which includes all closed, connected, orientable Seifert fibred spaces. We also show that they are equivalent for the twofold branched covers of non-split alternating links. To do this we prove that the fundamental group of the twofold branched cover of an alternating link is left-orderable if and only if it is a trivial link with two or more components. We also show that this places strong restrictions on the representations of the fundamental group of an alternating knot complement with values in $\text{ Homeo}_+(S^1)$ .     

Products of elementary doubly stochastic matrices

While studying a theorem of Westwerk on higher numerical ranges, we became interested in how the theory of elementary doubly stochastic (e.d.s.) matrices is related to a result of Goldberg and Straus. We show that there exist classes of doubly stochastic (d.s.) matrices of order n≧3 and orthostochastic (o s) matrices of order n≧4 such that the matrices in these classes cannot be represented as a product of e.d.s. matrices. In fact the matrices in these classes do not admit a representation as an infinite limit of a product of e.d.s. matrices.     

On the genus of the groups PSL(2, q), PSL(3, q), and PSp(4, q)

SL(n, q) is the group of n×n matrices, over the Galois field GF(q), of determinate 1. PSL(n, q) is SL(n, q) modulo the scalar n×n matrices of determinate 1. PSL(n, q) acts on the Desarguesian projective space PG(n−1, q). Sp(4, q) is the group of 4 × 4 matrices of determinate 1 which preserve the symplectic bilinear form on the 4 × 1 matrices over GF(q). PSp(4, q) is Sp(4, q) modulo Z = {1,−1}. PSp(4, q) acts on the symplectic generalized quadrangle W(3, q), a subspace of the projective space PG(3, q), as a group of automorphisms. In this paper, bounds are given for the genus of these groups.