相关论文: Bipartite Graft III: General Case
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…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
In this report, a scheme different from the PT and Wootters concurrence is developed to acquire a criterion to investigate the bipartite separability of the Werner state.
We propose a method for obtaining the Schmidt decomposition of bipartite systems with continuous variables. It approximates the modes to the prescribed accuracy by well known orthogonal functions. We give some criteria for the control of…
We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
The $2$-decomposition for ribbon graphs was introduced in [Annals of Combinatorics 15 (2011), pp 675-706]. We extend this result to half-edged ribbon graphs and to rank $D$-weakly colored graphs [SIGMA 12 (2016), 030], generalizing…
We give an exponential lower bound for the Graver complexity of the incidence matrix of a complete bipartite graph of arbitrary size. Our result is a generalization of the result by Berstein and Onn (2009) for 3xr complete bipartite graphs,…
We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…
We give a decomposition of the jacobian variety of a generalized Fermat curve. This extends a result obtained by Auffarth, Lucchini-Arteche and Rojas on Humbert-Edge curves, which are a particular case of generalized Fermat curves. (A…
Finding dense bipartite subgraphs and detecting the relations among them is an important problem for affiliation networks that arise in a range of domains, such as social network analysis, word-document clustering, the science of science,…
We prove that any triple of complete flags in $\mathbb R^d$ admits a common generating set of size $\lfloor 5d/3\rfloor$ and that this bound is sharp. This result extends the classical linear-algebraic fact -- a consequence of the Bruhat…
Based on the Schmidt decomposition new convenient thumbrules are obtained to test entanglement of wavefunctions for bipartite qubit and qutrit systems. For the qubit system there is an underlying SU(2) algebra , while the same for a qutrit…
We define 2-decompositions of ribbon graphs, which generalise 2-sums and tensor products of graphs. We give formulae for the Bollobas-Riordan polynomial of such a 2-decomposition, and derive the classical Brylawski formula for the Tutte…
This is the part II of our series of two papers, "Clemens' conjecture: part I", "Clemens' conjecture: part II". Continuing from part I, in this paper we turn our attention to general quintic threefolds. In a universal quintic threefold X,…
Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of…
This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence…
The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree, a 2-regular subgraph and a matching. We show that this conjecture holds for the class of connected plane cubic graphs.
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…
Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…