Smith normal form of matrices associated with differential posets

This thesis consists of two independent chapters. The first chapter concerns the Smith Normal Form (SNF) over the integers ℤ of integral matrices. We consider the SNF of a matrix A to be the ratio of two ℤ-modules -- a finitely generated abelian group; this is called the Smith group of A. The Smith group provides a unified setting to present both new and old results. The new results concern the relationship between the eigenvalues of an integral matrix and its SNF. In particular, the multiplicities of integer eigenvalues are shown to relate to the multiplicities in the type of the Smith group. Bounds are also given for the exponent of the Smith group. In some cases, these are best possible. The old results discussed are the interlacing of the SNF in the case of augmented matrices and the symmetries of the SNF for certain combinatorial matrices. The latter results are extended to rectangular matrices. Numerous examples are given throughout, along with many conjectures based on computation. The second chapter generalizes the work of Pless, et al. on duadic codes and Q-codes. We take abelian group codes to be ideals in the group ring F[G], where G is a finite abelian group of odd order n and F is a finite field with characteristic relatively prime to n. We define generalized Q-codes from a pair of idempotents of F[G] and an automorphism of G which together obey two simple equations. These codes are (n, (n+1)/2) and (n, (n-1)/2) linear codes. We show that all of the properties of duadic and Q-codes generalize. In particular, we extend the results on the relationship of these codes to projective planes with regular automorphism group G. When F has characteristic 2, we give simple numerical conditions on G and F which determine when generalized Q-codes exist. We also give some techniques for constructing these codes.

We consider Kasteleyn and Kasteleyn-Percus matrices, which arise in enumerating matchings of planar graphs, up to matrix operations on their rows and columns. If such a matrix is defined over a principal ideal domain, this is equivalent to considering its Smith normal form or its cokernel. Many variations of the enumeration methods result in equivalent matrices. In particular, Gessel-Viennot matrices are equivalent to Kasteleyn-Percus matrices. We apply these ideas to plane partitions and related planar of tilings. We list a number of conjectures, supported by experiments in Maple, about the forms of matrices associated to enumerations of plane partitions and other lozenge tilings of planar regions and their symmetry classes. We focus on the case where the enumerations are round or $q$-round, and we conjecture that cokernels remain round or $q$-round for related "impossible enumerations" in which there are no tilings. Our conjectures provide a new view of the topic of enumerating symmetry classes of plane partitions and their generalizations. In particular we conjecture that a $q$-specialization of a Jacobi-Trudi matrix has a Smith normal form. If so it could be an interesting structure associated to the corresponding irreducible representation of SL$(n,C)$. Finally we find, with proof, the normal form of the matrix that appears in the enumeration of domino tilings of an Aztec diamond.

Classes of integer Abaffy–Broyden–Spedicato (ABS) methods have recently been introduced for solving linear systems of Diophantine equations. Each method provides the general integer solution of the system by computing an integer solution and an integer matrix, named Abaffian, with rows generating the integer null space of the coefficient matrix. The Smith normal form of a general rectangular integer matrix is a diagonal matrix, obtained by elementary nonsingular (unimodular) operations. Here, we present a class of algorithms for computing the Smith normal form of an integer matrix. In doing this, we propose new ideas to develop a new class of extended integer ABS algorithms generating an integer basis for the integer null space of the matrix. For the Smith normal form, having the need to solve the quadratic Diophantine equation, we present two algorithms for solving such equations. The first algorithm makes use of a special integer basis for the row space of the matrix, and the second one, with the intention of controlling the growth of intermediate results and making use of our given conjecture, is based on a recently proposed integer ABS algorithm. Finally, we report some numerical results on randomly generated test problems showing a better performance of the second algorithm in controlling the size of the solution. We also report the results obtained by our proposed algorithm on the Smith normal form and compare them with the ones obtained using Maple, observing a more balanced distribution of the intermediate components obtained by our algorithm.

Smith normal form computations are important in group theory, module theory and number theory. We consider the transformation matrices for the Smith normal form over the integers and give a presentation of arbitrary transformation matrices for this normal form. Our main contribution is an algorithm that replaces already computed transformation matrices by others with small entries. We combine methods from lattice basis reduction with a procedure to reduce the sum of the squared entries of both transformation matrices. This algorithm performs well even for matrices of large dimensions.

In this paper, some structural controllability properties in frequency domain over F(z) are studied. The conclusion which is used to investigate the co-primeness with smith normal form over R is extended to the RFS (Rational Function Systems). Smith normal form PBH (Popov-Belevich-Hautus) controllability criterion for the system over F(z) is derived which based on the PBH controllability criterion existed over F(z). An illustrative example is given and the controllability conditions of a class of RFS are proven.

