Related papers: Towards a classification of multi-faced independen…
We study the sharp bounds of $\mathbb{E}[X_1\cdots X_d]$ when the univariate marginal distributions are known, but the dependence structure between them is unspecified. Maximizing products over non-negative variables is straightforward via…
The classical multidimensional resultant can be defined as the, suitably normalized, generator of a projective elimination ideal in the ring of universal coefficients. This is the approach via the so-called inertia forms or…
Recently P. Wocjan and M. Horodecki [quant-ph/0503129] gave a characterization of combinatorially independent permutation separability criteria. Combinatorial independence is a necessary condition for permutations to yield truly independent…
Infamously, the finite and unrestricted implication problems for the classes of i) functional and inclusion dependencies together, and ii) embedded multivalued dependencies alone are each undecidable. Famously, the restriction of i) to…
We obtain several rigidity results regarding tensor product decompositions of factors. First, we show that any full factor with separable predual has at most countably many tensor product decompositions up to stable unitary conjugacy. We…
We study the robustness of genuine multipartite entanglement and inseparability of multipartite pure states under superposition with product pure states. We introduce the concept of the maximal and the minimal Schmidt ranks for multipartite…
We show that two natural and a priori unrelated structures encapsulate the same data, namely certain commutative and associative product structures and a class of superintegrable Hamiltonian systems. More precisely, consider a Euclidean…
In unsupervised ensemble learning, one obtains predictions from multiple sources or classifiers, yet without knowing the reliability and expertise of each source, and with no labeled data to assess it. The task is to combine these possibly…
The well-conditioned multi-product formula (MPF), proposed by [Low, Kliuchnikov, and Wiebe, 2019], is a simple high-order time-independent Hamiltonian simulation algorithm that implements a linear combination of standard product formulas of…
We propose and axiomatize preferences on a product state space in light of uncertainty regarding the dependency of different payoff-relevant factors. Dependence structures allow to decompose probabilities and allow to pin down behavior…
We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…
We express classical, free, Boolean and monotone cumulants in terms of each other, using combinatorics of heaps, pyramids, Tutte polynomials and permutations. We completely determine the coefficients of these formulas with the exception of…
Product formula approximations of the time-evolution operator on quantum computers are of great interest due to their simplicity, and good scaling with system size by exploiting commutativity between Hamiltonian terms. However, product…
One can define what it means for a compact manifold with corners to be a "contractible manifold with contractible faces." Two combinatorially equivalent, contractible manifolds with contractible faces are diffeomorphic if and only if their…
In this paper, we consider a system of homogeneous algebraic equations in complex variables and their conjugates, which arise naturally from the range criterion for separability of PPT states. We examine systematically these equations to…
Free cumulants are multilinear functionals defined in terms of the moment functional with the use of the family of lattices of noncrossing partitions. In the univariate case, they can be identified with the coefficients of the Voiculescu…
We determine all the multiplicity-free representations of the symmetric group. This project is motivated by a combinatorial problem involving systems of set-partitions with a specific pattern of intersection.
The so-called permutation separability criteria are simple operational conditions that are necessary for separability of mixed states of multipartite systems: (1) permute the indices of the density matrix and (2) check if the trace norm of…
We compare various viewpoints on down-sets (simplicial complexes), illustrating how the combinatorial inclusion-exclusion principle may serve as an alternative to more advanced methods of studying their face numbers.
In this paper, we introduce the notion of conditionally bi-free independence in an amalgamated setting. We define operator-valued conditionally bi-multiplicative pairs of functions and construct operator-valued conditionally bi-free moment…