Related papers: 0-1 matrices with zero trace whose squares are 0-1…

A fooling-set matrix has nonzero diagonal, but at least one in every pair of diagonally opposite entries is 0. Dietzfelbinger et al. '96 proved that the rank of such a matrix is at least $\sqrt n$. It is known that the bound is tight (up to…

N-matrices are real $n\times n$ matrices all of whose principal minors are negative. We provide (i) an $O(2^n)$ test to detect whether or not a given matrix is an N-matrix, and (ii) a characterization of N-matrices, leading to the recursive…

We consider rectangle graphs whose edges are defined by pairs of points in diagonally opposite corners of empty axis-aligned rectangles. The maximum number of edges of such a graph on $n$ points is shown to be 1/4 n^2 +n -2. This number…

Given any commutative ring $R$, a commutator of two $n\times n$ matrices over $R$ has trace $0$. In this paper, we study the converse: whether every $n \times n$ trace $0$ matrix is a commutator. We show that if $R$ is a B\'{e}zout domain…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. We determine the maximum order of reduced triangle-free…

This paper presents results on maximal runs, order of squares, palindromes, and unbordered factors of members of the family of binary pattern sequences with the all-one pattern. Restricting ourselves to binary pattern sequences with the…

We generalise our earlier work on the number of squares in binary recurrence sequences, $\left\{ y_{k} \right\}_{k \geq -\infty}$. In the notation of our previous papers, here we consider the case when $N_{\alpha}$ is any negative integer…

We carry out a complete and systematic study of all the possible one-zero textures for the neutrino mass matrix in light of the recent neutrino oscillation data which hint to a relatively large non-vanishing value for the smallest mixing…

A finite set $A$ of integers is square-sum-free if there is no subset of $A$ sums up to a square. In 1986, Erd\H os posed the problem of determining the largest cardinality of a square-sum-free subset of $\{1, ..., n \}$. Answering this…

A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. Recently, Csikvari proved the existence of integral trees of any even diameter. In the odd case, integral trees have been constructed with…

An $n\times n$ zero pattern $S$, which is a matrix with entries $*$ and $0$, is called spectrally arbitrary with respect to a field $F$ if any monic polynomial $f$ of degree $n$ can be realized as the characteristic polynomial of a matrix…

The number of $n \times n$ matrices whose entries are either -1, 0, or 1, whose row- and column- sums are all 1, and such that in every row and every column the non-zero entries alternate in sign, is proved to be $[1!4! >...…

Let $\mathcal{Q}$ be a quaternion division algebra over a field, and $n \geq 2$ be an integer. In a recent article, de La Cruz et al have proved that every $n$-by-$n$ matrix with entries in $\mathcal{Q}$ and pure quaternionic trace is the…

We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain…

An explicit upper bound is established for the least non-trivial integer zero of an arbitrary cubic form $C \in \mathbb{Z}[X_1,...,X_n],$ provided that $n \geq 14.$

We consider the set $\mathcal M_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial…

In this paper we characterize invertible matrices over an arbitrary commutative antiring S and find the structure of GL_n (S). We find the number of nilpotent matrices over an entire commutative finite antiring. We prove that every…

Let $A \in {\cal C}^n$ be an extremal copositive matrix with unit diagonal. Then the minimal zeros of $A$ all have supports of cardinality two if and only if the elements of $A$ are all from the set $\{-1,0,1\}$. Thus the extremal…

We point attention to the fact that in SO(10) models with non-canonical (type II) see-saw mechanism and exact b-tau unification the trace of the neutrino mass matrix is very small, in fact practically zero. This has the advantage of being a…

Denote by $A_n$ the set of square $(0,1)$ matrices of order $n$. The set $A_n$, $n\le8$, is partitioned into row/column permutation equivalence classes enabling derivation of various facts by simple counting. For example, the number of…