Related papers: Totally bipartite tridiagonal pairs
The weighted $\mathcal{T}$-free $2$-matching problem is the following problem: given an undirected graph $G$, a weight function on its edge set, and a set $\mathcal{T}$ of triangles in $G$, find a maximum weight $2$-matching containing no…
This paper is a continuation of \ct{cmf16} where an efficient algorithm for computing the maximal eigenpair was introduced first for tridiagonal matrices and then extended to the irreducible matrices with nonnegative off-diagonal elements.…
Let $\mathbb F$ denote a field, and let $V$ denote a vector space over $\mathbb F$ with finite positive dimension. We consider an ordered pair of $\mathbb F$-linear maps $A: V \to V$ and $A^*:V\to V$ such that (i) each of $A,A^*$ is…
This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…
In this paper we further develop the connection between tridiagonal pairs and the q-tetrahedron algebra $\boxtimes_q$. Let V denote a finite dimensional vector space over an algebraically closed field and let A, A^* denote a tridiagonal…
It is well known that a graph is bipartite if and only if the spectrum of its adjacency matrix is symmetric. In the present paper, this assertion is dissected into three separate matrix results of wider scope, which are extended also to…
The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…
A travel groupoid is an algebraic system satisfying two suitable conditions, which has a relation to graphs. In this article, we characterize travel groupoids on finite complete multipartite graphs, and we give the numbers of travel…
A new method to obtain trigonometry for the real spaces of constant curvature and metric of any (even degenerate) signature is presented. The method encapsulates trigonometry for all these spaces into a single basic trigonometric group…
We completely characterize triangulations of the projective plane that have a spanning bipartite quadrangulation subgraph. This is an affirmative answer to a question by K\"undgen and Ramamurthi (J Combin Theory Ser B 85, 307--337, 2002)…
Inspired by earlier works on representations of the Temperley-Lieb algebra we introduce a novel family of representations of the algebra. This may be seen as a generalization of the so called asymmetric twin representation. The underlying…
The standard generators of tridiagonal algebras, recently introduced by Terwilliger, are shown to generate a new (in)finite family of mutually commuting operators which extends the Dolan-Grady construction. The involution property relies on…
We introduce and study the notion of maximal tracial algebras. We prove several results in a general setting based on dual pairs and multiplier pairs. In a special case that X is a Banach space we determine the abelian subalgebras of B(X)…
Haxell's condition is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the…
A polyhedron is a graph $G$ which is simple, planar and 3-connected. In this note, we classify the family of strongly involutive self-dual polyhedra. The latter is done by using a well-known result due to Tutte characterizing 3-connected…
A paired $k$-to-$k$ disjoint path cover of a graph $G$ is a collection of pairwise disjoint path subgraphs $P_1,P_2,\dotsc,P_k$ such that each $P_i$ has prescribed vertices $s_i$ and $t_i$ as endpoints and the union of $P_1,P_2,\dotsc,P_k$…
The article presents the theoretical background of the algorithms for solving cyclic block tridiagonal and cyclic block penta-diagonal systems of linear algebraic equations present in ref [1] and [2]. The theory is based on the Woodbury…
Totally equimodular matrices generalize totally unimodular matrices and arise in the context of box-total dual integral polyhedra. This work further explores the parallels between these two classes and introduces foundational building…
In this paper, we review various properties of the supersymmetric Two Boson (sTB) system. We discuss the equation and its nonstandard Lax representation. We construct the local conserved charges as well as the Hamiltoniam structures of the…
We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union of random perfect matchings, and involves three…