English
Related papers

Related papers: Circulant conference matrices for new complex Hada…

200 papers

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…

Combinatorics · Mathematics 2017-09-06 Olivia Di Matteo , Dragomir Z. Djokovic , Ilias S. Kotsireas

Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…

Mathematical Physics · Physics 2022-02-03 Joshua Feinberg , Roman Riser

In this paper, we find regular or biregular Hadamard matrices with maximum excess by negating some rows and columns of known Hadamard matrices obtained from quadratic residues of finite fields. In particular, we show that if either…

Combinatorics · Mathematics 2017-12-27 Mitsugu Hirasaka , Koji Momihara , Sho Suda

An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of…

Chaotic Dynamics · Physics 2009-11-07 K. Zyczkowski , W. Slomczynski , M. Kus , H. -J. Sommers

In this paper we give a new construction of parametric families of complex Hadamard matrices of square orders, and connect them to equiangular tight frames. The results presented here generalize some of the recent ideas of Bodmann et al.…

Functional Analysis · Mathematics 2011-04-19 Ferenc Szöllősi

We enumerate all circulant good matrices with odd orders divisible by 3 up to order 70. As a consequence of this we find a previously overlooked set of good matrices of order 27 and a new set of good matrices of order 57. We also find that…

Logic in Computer Science · Computer Science 2019-07-30 Curtis Bright , Dragomir Z. Djokovic , Ilias Kotsireas , Vijay Ganesh

This paper considers random (non-Hermitian) circulant matrices, and proves several results analogous to recent theorems on non-Hermitian random matrices with independent entries. In particular, the limiting spectral distribution of a random…

Probability · Mathematics 2011-02-01 Mark W. Meckes

We give a new construction of the outer automorphism of the symmetric group on six points. Our construction features a complex Hadamard matrix of order six containing third roots of unity and the algebra of split quaternions over the real…

Combinatorics · Mathematics 2018-05-04 Neil Gillespie , Padraig Ó Catháin , Cheryl Praeger

This article is a short review on the relationship between convergent matrix integrals, formal matrix integrals, and combinatorics of maps. We briefly summarize results developed over the last 30 years, as well as more recent discoveries.…

Mathematical Physics · Physics 2007-05-23 Bertrand Eynard

This paper is a continuation of \ct{cmf16} where an efficient algorithm for computing the maximal eigenpair was introduced first for tridiagonal matrices and then extended to the irreducible matrices with nonnegative off-diagonal elements.…

Probability · Mathematics 2017-06-26 Mu-Fa Chen

We introduce a class of regular unit Hadamard matrices whose entries consist of two complex numbers and their conjugates for a total of four complex numbers. We then show that these matrices are contained in the Bose-Mesner algebra of an…

Combinatorics · Mathematics 2017-09-12 Kai Fender , Hadi Kharaghani , Sho Suda

Two trace formulas for the spectra of arbitrary Hermitian matrices are derived by transforming the given Hermitian matrix $H$ to a unitary analogue. In the first type the unitary matrix is $e^{i(\lambda\II - H)}$ where $\lambda$ is the…

Mathematical Physics · Physics 2020-01-29 Sven Gnutzmann , Uzy Smilansky

In this paper, we give the complete structures of the equivalence canonical form of four matrices over an arbitrary division ring. As applications, we derive some practical necessary and sufficient conditions for the solvability to some…

Rings and Algebras · Mathematics 2017-02-03 Zhuo-Heng He , Qing-Wen Wang , Yang Zhang

In this paper, we developed new numeric and symbolic algorithms to find the inverse of any nonsingular heptadiagonal matrix. Symbolic algorithm will not break and it is without setting any restrictive conditions. The computational cost of…

Numerical Analysis · Mathematics 2014-12-19 A. A. Karawia

One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…

Machine Learning · Computer Science 2018-01-04 Jarek Duda

The pattern of a matrix M is a (0,1)-matrix which replaces all non-zero entries of M with a 1. There are several contexts in which studying the patterns of orthogonal matrices can be useful. One necessary condition for a matrix to be…

Combinatorics · Mathematics 2007-05-23 J. Richard Lundgren , Simone Severini , Dustin J. Stewart

In the current work, the author present a symbolic algorithm for finding the determinant of any general nonsingular cyclic heptadiagonal matrices and inverse of anti-cyclic heptadiagonal matrices. The algorithms are mainly based on the work…

Symbolic Computation · Computer Science 2015-03-17 A. A. Karawia

A three-parameter family of complex Hadamard matrices of order 6 is presented. It significantly extends the set of closed form complex Hadamard matrices of this order, and in particular contains all previously described one- and…

Mathematical Physics · Physics 2013-06-12 Bengt R. Karlsson

The defect of a complex Hadamard matrix $H$ is an upper bound for the dimension of a continuous Hadamard orbit stemming from $H$. We provide a new interpretation of the defect as the dimension of the center subspace of a gradient flow and…

Mathematical Physics · Physics 2016-11-02 Francis C. Motta , Patrick D. Shipman

Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…

Optimization and Control · Mathematics 2015-06-17 Dmitriy Drusvyatskiy , Hon-Leung Lee , Rekha R. Thomas