Related papers: Basics on positively multiplicative graphs and alg…
A plabic graph is a planar bicolored graph embedded in a disk, which satisfies some combinatorial conditions. Postnikov's boundary measurement map takes the space of positive edge weights of a plabic graph $G$ to a positroid cell in some…
Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…
The representation of graphs is commonly based on the adjacency matrix concept. This formulation is the foundation of most algebraic and computational approaches to graph processing. The advent of deep learning language models offers a wide…
A signed graph has edge signs. A gain graph has oriented edge gains drawn from a group. We define the combination of the two for the abelian case, in which each oriented edge of a signed graph has a gain from an abelian group, concentrating…
Exposed positive maps in matrix algebras define a dense subset of extremal maps. We provide a sufficient condition for a positive map to be exposed. This is an analog of a spanning property which guaranties that a positive map is optimal.…
A $\mathbb{T}$-gain graph is a simple graph in which a unit complex number is assigned to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency matrix is defined canonically, and is…
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…
A real matrix is said to be positive if its every entry is positive, and a real square matrix A is algebraically positive if there exists a real polynomial f such that f(A) is a positive matrix. A sign pattern matrix A is said to require a…
Threshold graphs are a prevalent and widely studied class of simple graphs. They have several equivalent definitions which makes them a go-to class for finding examples and counter examples when testing and learning. This versatility has…
In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…
Let $(T,\langle \cdot, \cdot, \cdot \rangle)$ be a Leibniz triple system of arbitrary dimension, over an arbitrary base field ${\mathbb F}$. A basis ${\mathcal B} = \{e_{i}\}_{i \in I}$ of $T$ is called multiplicative if for any $i,j,k \in…
Several graph properties are characterized as the class of graphs that admit an orientation avoiding finitely many oriented structures. For instance, if $F_k$ is the set of homomorphic images of the directed path on $k+1$ vertices, then a…
We construct a class of positive linear maps on matrix algebras. We find conditions when these maps are atomic, decomposable and completely positive. We obtain a large class of atomic positive linear maps. As applications in quantum…
In the theory of line graphs of undirected graphs there exists an important theorem linking the incidence matrix of the root graph to the adjacency matrix of its line graph. For directed or mixed graphs, however, the exists no analogous…
Data processing systems impose multiple views on data as it is processed by the system. These views include spreadsheets, databases, matrices, and graphs. Associative arrays unify and simplify these different approaches into a common…
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…
A matching $M$ in a graph $\Gamma$ is positive if $\Gamma$ has a vertex-labeling such that $M$ coincides with the set of edges with positive weights. A positive matching decomposition (pmd) of $\Gamma$ is an edge-partition $M_1,\ldots,M_p$…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…