Related papers: On PPT Square Conjecture
We present the positive-partial-transpose squared conjecture introduced by M. Christandl at Banff International Research Station Workshop: Operator Structures in Quantum Information Theory (Banff International Research Station, Alberta,…
We present the PPT square conjecture introduced by M. Christandl. We prove the conjecture in the case $n=3$ as a consequence of the fact that two-qutrit PPT states have Schmidt at most two. Our result in Lemma 3 is independent from the…
We prove that the PPT$^2$ conjecture holds for linear maps between matrix algebras which are covariant under the action of the diagonal unitary group. Many salient examples, like the Choi-type maps, depolarizing maps, dephasing maps,…
Several results about the union-closed sets conjecture are presented.
Inspired by [Qiu, Wilson 2019] and [D'Adderio, Iraci, Vanden Wyngaerd 2019 - Delta Square], we formulate a generalised Delta square conjecture (valley version). Furthermore, we use similar techniques as in [Haglund, Sergel 2019] to obtain a…
This note generalizes factorization for formulas with multiplicities and conjectures that the connection method along with this feature is computationally as powerful as resolution, also seen from a complexity point of view.
A conjecture regarding the structure of expander graphs is discussed.
We conjecture a formula for the symmetric function $\frac{[n-k]_t}{[n]_t}\Delta_{h_m}\Delta_{e_{n-k}}\omega(p_n)$ in terms of decorated partially labelled square paths. This can be seen as a generalization of the square conjecture of Loehr…
A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…
In this work we show that based on a conjecture for the pair correlation of integers representable as sums of two squares, which was first suggested by Connors and Keating and reformulated here, the second moment of the distribution of the…
In this paper, we proved a special case of the DDVV Conjecture.
This is a survey of recent advances in commutative algebra, especially in mixed characteristic, obtained by using the theory of perfectoid spaces. An explanation of these techniques and a short account of the author's proof of the direct…
In this paper, we extend the rectangular side of the shuffle conjecture by stating a rectangular analogue of the square paths conjecture. In addition, we describe a set of combinatorial objects and one statistic that are a first step…
M. Christandl conjectured that the composition of any trace preserving PPT map with itself is entanglement breaking. We prove that Christandl's conjecture holds asymptotically by showing that the distance between the iterates of any unital…
The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].
An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.
We provide a simpler proof of the hard Lefschetz Theorem for face rings of PL spheres: While the algebraic theory remains the same, we replace the geometric constructions by Pachner's Theorem. This simplifies the reasoning for an important…
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
We resolve a 25 year old problem by showing that The Paving Conjecture is equivalent to The Paving Conjecture for Triangular Matrices.
Quickly convergent series are given to compute polyzeta numbers. The formula involves an intricate combination of (generalized) polylogarithms at 1/2. However, the combinatorics has a very simple geometric interpretation: it corresponds…