Related papers: A limitation on the KPT interpolation

In this note we are concerned about the generalization of the GHS inequality for the Potts model. We also obtain by a different method the proof of the GHS inequality for the Ising model. We take advantage of a polynomial expansion and we…

We prove a tight upper bound on the variance of the priority sampling method (aka sequential Poisson sampling). Our proof is significantly shorter and simpler than the original proof given by Mario Szegedy at STOC 2006, which resolved a…

Strong converse theorems refer to the study of impossibility results in information theory. In particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum hypothesis testing [Comm. Math. Phys, 334(3), 2014], which…

Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…

We reply to the Comment by Fil'kov and Kashevarov, arXiv:0805.4486 [hep-ph]. We show that the discrepancies between ChPT and dispersion theory, reported for the polarizability of the pion, result from applying dispersion theory to…

This article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are…

We introduce an interpolation--regression operator for polynomial approximation on the unit sphere $\mathbb{S}^2$ from discrete samples. The approximant is a spherical polynomial of degree $r$ which interpolates the data on a prescribed…

For given positive integers $d$ and $m$, consider the projective klt pairs $(X,B)$ of dimension $d$, of Cartier index $m$, and with semi-ample $K_X+B$ defining a contraction $\pi\colon X\to Z$. We prove that it is not possible in general to…

We bound the change in entropy incurred by an irreducible subshift of finite type upon perturbing it by forbidding a pair of admissible words. Lind has proven such bounds in the one-word case, and we adapt his methods. In particular, we…

We introduce a tool for analysing models of $\textnormal{CT}^-$, the compositional truth theory over Peano Arithmetic. We present a new proof of Lachlan's theorem that arithmetical part of models of $\textnormal{PA}$ are recursively…

For a limited range of indices $p$, we obtain $L^p(\mathbb{R}^n)$ boundedness for singular integral operators whose kernels satisfy a condition weaker than the typical H\"ormander smoothness estimate. These operators are assumed to be…

We give alternative proofs to certain results in the paper "Weak limits of almost invariant projections" by using ultraproducts of operators.

We fill in a gap in the proof of the main theorem in our earlier paper [Ol]. At the same time, we prove a slightly stronger version of the theorem needed for another paper.

We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combinatory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven…

Interpolation is an important property of classical and many non classical logics that has been shown to have interesting applications in computer science and AI. Here we study the Interpolation Property for the propositional version of the…

Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…

It is well-known (cf. K.-Pudl\'ak 1989) that a polynomial time algorithm finding tautologies hard for a propositional proof system $P$ exists iff $P$ is not optimal. Such an algorithm takes $1^{(k)}$ and outputs a tautology $\tau_k$ of size…

The famous contradiction of a bijection between a set and its power set is a consequence of the impredicative definition involved. This is shown by the fact that a simple mapping between equivalent sets does also fail to satisfy the…

This paper investigates the existence of inseparable disjoint pairs of NP languages and related strong hypotheses in computational complexity. Our main theorem says that, if NP does not have measure 0 in EXP, then there exist disjoint pairs…

The notion of critical tuple was introduced by Miklau and Suciu (Gerome Miklau and Dan Suciu. A formal analysis of information disclosure in data exchange. J. Comput. Syst. Sci., 73(3):507-534, 2007), who also claimed that the problem of…