English
Related papers

Related papers: Cretan(4t+1) Matrices

200 papers

For every positive integer $n$ greater than $4$ there is a set of Latin squares of order $n$ such that every permutation of the numbers $1,\ldots,n$ appears exactly once as a row, a column, a reverse row or a reverse column of one of the…

Combinatorics · Mathematics 2020-06-11 Stephan Foldes , András Kaszanyitzky , Laszlo Major

The Kauffman bracket skein modules, S(M,A), have been calculated for A=+1,-1, for all 3-manifolds M by relating them to the SL(2,C)-character varieties. We extend this description to the case when A is a 4-th root of 1 and M is either a…

Geometric Topology · Mathematics 2015-05-27 Adam S. Sikora

This paper proposes a novel matrix rank-one decomposition for quaternion Hermitian matrices, which admits a stronger property than the previous results in (sturm2003cones,huang2007complex,ai2011new). The enhanced property can be used to…

Optimization and Control · Mathematics 2021-09-14 Chang He , Bo Jiang , Xihua Zhu

In this study, we introduce the concept of commutative quaternions and commutative quaternion matrices. Firstly, we give some properties of commutative quaternions and their Hamilton matrices. After that we investigate commutative…

Algebraic Geometry · Mathematics 2016-11-26 Hidayet Hüda Kösal , Murat Tosun

In this paper, by using matix representation for quaternions andoctonions, we provide a procedure to obtain some example of k potent matrices of order 4 or 8, over the real field or over the field ZP, with p a prime number.

Rings and Algebras · Mathematics 2024-11-07 Cristina Flaut , Andreea Baias

Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes.…

Information Theory · Computer Science 2017-10-16 Somphong Jitman , Todsapol Mankean

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

An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…

Mathematical Physics · Physics 2010-11-02 Petre Dita

Hadamard ideals were introduced in 2006 as a set of nonlinear polynomial equations whose zeros are uniquely related to Hadamard matrices with one or two circulant cores of a given order. Based on this idea, the cocyclic Hadamard test enable…

Combinatorics · Mathematics 2019-01-08 V. Álvarez , J. A. Armario , R. M. Falcón , M. D. Frau , F. Gudiel

We give a precise asymptotic formula for the number of $n\times 4t$ partial Hadamard matrices in the regimes $t/n^3\to\infty$ and $t/n^3\to\Theta$ for sufficiently large fixed $\Theta$. This strengthens earlier results of de~Launey and…

Probability · Mathematics 2026-04-01 Damek Davis

Racah matrices and higher $j$-symbols are used in description of braiding properties of conformal blocks and in construction of knot polynomials. However, in complicated cases the logic is actually inverted: they are much better deduced…

High Energy Physics - Theory · Physics 2017-01-26 A. Morozov

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

In this paper Butson-type complex Hadamard matrices $\mathrm{BH}(n,q)$ of order $n$ and complexity $q$ are classified for small parameters by computer-aided methods. Our main results include the enumeration of $\mathrm{BH}(21,3)$,…

Combinatorics · Mathematics 2017-07-10 P. H. J. Lampio , P. Östergård , F. Szöllősi

A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot product of every two distinct columns takes at most two values. This definition was introduced by Kharaghani and Suda in 2019, although…

Combinatorics · Mathematics 2023-02-03 Jonathan Jedwab , Shuxing Li , Samuel Simon

Hadamard matrices, orthogonal designs and amicable orthogonal designs have a number of applications in coding theory, cryptography, wireless network communication and so on. Product designs were introduced by Robinson in order to construct…

Combinatorics · Mathematics 2015-09-15 Ebrahim Ghaderpour

The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups…

Group Theory · Mathematics 2024-01-17 M. A. Pellegrini , M. C. Tamburini Bellani

There are several well-known methods that one can use to construct Hadamard matrices from base sequences BS(m,n). In view of the recent classification of base sequences BS(n+1,n) for n <= 30, it may be of interest to show on an example how…

Combinatorics · Mathematics 2011-06-16 Dragomir Z. Djokovic

We study Jordan types of linear forms for graded Artinian Gorenstein algebras having arbitrary codimension. We introduce rank matrices of linear forms for such algebras that represent the ranks of multiplication maps in various degrees. We…

Commutative Algebra · Mathematics 2022-04-12 Nasrin Altafi

Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…

Complex Variables · Mathematics 2007-05-23 Silviu Olariu

The ranks and kernels of generalized Hadamard matrices are studied. It is proven that any generalized Hadamard matrix $H(q,\lambda)$ over $F_q$, $q>3$, or $q=3$ and $\gcd(3,\lambda)\not =1$, generates a self-orthogonal code. This result…

Information Theory · Computer Science 2016-11-15 Steven T. Dougherty , Josep Rifà , Mercè Villanueva