Related papers: Proof Complexity and the Kneser-Lov\'asz Theorem

In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lov\'asz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved…

Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a…

For a finite set $\cal F$ of polynomials over fixed finite prime field of size $p$ containing all polynomials $x^2 - x$ a Nullstellensatz proof of the unsolvability of the system $$ f = 0\ ,\ \mbox{ all } f \in {\cal F} $$ in the field is a…

We establish a version of the Furstenberg-Katznelson multi-dimensional Szemer\'edi in the primes ${\mathcal P} := \{2,3,5,\ldots\}$, which roughly speaking asserts that any dense subset of ${\mathcal P}^d$ contains constellations of any…

In this note we announce the proof of the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s => 3; this is new for s => 4, the cases s = 1,2,3 having been previously established. More precisely we outline a proof (details of which…

This paper studies the complexity of matrix Putinar's Positivstellens{\"a}tz on the semialgebraic set that is given by the polynomial matrix inequality. \rev{When the quadratic module generated by the constrained polynomial matrix is…

This paper presents very simple and easy integration-free proofs in the context of Weierstrass's theory of functions, of the Maximum and Minimum Modulus Principles and Gutzmer-Parseval Inequalities for polynomials and for functions…

As a generalization of the classical killing-contractible-complexes lemma, we present algebraic Morse theory via homological perturbation lemma, in a form more general than existing presentations in the literature. Two-sided Anick…

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…

The K-theoretic quiver component formula expresses the K-polynomial of a type A quiver locus as an alternating sum of products of double Grothendieck polynomials. This formula was conjectured by A. Buch and R. Rim\'anyi and later proved by…

Let $G$ be a complex reductive group, $\theta \colon G \to G$ an involution, and $K = G^\theta$. In arXiv:1206.5547, W. Schmid and the second named author proposed a program to study unitary representations of the corresponding real form…

We construct uniquely satisfiable $k$-CNF formulas that are hard for the algorithm PPSZ. Firstly, we construct graph-instances on which "weak PPSZ" has savings of at most $(2 + \epsilon) / k$; the saving of an algorithm on an input formula…

The minimization problem for propositional formulas is an important optimization problem in the second level of the polynomial hierarchy. In general, the problem is Sigma-2-complete under Turing reductions, but restricted versions are…

We introduce the $k$-stellated spheres and consider the class ${\cal W}_k(d)$ of triangulated $d$-manifolds all whose vertex links are $k$-stellated, and its subclass ${\cal W}^{\ast}_k(d)$ consisting of the $(k+1)$-neighbourly members of…

We study a new class of NP search problems, those which can be proved total using standard combinatorial reasoning based on approximate counting. Our model for this kind of reasoning is the bounded arithmetic theory $\mathrm{APC}_2$ of…

In this paper, we consider the complexity of propositional proofs of classical and intuitionistic tautologies. In fact, we describe a nondeterministic polynomial-time decision procedure for intuitionistic implicational tautologies. For this…

We consider the proof system Res($\oplus$) introduced by Itsykson and Sokolov (Ann. Pure Appl. Log.'20), which is an extension of the resolution proof system and operates with disjunctions of linear equations over $\mathbb{F}_2$. We study…

Let $G$ be a simple algebraic group over an algebraically closed field $\mathbb{F}$ of characteristic $p\geq h$, the Coxeter number of $G$. We observe an easy `recursion formula' for computing the Jantzen sum formula of a Weyl module with…

We compute the complexity, z-complexity, and support varieties of the (thick) Kac modules for the Lie superalgebras of type P. We also show the complexity and the z-complexity have geometric interpretations in terms of support and…