Related papers: Proof compression and NP versus PSPACE. Part 2
Although whether P equals NP is an important, open problem in computer science, and although Jaeger's 2008 paper, "Solving the P/NP Problem Under Intrinsic Uncertainty" (arXiv:0811.0463) presents an attempt at tackling the problem by…
We prove the volume conjecture for any twist knots by using an equivalence relation, complex analysis, analytic continuation, and function of several complex variables on the basis of colored Jones polynomials.
Andrews and El Bachraoui recently studied various two-colored integer partitions, including those related to two-colored partitions into distinct parts with constraints and overpartitions. Their work raised questions about the existence of…
One of the two basic theorems in [5] on the existence of solutions of PDEs is improved with the use of a group analysis type argument.
It is shown that, assuming the Continuum Hypothesis, compact Hausdorff space of weight at most $\mathfrak{c}$ is a remainder in a soft compactification of $\mathbb{N}$. We also exhibit an example of a compact space of weight $\aleph_1$ --…
This short note provides a new and simple proof of the convergence rate for Peng's law of large numbers under sublinear expectations, which improves the corresponding results in Song [15] and Fang et al. [3].
This paper makes a fundamental assertion about the Erd\H{o}s-Straus conjecture. Suppose that for a prime $p$ there exists $x,y,z \in \mathbb{N}$ with $x \leq y \leq z$ so that $$ \frac{4}{p} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}. $$ The…
In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…
If $p$ is an odd prime, then we prove that $\e(H_2(G,\mathbb{Z})) \mid p\ \e(G)$ for $p$ groups of class 7. We prove the same for $p$ groups of class at most $p+1$ with $\e(Z(G))=p$. We also prove Schurs conjecture if $\e(G/Z(G))$ is $2,3$…
Counterfactual explanations (CEs) offer interpretable insights into machine learning predictions by answering ``what if?" questions. However, in real-world settings where models are frequently updated, existing counterfactual explanations…
As Collatz conjecture is still to be proved, a method to arrive at the complete proof is explored here. Conceptually, the process relies on the pre-proven sequence data and the method follows the confirmation of the convergence of the…
Data compression capability of "Compressed sensing (sampling)" in signal discretization is numerically evaluated and found to be far from the theoretical upper bound defined by signal sparsity. It is shown that, for the cases when ordinary…
The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently…
In this paper we give a complete proof of the Brumer-Stark conjecture over $\mathbf{Z}$.
We give more evidence for Patterson's conjecture on sums of exponential sums, by getting an asymptotic for a sum of quartic exponential sums over $\Q[i].$ Previously, the strongest evidence of Patterson's conjecture over a number field is…
Resolution and superposition are common techniques which have seen widespread use with propositional and first-order logic in modern theorem provers. In these cases, resolution proof production is a key feature of such tools; however, the…
We provide simple proofs of analogues for coverings numbers of lattices of several recently studied basic statements on the ranks of tensors. We highlight the differences and analogies between the proofs in both settings.
We prove a number of conjectures [arXiv:2005.04066] recently stated by P. Barry, related to the paperfolding sequence and the Rueppel sequence.
A proof of Sendov's conjecture is given.
We prove that the Laptev--Safronov conjecture (Comm. Math. Phys., 2009) is false in the range that is not covered by Frank's positive result (Bull. Lond. Math. Soc., 2011). The simple counterexample is adaptable to a large class of…