Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
1 answer
98 views

One question about nega-cyclic Hadamard matrices

Let $n$ be a multiple of $4$, is there any $n \times n$ negacyclic Hadamard matrix? If yes - how to construct it? If no - why? Here an $n \times n$ nega-cyclic matrix is a square matrix of the form: \...
user369335's user avatar
8 votes
3 answers
1k views

Conjecture on the existence of centrosymmetric Hadamard matrices

I work with centrosymmetric matrices and recently have started exploring the question of the existence of centrosymmetric Hadamard matrices. Definition: An $n \times m$ matrix $A = (a_{i,j})$ is ...
Konrad Burnik's user avatar
7 votes
0 answers
224 views

Reference request: maximal determinant of matrices with pairwise orthogonal rows and entries in $\{1, 0, -1\}$

We know that "Hadamard maximal determinant problem" concerns the largest determinant of a matrix of oder $n$ with entries in $\{-1,1\}$ or $\{0, 1\}$. For $n=4k$, it is the Hadamard ...
Arun 's user avatar
  • 745
2 votes
1 answer
3k views

Number of 5x5 matrix permutations without repetitions in rows or columns

Context In the boardgame Azul, your goal is to complete as much as possible of a $5\times5$ board by placing 25 tiles of 5 different colours (5 tiles of each colour) so that no colour appears twice in ...
ami232's user avatar
  • 123
1 vote
1 answer
455 views

About the Hadamard conjecture

On the wikipedia article about Hadamard Matrix it says that "The smallest order that cannot be constructed by a combination of Sylvester's and Paley's methods is $92$" But it also says that ...
KfirKrak's user avatar
6 votes
3 answers
652 views

Real orthogonal and sign [closed]

I came across the following conjecture, reading a recent paper in the Monthly, an orthogonal matrix of order $n\neq 0 \pmod 4$ has a nonnegative (up to a scalar) row vector. It should be straight in ...
Toni Mhax's user avatar
  • 785
4 votes
0 answers
538 views

Orthogonal similarity of adjacency matrices of graphs which are cospectral and have a common equitable partition

Let $G$ and $H$ be two undirected graphs of the same order (i.e., they have the same number of vertices). Denote by $A_G$ and $A_H$ the corresponding adjacency matrices. Furthermore, denote by $\bar G$...
Sirolf's user avatar
  • 493
2 votes
2 answers
664 views

On $XX'=I$ such that $AX=XB$ is true when $A,B\in\{0,1\}^{n\times n}$

Given real symmetric matrices $A,B\in\{0,1\}^{n\times n}$ is it true that $$AX=XB$$ has a solution of form $X$ a permutation matrix iff a solution with $XX'=I$ exists? We are over reals. It is clear ...
Turbo's user avatar
  • 13.9k
17 votes
0 answers
434 views

Need explicit formula for certain "$q$-numbers" involving gcd's

The question is motivated by yet another possible approach to a combinatorial problem formulated previously in "Special" meanders. I'm not giving details of the connection as I believe the ...
მამუკა ჯიბლაძე's user avatar
1 vote
1 answer
276 views

Dense symmetric unitary integer matrix?

Can someone give me a nontrivial example of a symmetric unitary integer matrix? I'm looking for something as dense as possible (i.e., not too many 0's); 5 <= size <= 8 would be ideal.
Anonymous Coward's user avatar