We investigate the lattice-based array partitioning based on the theory of the Smith Normal Form and we present two elegant techniques for partitioning arrays in parallel DoAll loops for message-passing parallel machines: (1) DoAll loops with constant dependencies for communication-free partitioning: a general solution of all possible communication-free partitioning is derived where the dependencies among array references are described in constant distance vectors. (2) DoAll loops with non-constant dependencies for block-communication partitioning: the dependencies among array references are described in non-constant distance vectors. We derive the partitioning equations which allocate all remote data to a unique processor such that only one block-communication can obtain all the remote data for the computation. By using the Smith Normal Form decomposition, we are also able to verify our partitioning results.

On the Smith normal form of D-optimal designs

We investigate fast parallel algorithms to compute normal forms of matrices and the corresponding transformations. Given a matrix B in M n,n (K), where K is an arbitrary commutative field, we establish that computing a sim- ilarity transformation P such that FP~1BP is in Frobenius normal form can be done in NC2 . Using a reduction to this first problem, a similar fact is then proved for the Smith normal form S(x) of a polynomial matrix A(x )i n M n , m ( K ( x)); to compute unimodular matrices (x) and »(x) such that S(x)(x)A(x)»(x) can be done in NC2 . We get that over concrete fields such as the rationals, these problems are in NC2. Using our previous results we have thus established that the problems of computing transformations over a field extension for the Jordan normal form, and transformations over the input field for the Frobenius and the Smith normal form are all in NC2 . As a corollary we establish a polynomial-time sequential algorithm to compute transformations for the Smith form over K(x).

Smith forms of circulant polynomial matrices

Using Smith normal forms and μ-bases to compute all the singularities of rational planar curves

We have provided a parallel solution for the well-known Smith normal form problem. Our method employs randomization as a tool to remove the iterations along the main diagonal in the classical sequential algorithms, and as such might be useful in similar settings, as well as may speed the sequential methods themselves.

Black box techniques [12] are enabling exact linear algebra computations of a scale well beyond anything previously possible. The development of new and interesting algorithms has proceeded apace for the past two decades. It is time for the dissemination of these algorithms in an easily used software library so that the mathematical community may readily take advantage of their power. LinBox is that library. In this paper, we describe the design of this generic library, sketch its current range of capabilities, and give several examples of its use. The examples include a solution of Trefethen’s “Hundred Digit Challenge” problem #7 [14] and the computation of all the homology groups of simplicial complexes using the Smith normal form [8]. Exact black box methods are currently successful on sparse matrices with hundreds of thousands of rows and columns and having several million nonzero entries. The main reason large problems can be solved by black box methods is that they require much less memory in general than traditional eliminationbased methods do. This fact is widely used in the numerical computation area. We refer for instance to the templates for linear system solution and eigenvalue problems [2,1]. This has also led the computer algebra community to a considerable interest in black box methods. Since Wiedemann’s seminal paper [16], many developments have been proposed especially to adapt Krylov or Lanczos methods to fast exact algorithms. We refer to [5] and references therein for a review of problems and solutions. LinBox supplies efficient black box solutions for a variety of problems including linear equations and matrix normal forms with the guiding design principle of re-usability. The most essential and driving design criterion for LinBox is that it is generic with respect to the domain of computation. This is because there are many and various representations of finite fields each of which is advantageous to use for some algorithm under some circumstance. The integral and rational number capabilities depend heavily on modular

New algorithms for constructing the Hermite normal form (triangular) and Smith normal form (diagonal) of an integer matrix are presented. A new algorithm for determining the set of solutions to a system of linear diophantine equations is presented. A modification of the Hermite algorithm gives an integer-preserving algorithm for solving linear equations with real-valued variables. Rough bounds for the number of operations are cubic polynomials involving the order of the matrix and the determinant of the matrix. The algorithms are valid if the elements of the matrix are in a principal ideal domain.

We present enumeration results on the number of connected graphs up to 10 vertices for which there is at least one other graph with the same spectrum (cospectral mate), or at least one other graph with the same Smith normal form (coinvariant mate) with respect to several matrices associated to a graph. The presented numerical data give some indication that possibly the Smith normal form of the distance Laplacian and the signless distance Laplacian matrices could be a finer invariant than the spectrum to distinguish graphs. Finally, we prove a graph characterization using the Smith normal form of the distance signless Laplacian matrix.

A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix