Related papers: Specht's criterion for systems of linear mappings
The \textit{Kite graph}, denoted by $Kite_{p,q}$ is obtained by appending a complete graph $K_{p}$ to a pendant vertex of a path $P_{q}$. In this paper, firstly we show that no two non-isomorphic kite graphs are cospectral w.r.t adjacency…
Let $f(z,w)=(p(z),q(z,w))$ be a polynomial skew product such that the degrees of $p$ and $q$ are grater than or equal to $2$. Under one or two conditions, we prove that $f$ is conjugate to a monomial map on an invariant region near…
Two (real or complex) $m\times n$ matrices $A$ and $B$ are said to be parallel (resp. triangle equality attaining, or TEA in short) with respect to the spectral norm $\|\cdot\|$ if $\|A+ \mu B\| = \|A\| + \|B\|$ for some scalar $\mu$ with…
In this article we study the structured distance to singularity for a nonsingular matrix $A\in\mathbb{C}^{n\times n}$, with a prescribed linear structure $\mathcal{S}$ (for instance, a sparsity pattern, or a real Toeplitz structure), i.e.,…
We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…
Using geometric methods and without invoking deep results from group theory, we prove that a classical unital of even order $n\geq4$ is characterized by two conditions (I) and (II): (I) is the absence of O'Nan configurations of four…
Dipper, James and Murphy generalized the classical Specht module theory to Hecke algebras of type $B_n$. On the other hand, for any choice of a monomial order on the parameters in type $B_n$, we obtain corresponding Kazhdan--Lusztig cell…
We study the metric structure of walks on graphs, understood as Lipschitz sequences. To this end, a weighted metric is introduced to handle sequences, enabling the definition of distances between walks based on stepwise vertex distances and…
We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…
We prove the linearity and injectivity of two maps $\phi_1$ and $\phi_2$ on certain subsets of $M_n$ that satisfy $\operatorname{tr}(\phi_1(A)\phi_2(B))=\operatorname{tr}(AB)$. We apply it to characterize maps $\phi_i:\mathcal{S}\to…
This paper is concerned with establishing a trace minimization principle for two Hermitian matrix pairs. Specifically, we will answer the question: when is $\inf_X\operatorname{tr}(\widehat AX^{\rm H}AX)$ subject to $\widehat BX^{\rm…
The Weyl family of a dual pair $A\subseteq B^c$ of operators in a Krein space determines a minimal boundary triple uniquely up to similarity; if $A=B$, a necessary and sufficient condition in order that the similarity should be unitary is…
In this paper, we extend Meek's conjecture (Meek 1997) from directed and acyclic graphs to chain graphs, and prove that the extended conjecture is true. Specifically, we prove that if a chain graph H is an independence map of the…
We prove that every infinite sequence of skew-symmetric or symmetric matrices M_1, M_2, ... over a fixed finite field must have a pair M_i, M_j (i<j) such that M_i is isomorphic to a principal submatrix of the Schur complement of a…
The (chordal) Loewner differential equation encodes certain curves in the half-plane (aka traces) by continuous real-valued driving functions. Not all curves are traces; the latter can be defined via a geometric condition called the local…
We combine Kirchheim's metric differentials with Cheeger charts in order to establish a non-embeddability principle for any collection $\mathcal C$ of Banach (or metric) spaces: if a metric measure space $X$ bi-Lipschitz embeds in some…
Let $D$ be an digraph of order $n$ with adjacency matrix $A(D)$ and outdegree matrix $\Delta^+=\Delta^+(D)$. Then the Laplacian and signless Laplacian matrices of $D$ are respectively defined as $L(D)=\Delta^+-A(D)$ and…
A graph is said to be circular-arc if the vertices can be associated with arcs of a circle so that two vertices are adjacent if and only if the corresponding arcs overlap. It is proved that the isomorphism of circular-arc graphs can be…
The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $\in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps…
We obtain many objects of discrete differential geometry as reductions of skew parallelogram nets, a system of lattice equations that may be formulated for any unit associative algebra. The Lax representation is linear in the spectral…