Displaying similar documents to “Construction of symmetric Hadamard matrices of order 4v for v = 47, 73, 113”

Symmetric Hadamard matrices of order 116 and 172 exist

Olivia Di Matteo, Dragomir Ž. Ðoković, Ilias S. Kotsireas (2015)

Special Matrices

Similarity:

We construct new symmetric Hadamard matrices of orders 92, 116, and 172. While the existence of those of order 92 was known since 1978, the orders 116 and 172 are new. Our construction is based on a recent new combinatorial array (GP array) discovered by N. A. Balonin and J. Seberry. For order 116 we used an adaptation of an algorithm for parallel collision search. The adaptation pertains to the modification of some aspects of the algorithm to make it suitable to solve a 3-way matching...

On isometries of the symmetric space P₁(3,ℝ)

Gašper Zadnik (2014)

Colloquium Mathematicae

Similarity:

We classify the isometries in the non-identity component of the whole isometry group of the symmetric space of positive 3 × 3 matrices of determinant 1: we determine the translation lengths, minimal spaces and fixed points at infinity.

Two-level Cretan matrices constructed using SBIBD

N. A. Balonin, Jennifer Seberry (2015)

Special Matrices

Similarity:

Two-level Cretan matrices are orthogonal matrices with two elements, x and y. At least one element per row and column is 1 and the other element has modulus ≤ 1. These have been studied in the Russian literature for applications in image processing and compression. Cretan matrices have been found by both mathematical and computational methods but this paper concentrates on mathematical solutions for the first time. We give, for the first time, families of Cretan matrices constructed...

Pentadiagonal Companion Matrices

Brydon Eastman, Kevin N. Vander Meulen (2016)

Special Matrices

Similarity:

The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally similar to a pentadiagonal matrix and describe how to find the permutation involved. In the process, we determine which of the Fiedler companion matrices are permutationally similar to a pentadiagonal matrix. We also describe how to find...

Elementary triangular matrices and inverses of k-Hessenberg and triangular matrices

Luis Verde-Star (2015)

Special Matrices

Similarity:

We use elementary triangular matrices to obtain some factorization, multiplication, and inversion properties of triangular matrices. We also obtain explicit expressions for the inverses of strict k-Hessenberg matrices and banded matrices. Our results can be extended to the cases of block triangular and block Hessenberg matrices. An n × n lower triangular matrix is called elementary if it is of the form I + C, where I is the identity matrix and C is lower triangular and has all of its...

An Inferentially Many-Valued Two-Dimensional Notion of Entailment

Carolina Blasio, João Marcos, Heinrich Wansing (2017)

Bulletin of the Section of Logic

Similarity:

Starting from the notions of q-entailment and p-entailment, a two-dimensional notion of entailment is developed with respect to certain generalized q-matrices referred to as B-matrices. After showing that every purely monotonic singleconclusion consequence relation is characterized by a class of B-matrices with respect to q-entailment as well as with respect to p-entailment, it is observed that, as a result, every such consequence relation has an inferentially four-valued characterization....