Related papers: Totally bipartite tridiagonal pairs
In one of our previous papers we generalized the Buscher T-dualization procedure. Here we will investigate the application of this procedure to the theory of a bosonic string moving in the weakly curved background. We obtain the complete…
Property $(P)$, introduced in recent work and rooted in the classical theory of Parter vertices, concerns the existence of a nonsingular matrix $A\in S(G)$ for which every vertex of $G$ is a $P$-vertex. Previous investigations have fully…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
A new layers method is presented for multipartite separability of density matrices from simple graphs. Full separability of tripartite states is studied for graphs on degree symmetric premise. The models are generalized to multipartite…
In this paper we study ternary algebras of third-order hypermatrices. By hypermatrix we mean a complex-valued variable with three indices, which is also called a three-dimensional matrix or spatial matrix. We assume that a hypermatrix is…
We give a proof of the multi-party typicality conjecture for the first nontrivial case when there are only two parties. The conjecture itself is motivated by the study of multi-party state merging protocols on quantum systems. Our approach…
Binary multirelations generalise binary relations by associating elements of a set to its subsets. We study the structure and algebra of multirelations under the operations of union, intersection, sequential and parallel composition, as…
A $biased\ graph$ is a pair $(G,\mathcal{B})$, where $G$ is a graph and $\mathcal{B}$ is a collection of `balanced' circuits of $G$ such that no $\Theta$-subgraph of $G$ contains precisely two balanced circuits. We prove a Ramsey-type…
An algebraic isopair is a commuting pair of pure isometries that is annihilated by a polynomial defining a distinguished variety $\mathcal{V}$. The notion of the rank of a pure algebraic isopair with finite bimultiplicity is introduced. For…
We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…
Orthogonal polynomials of a continuous variable in the Askey scheme satisfying second order difference equations, such as the Askey-Wilson polynomial, can be studied by the quantum mechanical formulation, idQM (discrete quantum mechanics…
We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph $G$ on $d$ vertices with $n$ edges, the binomial edge ring of $G$ is defined to be the subalgebra of the polynomial ring with $2d$ variables…
The Askey-Wilson algebra and its relatives such as the Racah and Bannai-Ito algebras were initially introduced in connection with the eponym orthogonal polynomials. They have since proved ubiquitous. In particular they admit presentations…
We determine for which $n$, the complete bipartite graph $K_{n,n}$ has an embedding in $S^3$ whose topological symmetry group is isomorphic to one of the polyhedral groups: $A_4$, $A_5$, or $S_4$.
The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and Renyi about perfect matchings in random bipartite graphs.…
The idea of orthogonal polynomials has been generalized in two ways to achieve new types of polynomials: noncommutative orthogonal polynomials and biorthogonal polynomials. This paper brings these two different generalizations together to…
Numerous topics in three and four dimensional supersymmetric gauge theories are covered. The organizing principle in this presentation is scaling (Wilsonian renormalization group flow.) A brief introduction to scaling and to supersymmetric…