English
Related papers

Related papers: On symmetric hollow integer matrices with eigenval…

200 papers

A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…

Combinatorics · Mathematics 2023-06-23 F. Scott Dahlgren , Zachary Gershkoff , Leslie Hogben , Sara Motlaghian , Derek Young

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

We consider real orthogonal $n\times n$ matrices whose diagonal entries are zero and off-diagonal entries nonzero, which we refer to as $\mathrm{OMZD}(n)$. We show that there exists an $\mathrm{OMZD}(n)$ if and only if $n\neq 1,\ 3$, and…

Combinatorics · Mathematics 2019-06-11 Robert F. Bailey , Robert Craigen

Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…

Combinatorics · Mathematics 2021-05-05 Ruslan Sharipov

Given a matrix $M = (a_{i,j})$ a square is a $2 \times 2$ submatrix with entries $a_{i,j}$, $a_{i, j+s}$, $a_{i+s, j}$, $a_{i+s, j +s}$ for some $s \geq 1$, and a zero-sum square is a square where the entries sum to $0$. Recently,…

Combinatorics · Mathematics 2023-05-18 Tom Johnston

We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular…

Combinatorics · Mathematics 2013-01-22 Brendan D. McKay , Jeanette C. McLeod

A symmetric ideal is an ideal in a polynomial ring which is stable under all permutations of the variables. In this paper we initiate a global study of zero-dimensional symmetric ideals. By this we mean a geometric study of the invariant…

Algebraic Geometry · Mathematics 2025-09-15 Sebastian Debus , Andreas Kretschmer

An $n\times n$ matrix is said to have a self-interlacing spectrum if its eigenvalues $\lambda_k$, $k=1,\ldots,n$, are distributed as follows $$ \lambda_1>-\lambda_2>\lambda_3>\cdots>(-1)^{n-1}\lambda_n>0. $$ A method for constructing sign…

Classical Analysis and ODEs · Mathematics 2025-07-01 Mikhail Tyaglov

We completely describe all integer symmetric matrices that have all their eigenvalues in the interval [-2,2]. Along the way we classify all signed graphs, and then all charged signed graphs, having all their eigenvalues in this same…

Combinatorics · Mathematics 2007-05-25 James McKee , Chris Smyth

A Hadamard matrix is a scaled orthogonal matrix with $\pm 1$ entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when $n$ is a multiple of 4. A conjecture attributed to Ryser is…

Combinatorics · Mathematics 2024-02-21 Stefan Steinerberger

For integer $n>0$, let $f(n)$ be the number of rows of the largest all-0 or all-1 square submatrix of $M$, minimized over all $n\times n$ $0/1$-matrices $M$. Thus $f(n)= O(\log n)$. But let us fix a matrix $H$, and define $f_H(n)$ to be the…

Combinatorics · Mathematics 2021-01-12 Alex Scott , Paul Seymour , Sophie Spirkl

A new sufficient condition for a list of real numbers to be the spectrum of a symmetric doubly stochastic matrix is presented; this is a contribution to the classical spectral inverse problem for symmetric doubly stochastic matrices that is…

Spectral Theory · Mathematics 2020-01-27 Michal Gnacik , Tomasz Kania

Given an $n\times n$ matrix with integer entries in the range $[-h,h]$, how close can two of its distinct eigenvalues be? The best previously known examples have a minimum gap of $h^{-O(n)}$. Here we give an explicit construction of…

Combinatorics · Mathematics 2023-06-14 Aaron Abrams , Zeph Landau , Jamie Pommersheim , Nikhil Srivastava

An $(n-1)$-tuple $a = (a(1), \dots, a(n-1))$ consisting of positive integers is said to be asymptotically hollow if there exist infinitely many positive integers $N$ such that the convex hull, $K(a(n))$, in $n$-dimensional Euclidean space…

Number Theory · Mathematics 2021-08-17 David Handelman

For $n\ge 5$, we prove that every $n\times n$ matrix $M=(a_{i,j})$ with entries in $\{-1,1\}$ and absolute discrepancy $|\mathrm{disc}(M)|=|\sum a_{i,j}|\le n$ contains a zero-sum square except for the split matrix (up to symmetries). Here,…

Combinatorics · Mathematics 2021-06-09 Alma R. Arévalo , Amanda Montejano , Edgardo Roldán-Pensado

Let $\Gamma$ denote a finite (strongly) connected regular (di)graph with adjacency matrix $A$. The {\em Hoffman polynomial} $h(t)$ of $\Gamma=\Gamma(A)$ is the unique polynomial of smallest degree satisfying $h(A)=J$, where $J$ denotes the…

Combinatorics · Mathematics 2024-03-04 Giusy Monzillo , Safet Penjić

We classify all cyclotomic matrices over real quadratic integer rings and we show that this classification is the same as classifying cyclotomic matrices over the compositum all real quadratic integer rings. Moreover, we enumerate a related…

Number Theory · Mathematics 2013-09-10 Gary Greaves

In this note we investigate the existence of flat orthogonal matrices, i.e. real orthogonal matrices with all entries having absolute value close to $\frac{1}{\sqrt{n}}$. Entries of $\pm \frac{1}{\sqrt{n}}$ correspond to Hadamard matrices,…

Combinatorics · Mathematics 2015-05-15 Philippe Jaming , Mate Matolcsi

We propose necessary and sufficient conditions for an integer matrix to be decomposable in terms of its Hermite normal form. Specifically, to each integer matrix of maximal row rank without columns of zeros, we associate a symmetric whole…

Combinatorics · Mathematics 2021-12-14 Carlos Marijuán , Ignacio Ojeda , Alberto Vigneron-Tenorio

In these notes, we consider the problem of finding the logarithm or the square root of a real matrix. It is known that for every real n x n matrix, A, if no real eigenvalue of A is negative or zero, then A has a real logarithm, that is,…

General Mathematics · Mathematics 2013-11-12 Jean Gallier
‹ Prev 1 2 3 10 Next ›