Related papers: Binary matrices of optimal autocorrelations as ali…
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partial row and column sums extending from each end of the row or…
It is well-known that every maximal planar graph has a matching of size at least $\tfrac{n+8}{3}$ if $n\geq 14$. In this paper, we investigate similar matching-bounds for maximal \emph{1-planar} graphs, i.e., graphs that can be drawn such…
This paper addresses the problem of synchronizing orthogonal matrices over directed graphs. For synchronized transformations (or matrices), composite transformations over loops equal the identity. We formulate the synchronization problem as…
We calculate the diameters of commuting graphs of matrices over the binary Boolean semiring, the tropical semiring and an arbitrary nonentire commutative semiring. We also find the lower bound for the diameter of the commuting graph of the…
In this paper, we introduce a particular class of matrices. We study the concept of a matrix to be \emph{balanced}. We study some properties of this concept in the context of matrix operations. We examine the behaviour of various matrix…
In this paper we study maximum size and minimum weight planar matchings of inhomogenous random bipartite graphs. Our motivation for this study comes from efficient usage of cross edges in relay networks for overall improvement in network…
Let $\mathscr{S}_n(q)$ denote the set of symmetric bilinear forms over an $n$-dimensional $\mathbb{F}_q$-vector space. A subset $\mathcal{C}$ of $\mathscr{S}_n(q)$ is called a $d$-code if the rank of $A-B$ is larger than or equal to $d$ for…
We call a family $\{Y_1,\dots,Y_I\}$ in Euclidean space an equidistance spacing if $\|y_i - y_j\| = 1$ whenever $y_i \in Y_i, y_j \in Y_j$ and $i \neq j$. In other words, choosing a representative from each set produces a complete distance…
Superregular matrices, i.e., matrices where all square submatrices are non-singular, have a wide range of applications in communications. A superregular block matrix is a broader concept where all full block submatrices, with the…
We develop lower bounds for the energy of configurations in $\mathbb{R}^d$ periodic with respect to a lattice. In certain cases, the construction of sharp bounds can be formulated as a finite dimensional, multivariate polynomial…
In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…
The most general form of non-static plane symmetric space-times is considered to study proper curvature collineations by using the rank of the 6X6 Riemann matrix and direct integration techniques. Studying proper curvature collineations in…
This article provides, over any field, infinitely many algebraic embeddings of the affine spaces $\mathbb{A}^1$ and $\mathbb{A}^2$ into smooth quadrics of dimension two and three respectively, which are pairwise non-equivalent under…
A new class of sign-symmetric matrices is introduced in this paper. Such matrices are named J--sign-symmetric. The spectrum of a J--sign-symmetric irreducible matrix is studied under assumptions that its second compound matrix is also…
Two matrices $A$ and $B$ are called unitary (resp. orthogonal) equivalent if $AU=VB$ for two unitary (resp. orthogonal) matrices $U$ and $V$. Using trace identities, criteria are given for simultaneous unitary, orthogonal or complex…
A new notion of bent sequence related to Hadamard matrices was introduced recently, motivated by a security application ( Sol\'e et al, 2021). We study the self dual class in length at most $196.$ We use three competing methods of…
For a binary matrix X, the Boolean rank br(X) is the smallest integer k for which X equals the Boolean sum of k rank-1 binary matrices, and the isolation number i(X) is the maximum number of 1s no two of which are in a same row, column and…
A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…
Incomplete pairwise comparison matrices are increasingly employed to save resources and reduce cognitive load by collecting only a subset of all possible pairwise comparisons. We present their graph representation and some completion…
Several novel mixed-integer linear and bilinear formulations are proposed for the optimum communication spanning tree problem. They implement the distance-based approach: graph distances are directly modeled by continuous, integral, or…