Related papers: Totally bipartite tridiagonal pairs
We introduce and study the higher tetrahedral algebras, an exotic family of finite-dimensional tame symmetric algebras over an algebraically closed field. The Gabriel quiver of such an algebra is the triangulation quiver associated to the…
The main contribution of this paper is a formula for the number of acyclic orientations of a complete bipartite, $K_{n_1,n_2},$ revealing that it is equal to the poly-Bernoulli number $B_{n_1}^{(-n_2)}$ introduced in 1997 by Kaneko. We also…
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…
Estimating the number of triangles in a graph is one of the most fundamental problems in sublinear algorithms. In this work, we provide an algorithm that approximately counts the number of triangles in a graph using only polylogarithmic…
Gross, Mansour and Tucker introduced the partial-twuality polynomial of a ribbon graph. Chumutov and Vignes-Tourneret posed a problem: it would be interesting to know whether the partial duality polynomial and the related conjectures would…
A square matrix is said to be circular bidiagonal whenever (i) each nonzero entry is on the diagonal, or the subdiagonal, or in the top-right corner; (ii) each subdiagonal entry is nonzero, and the entry in the top-right corner is nonzero.…
The algebraic underpinning of the tridiagonalization procedure is investigated. The focus is put on the tridiagonalization of the hypergeometric operator and its associated quadratic Jacobi algebra. It is shown that under…
In a disk graph, every vertex corresponds to a disk in $\mathbb{R}^2$ and two vertices are connected by an edge whenever the two corresponding disks intersect. Disk graphs form an important class of geometric intersection graphs, which…
This paper is a rigorous study of two dual pairs of momentum maps arising in the context of fluid equations whose configuration Lie group is the group of automorphism of a trivial principal bundle, generically called here non-abelian…
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
We review some current ideas about tripartite entanglement, the case representing the next level of complexity beyond the simplest one (though far from trivial), namely the bipartite. This kind of entanglement has an essential role in the…
Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…
The aim of this note is to give a gentle introduction to algebras of partial triangulations of marked surfaces, following the structure of a talk given during the 49th symposium on ring theory and representation theory, held in Osaka. This…
We lay down a general scheme to quantify the amount of genuine tripartite entanglement present in the spatial and energy-time degrees of freedom of entangled photon triplets using a resource-based measure known as the tripartite…
Recently Pascal Baseilhac and Stefan Kolb obtained a PBW basis for the $q$-Onsager algebra $\mathcal O_q$. They defined the PBW basis elements recursively, and it is obscure how to express them in closed form. To mitigate the difficulty, we…
We perform a detailed investigation of Bipartite Field Theories (BFTs), a general class of 4d N=1 gauge theories which are defined by bipartite graphs. This class of theories is considerably expanded by identifying a new way of assigning…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
Let $V$ denote a nonzero finite-dimensional vector space. A tridiagonal pair on $V$ is an ordered pair $A, A^*$ of maps in ${\rm End}(V)$ such that (i) each of $A, A^*$ is diagonalizable; (ii) there exists an ordering $\lbrace V_i…
In this paper we provide characterizing properties of TDI systems, among others the following: a system of linear inequalities is TDI if and only if its coefficient vectors form a Hilbert basis, and there exists a test-set for the system's…