Related papers: Proof compression and NP versus PSPACE. Part 2

Czerwinski's paper "Separation of ${\rm PSPACE}$ and ${\rm EXP}$" [Cze21] claims to prove that ${\rm PSPACE} \neq {\rm EXP}$ by showing there is no length-increasing polynomial-time reduction from a given ${\rm EXP}$-complete set to a given…

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

The following is a concise exposition of the conjecture and three of its proofs for the case of positive entropy by D. Rudolph [22] , B. Host [14] and W. Parry [21]. A simpler theorem of R. Lyons [19] - preceding them - is also presented…

We present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine…

Let p>2 be prime. We complete the proof of the weight part of Serre's conjecture for rank two unitary groups for mod p representations in the totally ramified case, by proving that any weight which occurs is a predicted weight. Our methods…

A theorem of L. Caffarelli implies the existence of a map pushing forward a source Gaussian measure to a target measure which is more log-concave than the source one, which contracts Euclidean distance (in fact, Caffarelli showed that the…

In the nineties Immerman and Medina initiated the search for syn- tactic tools to prove NP-completeness. In their work, amongst several results, they conjecture that the NP-completeness of a problem defined by the conjunction of a sentence…

We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…

We give a slightly different proof of the NTV conjecture for the Hilbert transform that was proved by T. Hyt\"onen, M. Lacey, E.T. Sawyer, C.-Y. Shen and I. Uriarte-Tuero, building on previous work of F. Nazarov, S. Treil and A. Volberg.…

Stasheff showed that if a map between H-spaces is an H-map, then the suspension of the map is extendable to a map between cprojective planes of the H-spaces. Stahseff also proved the converse under the assumption that the multiplication of…

Cook and Reckhow 1979 pointed out that NP is not closed under complementation iff there is no propositional proof system that admits polynomial size proofs of all tautologies. Theory of proof complexity generators aims at constructing sets…

The Liebeck-Nikolov-Shalev conjecture [LNS12] asserts that, for any finite simple non-abelian group $G$ and any set $A\subseteq G$ with $|A|\geq 2$, $G$ is the product of at most $N\frac{\log|G|}{\log|A|}$ conjugates of $A$, for some…

We prove the intersection of Igusa's Conjecture of [Igusa, J., "Lectures on forms of higher degree", Lect. math. phys., Springer-Verlag, 59 (1978)] and the Denef - Sperber Conjecture of [Denef, J. and Sperber, S., "Exponential sums mod p^n…

The material of the article is devoted to the most complicated and interesting problem -- a problem of P = NP?. This research was presented to mathematical community in Hyderabad during International Congress of Mathematicians. But there it…

We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.

We give a transport proof of a discrete version of the displacement convexity of entropy on integers (Z), and get, as a consequence, two discrete forms of the Pr{\'e}kopa-Leindler Inequality : the Four Functions Theorem of Ahlswede and…

Removed by arXiv administration. This article was plagiarized directly from Stephen Cook's description of the problem for the Clay Mathematics Institute. See http://gauss.claymath.org:8888/millennium/P_vs_NP/pvsnp.pdf for the original text.

Does every Boolean tautology have a short propositional-calculus proof? Here, a propositional calculus (i.e. Frege) proof is a proof starting from a set of axioms and deriving new Boolean formulas using a set of fixed sound derivation…

One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…

We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…