Related papers: Well-Quasi-Ordering of Matrices under Schur Comple…

A matrix is totally positive if all of its minors are positive. This notion of positivity coincides with the type A version of Lusztig's more general total positivity in reductive real-split algebraic groups. Since skew-symmetric matrices…

Given a complete, positively filtered ring $(R,f)$ and a compatible skew derivation $(\sigma,\delta)$, we may construct its skew power series ring $R[[x;\sigma,\delta]]$. Due to topological obstructions, even if $\delta$ is an \emph{inner}…

Let $r$ and $n$ be positive integers such that $r<n$, and $\mathbb{K}$ be an arbitrary field. In a recent work, we have determined the maximal dimension for a linear subspace of $n$ by $n$ symmetric matrices with rank less than or equal to…

We establish a list of characterizations of bounded twin-width for hereditary, totally ordered binary structures. This has several consequences. First, it allows us to show that a (hereditary) class of matrices over a finite alphabet either…

Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their homomorphisms. Therefore, we consider related problems from…

Finite metric spaces are characterized by a polyhedral cone defined in terms of the positivity of the distance functions and the triangle inequalities. Their classification is based on the decomposition of an associated polyhedral cone,…

The spread of a real symmetric matrix is defined as the difference between its largest and smallest eigenvalue. The study of graph-related matrices has attracted considerable attention, leading to a substantial body of findings. In this…

Let $(\sigma,\delta)$ be a quasi derivation of a ring $R$ and $M_R$ a right $R$-module. In this paper, we introduce the notion of $(\sigma,\delta)$-skew McCoy modules which extends the notion of McCoy modules and $\sigma$-skew McCoy…

We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…

A Steinhaus matrix is a binary square matrix of size $n$ which is symmetric, with diagonal of zeros, and whose upper-triangular coefficients satisfy $a_{i,j}=a_{i-1,j-1}+a_{i-1,j}$ for all $2\leq i<j\leq n$. Steinhaus matrices are…

We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly…

The almost-principal rank characteristic sequence (apr-sequence) of an $n\times n$ symmetric matrix is introduced, which is defined to be the string $a_1 a_2 \cdots a_{n-1}$, where $a_k$ is either $\tt A$, $\tt S$, or $\tt N$, according as…

Recently, the saturation problem of $0$-$1$ matrices gained a lot of attention. This problem can be regarded as a saturation problem of ordered bipartite graphs. Motivated by this, we initiate the study of the saturation problem of ordered…

This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…

Our motivation comes from the work of Engel and Schneider (1980). Their main theorem implies that two symmetric matrices have equal corresponding principal minors of all orders if and only if they are diagonally similar. This study was…

Let $\mathrm{Sym}_q(m)$ be the space of symmetric matrices in $\mathbb{F}_q^{m\times m}$. A subspace of $\mathrm{Sym}_q(m)$ equipped with the rank distance is called a symmetric rank-metric code. In this paper we study the covering…

Most of the existing works on provable guarantees for low-rank matrix completion algorithms rely on some unrealistic assumptions such that matrix entries are sampled randomly or the sampling pattern has a specific structure. In this work,…

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

A subset $M$ of the edges of a graph $G$ is a matching if no two edges in $M$ are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S$ of vertices of a graph $G$ with no isolated vertices is a…

Let $\FF$ be an arbitrary field and $(\bm{G}_{n,d/n})_n$ be a sequence of sparse weighted Erd\H{o}s-R\'enyi random graphs on $n$ vertices with edge probability $d/n$, where weights from $\FF \setminus\{0\}$ are assigned to the edges…