English
Related papers

Related papers: Real matrices whose columns have equal modulus coo…

200 papers

Let A be an n*n matrix with entries a_ij in the field C. Consider the following two involutive operations on such matrices: the matrix inversion I: A -> A^-1 and the element-by-element (or Hadamard) inversion J: a_ij -> a_ij^-1. We study…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 I. G. Korepanov

We study the existence and construction of circulant matrices $C$ of order $n\geq2$ with diagonal entries $d\geq0$, off-diagonal entries $\pm1$ and mutually orthogonal rows. These matrices generalize circulant conference ($d=0$) and…

Combinatorics · Mathematics 2019-02-05 Ondřej Turek , Dardo Goyeneche

A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…

Combinatorics · Mathematics 2014-11-20 Ron M. Adin , Yuval Roichman

In this paper, the $mn$-dimensional space of tensor-product polynomials of two variables, of degree at most $(m-1)+(n-1)$, is considered. A theory of two-variate polynomials is developed by establishing the algebra and basic algebraic…

General Mathematics · Mathematics 2017-12-29 Dharm Prakash Singh , Amit Ujlayan

We develop a general theory of "almost Hadamard matrices". These are by definition the matrices $H\in M_N(\mathbb R)$ having the property that $U=H/\sqrt{N}$ is orthogonal, and is a local maximum of the 1-norm on O(N). Our study includes a…

Combinatorics · Mathematics 2013-02-19 Teodor Banica , Ion Nechita , Karol Zyczkowski

We consider certain matrix-products where successive matrices in the product belong alternately to a particular qualitative class or its transpose. The main theorems relate structural and spectral properties of these matrix-products to the…

Combinatorics · Mathematics 2015-02-25 Murad Banaji , Carrie Rutherford

An $m \times (n+1)$ multiplicity matrix is a matrix $M = ( \mu_{i,j} )$ with rows enumerated by $i \in \{ 1,\ 2, \ldots, m \}$ and columns enumerated by $j \in \{ 0,1,\ldots, n \}$ whose coordinates are nonnegative integers satisfying the…

Number Theory · Mathematics 2022-12-14 Melvyn B. Nathanson

We describe combinatorial properties of the defining row of a circulant Hadamard matrix by exploiting its orthogonality to subsequent rows, and show how to exclude several particular forms of these matrices.

Combinatorics · Mathematics 2024-06-18 Luis H. Gallardo , Olivier Rahavandrainy , Reinhardt. Euler

We recognise Harada's generalized categories of diagrams as a particular case of modules over a monad defined on a finite direct product of additive categories. We work in the dual (albeit formally equivalent) situation, that is, with…

Rings and Algebras · Mathematics 2015-04-29 Laiachi El Kaoutit , José Gómez-Torrecillas

We investigate the existence of heavy columns in binary matrices with distinct rows. A column of an m x n binary matrix is called heavy if the number of ones in it is at least m/2. We introduce two recursive algorithms, A1 and A2, that…

Discrete Mathematics · Computer Science 2026-01-27 Jamolidin K. Abdurakhmanov

Using the ideas of concatenation construction of codes over the $q$-ary alphabet, we modify the known generalized Sylvester-type construction of the Hadamard matrices. The new construction is based on two collections of the Hadamard…

Combinatorics · Mathematics 2022-11-02 Dmitrii Zinoviev , Victor Zinoviev

Given a definite nonnegative matrix $A \in M_n (C)$, we study the minimal index of A: $I(A) = \max \{\lambda \ge 0 : A\circ B \ge \lambda B$ for all $0\le B\}$, where $A\circ B$ denotes the Hadamard product $(A\circ B)_{ij} = A_{ij}…

Rings and Algebras · Mathematics 2007-05-23 G. Corach , D. Stojanoff

We study two matrices $N$ and $M$ defined by the parameters of equivalent $S$- and $J$-continued fraction expansions, and compare them by examining the product $N^{-1}M$. Using examples based on the Catalan numbers, the little Schr\"oder…

Combinatorics · Mathematics 2013-12-02 Paul Barry

The Hadamard Extension of a matrix is the matrix consisting of all Hadamard products of subsets of its rows. This construction arises in the context of identifying a mixture of product distributions on binary random variables: full column…

Machine Learning · Computer Science 2021-02-16 Spencer L. Gordon , Leonard J. Schulman

An invertible matrix is called a Perron similarity if one of its columns and the corresponding row of its inverse are both nonnegative or both nonpositive. Such matrices are of relevance and import in the study of the nonnegative inverse…

Spectral Theory · Mathematics 2021-10-28 Janelle M. Dockter , Pietro Paparella , Robert L. Perry , Jonathan D Ta

We show that a matrix is a Hermitian positive semidefinite matrix whose nonzero entries have modulus 1 if and only if it similar to a direct sum of all $1's$ matrices and a 0 matrix via a unitary monomial similarity. In particular, the only…

Rings and Algebras · Mathematics 2007-05-23 Daniel Hershkowitz , Michael Neumann , Hans Schneider

Let $m,n>1$ be integers and $\mathbb{P}_{n,m}$ be the point set of the projective $(n-1)$-space (defined by [2]) over the ring $\mathbb{Z}_m$of integers modulo $m$. Let $A_{n,m}=(a_{uv})$ be the matrix with rows and columns being labeled by…

Discrete Mathematics · Computer Science 2013-04-01 Liang Feng Zhang

Louis W. Shapiro gave a combinatorial proof of a bilinear generating function for Chebyshev polynomials equivalent to the formula 1/(1-ax-x^2) * 1/(1-bx-x^2) = (1-x^2)/(1-abx-(2+a^2+b^2)x^2 -abx^3+x^4), where * denotes the Hadamard product.…

Combinatorics · Mathematics 2011-07-21 Jong Hyun Kim

We prove that there is no circulant Hadamard matrix $H$ with first row $[h_{1},\ldots,h_{n}]$ of order $n>4$, under a condition about a sum of scalar products of rows of two other circulant matrices of size $n/2$ associated to $H.$

Number Theory · Mathematics 2019-03-25 Luis H. Gallardo

First examples of symmetric Hadamard matrices of orders 508 and 764 are constructed. The method used is known as the propus construction. A conjecture regarding this method is formally proposed but it appears implicitly in three previous…

Combinatorics · Mathematics 2024-04-23 Dragomir Ž. Đoković