Related papers: Near-bipartite Leonard pairs
We prove that a strongly connected balanced bipartite digraph $D$ of order $2a$, $a\geq3$, satisfying $d(u)+d(v)\geq 3a$ for every pair of vertices $u,v$ with a common in-neighbour or a common out-neighbour, is either bipancyclic or a…
A \emph{bipartite monoid} is a commutative monoid $\Q$ together with an identified subset $\P \subset \Q$. In this paper we study a class of bipartite monoids, known as \emph{mis\`ere quotients}, that are naturally associated to impartial…
Let H be a bialgebra and D an H-bimodule algebra H-bicomodule coalgebra. We find sufficient conditions on D for the L-R-smash product algebra and coalgebra structures on D\otimes H to form a bialgebra (in this case we say that (H, D) is an…
Recently, Milani\v{c} and Trotignon introduced the class of equistarable graphs as graphs without isolated vertices admitting positive weights on the edges such that a subset of edges is of total weight $1$ if and only if it forms a maximal…
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…
Ferrer dimension, along with the order dimension, is a standard dimensional concept for bipartite graphs. In this paper, we prove that a graph is of Ferrer dimension three (equivalent to the intersection bigraph of orthants and points in…
Bordered Heegaard Floer homology is a three-manifold invariant which associates to a surface F an algebra A(F) and to a three-manifold Y with boundary identified with F a module over A(F). In this paper, we establish naturality properties…
A locally compact contraction group is a pair (G,f) where G is a locally compact group and f an automorphism of G which is contractive in the sense that the forward orbit under f of each g in G converges to the neutral element e, as n tends…
A subsemigroup S of a semigroup Q is a left order in Q and Q is a semigroup of left quotients of S if every element of Q can be expressed as a# b where a and b are elements of S and if, in addition, every element of S that is square…
Let Gamma be a Q-polynomial distance-regular graph with vertex set X, diameter D geq 3 and adjacency matrix A. Fix x in X and let A*=A*(x) be the corresponding dual adjacency matrix. Recall that the Terwilliger algebra T=T(x) is the…
Existence of a perfect matching in a random bipartite digraph with bipartition $(V_1, V_2)$, $|V_i|=n$, is studied. The graph is generated in two rounds of random selections of a potential matching partner such that the average number of…
We present a new look at description of real finite-dimensional Lie algebras. The basic element turns out to be a pair $(F,v)$ consisting of a linear mapping $F\in End(V)$ and its eigenvector $v$. This pair allows to build a Lie bracket on…
In this article, we study algebraic dynamical pairs $(f,a)$ parametrized by an irreducible quasi-projective curve $\Lambda$ having an absolutely continuous bifurcation measure. We prove that, if $f$ is non-isotrivial and $(f,a)$ is…
The recently suggested bipartite analysis extends the Kauffman planar decomposition to arbitrary $N$, i.e. extends it from the Jones polynomial to the HOMFLY polynomial. This provides a generic and straightforward non-perturbative calculus…
In this paper we strengthen a result due to Li by showing that the third bi-power of a locally finite connected bipartite graph that admits a perfect matching is Hamilton-laceable, i.e. any two vertices from different bipartition classes…
Let $G=(U \cup V, E)$ be a bipartite graph, where $U$ represents jobs and $V$ represents machines. We study a new variant of the bipartite matching problem in which each job in $U$ can be matched to at most one machine in $V$, and the…
We find a family of planar bipartite graphs all of whose Lombardi drawings (drawings with circular arcs for edges, meeting at equal angles at the vertices) are nonplanar. We also find families of embedded series-parallel graphs and…
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…
We introduce the -1 dual Hahn polynomials through an appropriate $q \to -1$ limit of the dual q-Hahn polynomials. These polynomials are orthogonal on a finite set of discrete points on the real axis, but in contrast to the classical…
Let $G$ a bipartite graph with vertex bipartition $\{A,B\}$ and let $m=|E(G)|$. An $(A,B)$-uniformly ordered labeling of $G$ is a labeling $f\colon V\rightarrow [0,2m]$ which, among other conditions, requires that there exists $\lambda\in…