Related papers: Totally bipartite tridiagonal pairs

We use Menger's Theorem and K\"onig's Line Colouring Theorem to show that in any tripartite graph with two complete (bipartite) sides the maximum number of pairwise edge-disjoint triangles equals the minimum number of edges that meet all…

We begin by reviewing the definition of 3-Lie algebras and the fundamental concepts of matched pairs. Subsequently, we introduce the representation theory of matched pairs and define the semidirect product. Building on this foundation, we…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

In this paper, we study the characters of two classes of P-polynomial table algebras using tridiagonal matrices. To this end, we obtain some results about the eigen-structure of special tridiagonal matrices. We also find a recursive…

Let $K$ denote a field, and let $V$ denote a vector space over $K$ with finite positive dimension. We consider a pair of linear transformations $A:V\to V$ and $A^*:V\to V$ that satisfy the following two conditions: There exists a basis for…

An operator of Heun-Askey-Wilson type is diagonalized within the framework of the algebraic Bethe ansatz using the theory of Leonard pairs. For different specializations and the generic case, the corresponding eigenstates are constructed in…

We say that a bipartite graph $G(A, B)$ with fixed parts $A$, $B$ is proximinal if there is a semimetric space $(X, d)$ such that $A$ and $B$ are disjoint proximinal subsets of $X$ and all edges $\{a, b\}$ satisfy the equality $d(a, b) =…

Let R be monomial sub-algebra of $k[x_1,...,x_N]$ generated by square free monomials of degree two. This paper addresses the following question: when is R a complete intersection? For such a k-algebra we can associate a graph G whose…

Let $\K$ denote a field and let $V$ denote a vector space over $\K$ with finite positive dimension. We consider an ordered pair of linear transformations $A:V\to V$ and $B:V\to V$ which satisfy both (i), (ii) below. (i) There exists a basis…

Consider a problem where we are given a bipartite graph H with vertices arranged on two horizontal lines in the plane, such that the two sets of vertices placed on the two lines form a bipartition of H. We additionally require that H admits…

The eigenpair here means the twins consist of eigenvalue and its eigenvector. This paper introduces the three steps of our study on computing the maximal eigenpair. In the first two steps, we construct efficient initials for a known but…

We show that each perfect matching in a bipartite graph $G$ intersects at least half of the perfect matchings in $G$. This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of…

Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…

The goal of this article is to clarify the relationship between the topos of triads and the neo-Riemannian PLR-group. To do this, we first develop some theory of generalized interval systems: 1) we prove the well known fact that every pair…

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

The orthogonal groups are a series of simple Lie groups associated to symmetric bilinear forms. There is no analogous series associated to symmetric trilinear forms. We introduce an infinite dimensional group-like object that can be viewed…

We study matrix three term relations for orthogonal polynomials in two variables constructed from orthogonal polynomials in one variable. Using the three term recurrence relation for the involved univariate orthogonal polynomials, the…

As part of our study of the $q$-tetrahedron algebra $\boxtimes_q$ we introduce the notion of a $q$-inverting pair. Roughly speaking, this is a pair of invertible semisimple linear transformations on a finite-dimensional vector space, each…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

We list the so-called Askey-scheme of hypergeometric orthogonal polynomials. In chapter 1 we give the definition, the orthogonality relation, the three term recurrence relation and generating functions of all classes of orthogonal…