Related papers: Proof compression and NP versus PSPACE. Part 2
Liebeck, Nikolov, and Shalev conjectured that for every subset A of a finite simple group S with |A|>1, there exist O( log|S| / log|A| ) conjugates of A whose product is S. This paper is a companion to [Lifshitz: Completing the proof of the…
Let $\lambda$, $\mu$, $\lambda'$, $\mu'$ be partitions. The conjecture of Lam, Postnikov and Pylyavskyy states that, if $\lambda+\mu = \lambda' + \mu'$, and $\min(\lambda_i-\lambda_j, \mu_i-\mu_j) \leq \lambda'_i - \lambda'_j \leq…
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 main result of this paper is an instance of the conjecture made by Gouvea and Mazur (Math. Res. Lett., 1995) which asserts that for certain values of r the space of r-overconvergent p-adic modular forms of tame level N and weight k…
The Wehrl entropy conjecture for coherent (highest weight) states in representations of the Heisenberg group, which was proved in 1978 and recently extended by us to the group $SU(2)$, is further extended here to symmetric representations…
In this paper we present a complete proof of a conjecture due to V. V. Prelov in 2010 about an information inequality for the binary entropy function.
In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…
The Kakeya conjecture is generally formulated as one the following statements: every compact/Borel/arbitrary subset of ${\mathbb R}^n$ that contains a (unit) line segment in every direction has Hausdorff dimension $n$; or, sometimes, that…
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski.
We prove here some supplementary statements that appeared without proof in I. Panin, A. Stavrova, N. Vavilov, On Grothendieck--Serre's conjecture concerning principal $G$-bundles over reductive group schemes:I, arXiv:0905.1418
This article presents a technique for proving problems hard for classes of the polynomial hierarchy or for PSPACE. The rationale of this technique is that some problem restrictions are able to simulate existential or universal quantifiers.…
It was recently shown by Atserias, Buss and Mueller that the standard complexity-theoretic conjecture NEXP not in P / poly is consistent with the relatively strong bounded arithmetic theory V^0_2, which can prove a substantial part of…
In this paper we introduce a new method to produce lower bounds for the Waring rank of symmetric tensors. We also introduce the notion of $e$-computability and we use it to prove that Strassen's Conjecture holds in infinitely many new…
J.C.Lagarias (2000) conjectured that if $\mu$ is a complex measure on p-dimensional Euclidean space with a uniformly discrete support and its spectrum (Fourier transform) is also a measure with a uniformly discrete support, then the support…
We claim to resolve the P=?NP problem via a formal argument for P=NP.
In this article, we prove the $p$-adic Kazhdan-Lusztig hypothesis for $\mathrm{GL}_n(F)$. While the approach via graded affine Hecke algebras due to recent work of Solleveld leads to more general results, this article serves to completes…
The goal of this note is to affirm a local version of the conjecture of Nisse--Sottile [NS16] on higher convexity of complements of tropical varieties, while providing a family of counter-examples for the global Nisse--Sottle conjecture in…
We generalize the notion of proof term to the realm of transfinite reduction. Proof terms represent reductions in the first-order term format, thereby facilitating their formal analysis. We show that any transfinite reduction can be…
Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…
The said paper [2] entitled "Proof Of Two Dimensional Jacobian Conjecture" is with gaps.