Related papers: A limitation on the KPT interpolation
We show that a recent observation by Yan leads to a method to experimentally test whether a higher-than-quantum violation of the Clauser-Horne-Shimony-Holt Bell inequality is possible (assuming that the sum of probabilities of pairwise…
In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The $k$-PATS problem is that of designing a tile assembly system with the…
We present sharp interpolation theorems, including all limiting cases, for a class of quasilinear operators of joint weak type acting between Lorentz-Karamata spaces over $\sigma$-finite measure. This class contains many of the important…
This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…
We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti…
The Parameterized Inapproximability Hypothesis (PIH) asserts that no fixed parameter tractable (FPT) algorithm can distinguish a satisfiable CSP instance, parameterized by the number of variables, from one where every assignment fails to…
Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…
In this note we look at the interdependences between James' theorem and the boundary problem. To do so we show a variant of James' sup-theorem for C(K)-spaces conjectured by Godefroy: in order to know that a bounded weakly closed subset of…
CP violation in the K system is pedagogically reviewed. We discuss its manifestations in the neutral K meson systems, in rare K meson decays and in decays of charged K mesons. Results from classical experiments, and perspectives for…
We prove the 3-fold DT/PT correspondence for K-theoretic vertices via wall-crossing techniques. We provide two different setups, following Mochizuki and following Joyce; both reduce the problem to q-combinatorial identities on word…
We present two sets of computable entanglement measures for multipartite systems where each subsystem can have different degrees of freedom (so-called qudits). One set, called 'separability' measure, reveals which of the subsystems are…
In a recent paper by S. Gubin [cs/0701023v1], a polynomial-time solution to the 3SAT problem was presented as proof that P=NP. The proposed algorithm cannot be made to work, which I shall demonstrate.
The celebrated result of Kabanets and Impagliazzo (Computational Complexity, 2004) showed that PIT algorithms imply circuit lower bounds, and vice versa. Since then it has been a major challenge to understand the precise connections between…
Main Result: Let $(M,L)$ be a smooth complex polarized threefold. Then the linear system $| K+tL|$ separates any two different points on $M$ for any $t\ge 6$, where $K$ is the canonical bundle of $M$. The argument in the proof is a variant…
Reciprocity is shown so far only when the scattering potential is either real or parity symmetric complex. We extend this result for parity violating complex potential by considering several explicit examples: (i) we show reciprocity for a…
In this paper some proof theory for propositional Lax Logic is developed. A cut free terminating sequent calculus is introduced for the logic, and based on that calculus it is shown that the logic has uniform interpolation. Furthermore, a…
We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…
We give an alternate proof of three versions of the theorem on extrapolation of Carleson measures.
In this paper, we introduce the new concepts of subcompatibility and subsequential continuity which are respectively weaker than occasionally weak compatibilty and reciprocal continuity. With them, we establish several common fixed point…
At the light of recent results in literature we review a conjecture formulated in Math. Phys. Electron. J. 1 (1995), paper 5, 1--13, about the mechanism of breakdown of invariant sets in KAM problems and the identification of the dominant…