相关论文: 0-1 matrices with zero trace whose squares are 0-1…

We study the structure of the codifferent and of additively indecomposable integers in families of totally real cubic fields. We prove that for cubic orders in these fields, the minimal trace of indecomposable integers multiplied by totally…

In this note we show that the maximum number of vertices in any polyhedron $P=\{x\in \mathbb{R}^d : Ax\leq b\}$ with $0,1$-constraint matrix $A$ and a real vector $b$ is at most $d!$.

Let $M_n(K)$ denote the algebra of $n \times n$ matrices over a field $K$ of characteristic zero. A nonunital subalgebra $N \subset M_n(K)$ will be called a nonunital intersection if $N$ is the intersection of two unital subalgebras of…

We provide an explicit description of the maximal-dimensional components of the variety parametrizing sequences of matrices of prescribed sizes whose product is zero.

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…

The literature on quaternionic polynomials and, in particular, on methods for determining and classifying their zero-sets, is fast developing and reveals a growing interest on this subject. In contrast, polynomials defined over the algebra…

Let $n,k,t$ be positive integers. What is the maximum number of arcs in a digraph on $n$ vertices in which there are at most $t$ distinct walks of length $k$ with the same endpoints? In this paper, we prove that the maximum number is equal…

We study the maximum number of quads among $\ell$ cards from an EvenQuads deck of size $2^n$. This corresponds to enumerating quadruples of integers in the range $[0,\ell-1]$ such that their bitwise XOR is zero. In this paper, we conjecture…

A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…

A {\it vertex-ordered} graph is a graph equipped with a linear ordering of its vertices. A pair of independent edges in an ordered graph can exhibit one of the following three patterns: separated, nested or crossing. We say a pair of…

This paper is concerned with the problem of finding $n$ distinct squares such that, on excluding any one of them, the sum of the remaining $n-1$ squares is a square. While parametric solutions are known when $n=3$ and $n=4$, when $n > 4$,…

In the light of latest neutrino oscillation data, we have investigated the one zero Majorana neutrino mass matrix $M_{\nu}$ with zero sum condition of mass eigen values in the flavor basis, where charged lepton mass matrix is diagonal.…

We investigate neutrino mass matrix phenomenology involving scaling ansatz and texture zeros adhering inverse seesaw mechanism. It is seen that four is the maximum number of zeros in $m_D$ and $\mu$ to obtain viable phenomenology. Depending…

We show that for every subset $E$ of positive density in the set of integer square-matrices with zero traces, there exists an integer $k \geq 1$ such that the set of characteristic polynomials of matrices in $E-E$ contains the set of…

For an $n$-by-$n$ complex matrix $A$, we define its zero-dilation index $d(A)$ as the largest size of a zero matrix which can be dilated to $A$. This is the same as the maximum $k$ ($\ge 1$) for which 0 is in the rank-$k$ numerical range of…

We determine the maximum number of edges in a $K_4$-minor-free $n$-vertex graph of girth $g$, when $g = 5$ or $g$ is even. We argue that there are many different $n$-vertex extremal graphs, if $n$ is even and $g$ is odd.

A real symmetric n times n matrix is called copositive if the corresponding quadratic form is non-negative on the closed first orthant. If the matrix fails to be copositive there exists some non-negative certificate for which the quadratic…

We investigate unbiased weighing matrices of weight $9$ and provide a construction method using mutually suitable Latin squares. For $n \le 16$, we determine the maximum size among sets of mutually unbiased weighing matrices of order $n$…

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…

We study {\em sign-restricted matrices} (SRMs), a class of rectangular $(0, \pm 1)$-matrices generalizing the alternating sign matrices (ASMs). In an SRM each partial column sum, starting from row 1, equals 0 or 1, and each partial row sum,…