相关论文: Permutation-bipartition pairs

As two fundamental problems, graph cuts and graph matching have been investigated over decades, resulting in vast literature in these two topics respectively. However the way of jointly applying and solving graph cuts and matching receives…

The Dulmage--Mendelsohn decomposition (or the DM-decomposition) gives a unique partition of the vertex set of a bipartite graph reflecting the structure of all the maximum matchings therein. A bipartite graph is said to be DM-irreducible if…

In 1918, Hardy and Ramanujan made a breakthrough by developing the circle method to deduce an asymptotic formula for the partition function $p(n)$, which was later refined by Rademacher in 1937 to produce an absolutely convergent series…

In this paper, we study Ranking, a well-known randomized greedy matching algorithm, for general graphs. The algorithm was originally introduced by Karp, Vazirani, and Vazirani [STOC 1990] for the online bipartite matching problem with…

The role of double space is essential in new interpretation of T-duality and consequently in an attempt to construct M-theory. The case of open string is missing in such approach because until now there have been no appropriate formulation…

In this paper, we generalize the embedded homology groups of hypergraphs initially given in [S. Bressan, J. Li, S. Ren, and J. Wu, The embedded homology of hypergraphs and applications, Asian J. Math. 23(3)(2019) 479-500] and study the…

Sharing entangled pairs between non-signaling parties via entanglement swapping constitutes a striking demonstration of the nonlocality of quantum mechanics and a crucial building block for future quantum technologies. In this work, we…

We prove that the number of even parts and the number of times that parts are repeated have the same distribution over integer partitions with a fixed perimeter. This refines Straub's analog of Euler's Odd-Distinct partition theorem. We…

Bipartite graphs, especially drawn on Riemann surfaces, have of late assumed an active role in theoretical physics, ranging from MHV scattering amplitudes to brane tilings, from dimer models and topological strings to toric AdS/CFT, from…

We introduce orbital graphs and discuss some of their basic properties. Then we focus on their usefulness for search algorithms for permutation groups, including finding the intersection of groups and the stabilizer of sets in a group.

Previous work on symmetric group equivariant neural networks generally only considered the case where the group acts by permuting the elements of a single vector. In this paper we derive formulae for general permutation equivariant layers,…

We introduce the notion of combinatorial encoding of continuous dynamical systems and suggest the first examples, which are the most interesting and important, namely, the combinatorial encoding of a Bernoulli process with continuous state…

In this paper, we investigate $\pi(m,n)$, the number of partitions of the \emph{bipartite number} $(m,n)$ into \emph{steadily decreasing} parts, introduced by L.Carlitz ['A problem in partitions', Duke Math Journal 30 (1963), 203--213]. We…

Bicommutant categories are higher categorical analogs of von Neumann algebras that were recently introduced by the first author. In this article, we prove that every unitary fusion category gives an example of a bicommutant category. This…

We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We…

We study the combinatorics of two classes of basic hypergeometric series. We first show that these series are the generating functions for certain overpartition pairs defined by frequency conditions on the parts. We then show that when…

We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case.…

Bipartitional relations were introduced by Foata and Zeilberger in their characterization of relations which give rise to equidistribution of the associated inversion statistic and major index. We consider the natural partial order on…

Our previous work about algebraic-geometric invariants of the mixed states are extended and a stronger separability criterion is given. We also show that the Schmidt number of pure states in bipartite quantum systems, a classical concept,…

We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…