相关论文: Partitions with the same hook multiset

Let $G$ be a group and $H_1$,...,$H_s$ be subgroups of $G$ of indices $d_1$,...,$d_s$ respectively. In 1974, M. Herzog and J. Sch\"onheim conjectured that if $\{H_i\alpha_i\}_{i=1}^{i=s}$, $\alpha_i\in G$, is a coset partition of $G$, then…

We study the separability of permutationally symmetric quantum states. We show that for bipartite symmetric systems most of the relevant entanglement criteria coincide. However, we provide a method to generate examples of bound entangled…

Cluster analysis requires many decisions: the clustering method and the implied reference model, the number of clusters and, often, several hyper-parameters and algorithms' tunings. In practice, one produces several partitions, and a final…

In this paper, we generalize recent work of Mizuhara, Sellers, and Swisher that gives a method for establishing restricted plane partition congruences based on a bounded number of calculations. Using periodicity for partition functions, our…

We review two general criteria for deciding whether a pure bipartite quantum state describing a system of two identical particles is entangled or not. The first one considers the possibility of attributing a complete set of objective…

New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.

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…

We obtain a collection of necessary (sufficient) conditions for a bipartite system of qubits to be separable (entangled), which are based on the Landau-Pollak formulation of the uncertainty principle. These conditions are tested, and…

The Rado-Horn theorem provides necessary and sufficient conditions for when a collection of vectors can be partitioned into a fixed number of linearly independent sets. Such partitions exist if and only if every subset of the vectors…

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

Every partition of [[omega_1]^{< omega}]^2 into finitely many pieces has a cofinal homogeneous set. Furthermore, it is consistent that every directed partially ordered set satisfies the partition property if and only if it has finite…

Heterogeneous bipartite quantum pure states, composed of two subsystems with a different number of levels, cannot have both reductions maximally mixed. In this work, we demonstrate existence of a wide range of highly entangled states of…

Monogamy of bipartite correlations leads, for arbitrary pure multi-qubit states, to simple conditions able to indicate various types of multipartite entanglement by being capable to exclude the possibility of k-separability.

We introduce the multiset partition algebra, ${\rm M\!P}_{r,k}(x)$, that has bases elements indexed by multiset partitions, where $x$ is an indeterminate and $r$ and $k$ are non-negative integers. This algebra can be realized as a diagram…

We identify a general criterion for detecting entanglement of pure bipartite quantum states describing a system of two identical particles. Such a criterion is based both on the consideration of the Slater-Schmidt number of the fermionic…

In this paper, we prove a conjecture proposed by George Beck, which involves gap-free partitions and partitions with distinct parts.

Suppose $s$ and $t$ are coprime positive integers, and let $\sigma$ be an $s$-core partition and $\tau$ a $t$-core partition. In this paper we consider the set $\mathcal P_{\sigma,\tau}(n)$ of partitions of $n$ with $s$-core $\sigma$ and…

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…

Let $t\geq2$ and $k\geq1$ be integers. A $t$-regular partition of a positive integer $n$ is a partition of $n$ such that none of its parts is divisible by $t$. Let $b_{t,k}(n)$ denote the number of hooks of length $k$ in all the $t$-regular…

We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…