Related papers: Proofs of NP = coNP = PSPACE: Current upgrade
The aim of this article is to give some improvements of Jordan-Steckin and Becker-Stark inequalities discussed in [1].
We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.
We present a new conjecture for the $SU_q(N)$ Perk-Schultz models. This conjecture extends a conjecture presented in our article (Alcaraz FC and Stroganov YuG (2002) J. Phys. A vol. 35 pg. 6767-6787, and also in cond-mat/0204074).
Rejoinder to "The Future of Indirect Evidence" [arXiv:1012.1161]
This is a reaction to the article Symplectic bipotentials, in published form [2] Harakeh M, Ban M, de Saxce G. Symplectic bipotentials. Mathematics and Mechanics of Solids. 2026;0(0) doi:10.1177/10812865251413554, and in preprint form [1]…
In this paper, we prove a conjecture of Schnell in the surface case.
This paper is a continuation of our earlier work "[T. Jin, Y.Y. Li and J. Xiong, On a fractional Nirenberg problem, part I: blow up analysis and compactness of solutions, to appear in J. Eur. Math. Soc.]", where compactness results were…
The purpose of this note is to provide a detailed proof of Nazarov's inequality stated in Lemma A.1 in Chernozhukov, Chetverikov, and Kato (2017, Annals of Probability).
We give four new proofs of the directed version of Brook's Theorem and an NP-completeness result.
In this paper we propose a new perspective on the evolution and history of the idea of mathematical proof. Proofs will be studied at three levels: syntactical, semantical and pragmatical. Computer-assisted proofs will be give a special…
We prove a stability version of the Pr\'ekopa-Leindler inequality.
We improve the main results in the paper from the title using a recent refinement of Bronshtein's theorem due to Colombini, Orr\'u, and Pernazza. They are then in general best possible both in the hypothesis and in the outcome. As a…
Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.
We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.
In this paper we consider quantum interactive proof systems, i.e., interactive proof systems in which the prover and verifier may perform quantum computations and exchange quantum messages. It is proved that every language in PSPACE has a…
I expound here in a more detailed way a proof of an important Serini's theorem, which I have already sketched in a previous Note. Two related questions are briefly discussed.
A short proof to a recent theorem of Giambruno and Mishchenko is given in this note.
Here we give a reformulation of a key lemma in the paper [2], "Spaces of Topological Complexity One", which is necessary due to an oversight.
The previous version of this paper relied on a paper by another author whose proof appears to be invalid in a fundamental way. In arXiv:1707.00649 the author, together with Jeff Yelton, came up with a new proof of almost identical results.…
In our contribution we describe some on-going improvements concerning the Automated Reasoning Tools developed in GeoGebra Discovery, providing different examples of the performance of these new features. We describe the new ShowProof…