Related papers: Specht's criterion for systems of linear mappings

We consider the following fundamental realization problem of directed graphs. Given a sequence $S:={a_1 \choose b_1},\dots,{a_n \choose b_n}$ with $a_i,b_i\in \mathbb{Z}_0^+.$ Does there exist a digraph (no loops and no parallel arcs are…

Let $K$ be a field, $R=K[x, y]$ the polynomial ring and $\mathcal{M}(K)$ the set of all pairs of square matrices of the same size over $K.$ Pairs $P_1=(A_1,B_1)$ and $P_2=(A_2,B_2)$ from $\mathcal{M}(K)$ are called similar if…

Suppose $G$ is a controllable graph of order $n$ with adjacency matrix $A$. Let $W=[e,Ae,\ldots,A^{n-1}e]$ ($e$ is the all-one vector) and $\Delta=\prod_{i>j}(\alpha_i-\alpha_j)^2$ ($\alpha_i$'s are eigenvalues of $A$) be the walk matrix…

A foundational question in the theory of linear compartmental models is how to assess whether a model is structurally identifiable -- that is, whether parameter values can be inferred from noiseless data -- directly from the combinatorics…

We give a characterization of the effect of sequences of pivot operations on a graph by relating it to determinants of adjacency matrices. This allows us to deduce that two sequences of pivot operations are equivalent iff they contain the…

A half-square of a bipartite graph $B=(X,Y,E_B)$ has one color class of $B$ as vertex set, say $X$; two vertices are adjacent whenever they have a common neighbor in $Y$. If $G=(V,E_G)$ is the half-square of a planar bipartite graph…

This note is concerned with isometries on the spaces of self-adjoint traceless matrices. We compute the group of isometries with respect to any unitary similarity invariant norm. This completes and extends the result of Nagy on Schatten…

Using techniques introduced by H. Thomas and N. Williams in "Cyclic Symmetry of the Scaled Simplex," we prove that modular sweep maps are bijective. We construct the inverse of the modular sweep map by passing through an intermediary set of…

For a given class of structured matrices $\mathbb S$, we find necessary and sufficient conditions on vectors $x,w\in \C^{n+m}$ and $y,z \in \C^{n}$ for which there exists $\Delta=[\Delta_1~\Delta_2]$ with $\Delta_1 \in \mathbb S$ and…

A linked system of symmetric designs (LSSD) is a $w$-partite graph ($w\geq 2$) where the incidence between any two parts corresponds to a symmetric design and the designs arising from three parts are related. The original construction for…

Given two symmetric and positive semidefinite square matrices $A, B$, is it true that any matrix given as the product of $m$ copies of $A$ and $n$ copies of $B$ in a particular sequence must be dominated in the spectral norm by the ordered…

The Consecutive Ones Property is an important notion for binary matrices, both from a theoretical and applied point of view. Tucker gave in 1972 a characterization of matrices that do not satisfy the Consecutive Ones Property in terms of…

We define the $p$-adic trace of certain rank-one local systems on the multiplicative group over $p$-adic numbers, using Sekiguchi and Suwa's unification of Kummer and Artin-Schrier-Witt theories. Our main observation is that, for every…

In the main result of the paper we extend Rosenthal's characterization of Banach spaces with the Schur property by showing that for a quasi-complete locally convex space $E$ whose separable bounded sets are metrizable the following…

As a follow-up to a paper of D. Petz and J. Zem\'anek [4], a number of equivalent conditions which characterize the trace among linear functionals on matrix algebras, finite rank operators and the socle elements of semisimple Banach…

Let $\mathcal A:U\to V$ be a linear mapping between vector spaces $U$ and $V$ over a field or skew field $\mathbb F$ with symmetric, or skew-symmetric, or Hermitian forms $\mathcal B:U\times U\to\mathbb F$ and $\mathcal C:V\times…

We introduce a class of linear compartmental models called identifiable path/cycle models which have the property that all of the monomial functions of parameters associated to the directed cycles and paths from input compartments to output…

Let $(W,S)$ be a Coxeter system whose graph is connected, with no infinite edges. A self-map $\tau$ of $W$ such that $\tau_{\sigma\theta}\in \{\tau_{\theta},\ \sigma\tau_{\theta}\}$ for all $\theta\in W$ and all reflections $\sigma$…

An $n$-by-$n$ ($n\ge 3$) weighted shift matrix $A$ is one of the form $$[{array}{cccc}0 & a_1 & & & 0 & \ddots & & & \ddots & a_{n-1} a_n & & & 0{array}],$$ where the $a_j$'s, called the weights of $A$, are complex numbers. Assume that all…

Docovic and Szechtman, [Proc. Amer. Math. Soc. 133 (2005) 2853-2863] considered a vector space V endowed with a bilinear form. They proved that all isometries of V over a field F of characteristic not 2 have determinant 1 if and only if V…