Related papers: On Arroyo-Figueroa's Proof that $\mathrm{P} \neq \…

SAT is not in P, is true and provable in a simply consistent extension B' of a first order theory B of computing, with a single finite axiom characterizing a universal Turing machine. Therefore, P is not equal to NP, is true and provable in…

In this short note we prove that, if (C[a,b],{A_n}) is an approximation scheme and (A_n) satisfies de La Vall\'ee-Poussin Theorem, there are instances of continuous functions on [a,b], real analytic on (a,b], which are poorly approximable…

In this paper we consider class of continuous functions, called quasiaharmonic functions, admitting best approximations by harmonic polynomials. In this class we prove a uniqueness theorem by analogy with the analytic functions.

In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na\"ive version of Andrews' anti-telescoping technique quite well. These new theorems also put to rest any notion…

Let $A/\mathbb{Q}$ be an elliptic curve with split multiplicative reduction at a prime $p$. We prove (an analogue of) a conjecture of Perrin-Riou, relating $p$-adic Beilinson$-$Kato elements to Heegner points in $A(\mathbb{Q})$, and a large…

We propose a short proof of the Fundamental Theorem of Algebra based on the ODE that describes the Newton flow and the fact that the value $|P(z)|$ is a Lyapunov function. It clarifies an idea that goes back to Cauchy.

In this paper, we formulate and present ample evidence towards the conjecture that the partition function (i.e. the exponential of the generating series of intersection numbers with monomials in psi classes) of the Pixton class on the…

In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_\nu(n)$, a partition function related to the third order mock theta function…

In this note, we study the easy certificate classes introduced by Hemaspaandra, Rothe, and Wechsung, with regard to the question of whether or not surjective one-way functions exist. This is an important open question in cryptology. We show…

We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The art gallery problem is a classical problem in computational…

In this short note we prove by a counter-example that Theorem 3.2 in the paper "A study on concave optimization via canonical dual function" by J. Zhu, S. Tao, D. Gao is false; moreover, we give a very short proof for Theorem 3.1 in the…

This note discusses proofs for convergence of first-order methods based on simple potential-function arguments. We cover methods like gradient descent (for both smooth and non-smooth settings), mirror descent, and some accelerated variants.

Let $M$ be a closed surface. By $\Homeo(M)$ we denote the group of orientation preserving homeomorphisms of $M$ and let $\MC(M)$ denote the Mapping class group. In this paper we complete the proof of the conjecture of Thurston that says…

In the paper a theorem of Piccard's type is proved and, consequently, the continuity of $\mathcal{D}$-measurable polynomial functions of $n$-th order as well as $\mathcal{D}$-measurable $n$-convex functions is shown. The paper refers to the…

We investigate the existence of a class of ZFC-provably total recursive unary functions, given certain constraints, and apply some of those results to show that, for $\Sigma_1$-sound set theory, ZFC$\not\vdash P<NP$.

In this Part I, we shall prove the consistency of arithmetic without complete induction from a point of view of strong negation, using its embedding to the tableau system $\bf SN$ of constructive arithmetic with strong negation without…

We claim to resolve the P=?NP problem via a formal argument for P=NP.

The aim of this work is to show that contemporary mathematics, including Peano arithmetic, is inconsistent, to construct firm foundations for mathematics, and to begin building on these foundations.

In this note we observe that automated theorem provers (ATPs) that recursively enumerate theorems in a particular way will fail to identify some valid theorems for a reason that is analogous to how G\"odel proved the existence of what are…

Let $\mathcal{A}$ denote the class of analytic functions in the unit disk $\mathbb{D}:=\{z\in\mathbb{C}:|z|<1\}$ satisfying $f(0)=0$ and $f'(0)=1$. Let $\mathcal{U}$ be the class of functions $f\in\mathcal{A}$ satisfying…