Related papers: Proof compression and NP versus PSPACE. Part 2
We present a more general (parametric-) homological characterization of the Direct Summand Theorem. Specifically, we state two new conjectures: the Socle-Parameter conjecture (SPC) in its weak and strong forms. We give a proof for the week…
We provide a reduction in the classification problem for non-compact, homogeneous, Einstein manifolds. Using this work, we verify the (Generalized) Alekseevskii Conjecture for a large class of homogeneous spaces.
H.J. Zassenhaus conjectured that any unit of finite order and augmentation $1$ in the integral group ring $\mathbb{Z}G$ of a finite group $G$ is conjugate in the rational group algebra $\mathbb{Q}G$ to an element of $G$. We prove the…
In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.
Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…
We present a direct proof of the second conjecture made by M. Atiyah and P. Sutcliffe for the case of convex quadrilaterals. Unlike previous work on this conjecture, our proof does not require any computer aided computations. The new proof…
We provide a proof of a variant of the Landau-Siegel Zeros conjecture.
We give here a new proof of a Tauberian Theorem of complex Laplace transform using the Theory of measure and theory of function with bounded variations. However we deduce the simple proof of Prime Number Theorem.
We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…
In this paper from 2011 we consider $\textbf{IL}_0$, the closed fragment of the basic interpretability logic $\textbf{IL}$. We show that we can translate $\textbf{GL}_1$, the one variable fragment of G\"odel-L\"ob's provabilty logic…
Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that…
Guided by evidence coming from a few key examples and attempting to unify previous work of Chudnovsky, Esnault-Viehweg, Eisenbud-Mazur, Ein-Lazarsfeld-Smith, Hochster-Huneke and Bocci-Harbourne, Harbourne and Huneke recently formulated a…
In this paper, we prove a congruence which confirms a conjecture of Adamchuk. For any prime $p\equiv1\pmod3$ and $a\in\mathbb{Z}^{+}$, we have \begin{align*} \sum_{k=1}^{\frac{2}3(p^a-1)}\binom{2k}k\equiv0\pmod{p^2}. \end{align*}
Many natural optimization problems derived from $\sf NP$ admit bilevel and multilevel extensions in which decisions are made sequentially by multiple players with conflicting objectives, as in interdiction, adversarial selection, and…
The article presents the proof of Casas-Alvero conjecture.
We prove that it is NP-complete to decide whether a given (3-dimensional) simplicial complex is collapsible. This work extends a result of Malgouyres and Franc\'{e}s showing that it is NP-complete to decide whether a given simplicial…
In this paper, we show that the friends-and-strangers problem is PSPACE-complete by reduction from the Ncl (non-deterministic constraint logic) problem.
This paper has two parts. First, we complete the proof of the Kolmogorov extension theorem for unbounded random variables using compactness theorem of integral logic which was proved for bounded case in [8]. Second, we give a proof of the…
We discuss the claims of the comment at arXiv.org:physics/0609234. We show that A.V. Kildishev et al. misread our method of extracting of optical constants of nanostructured films. The theoretical calculations performed in the comment…
We examine a proof by Craig Alan Feinstein that P is not equal to NP. We present counterexamples to claims made in his paper and expose a flaw in the methodology he uses to make his assertions. The fault in his argument is the incorrect use…