Related papers: Casas-Alvero Conjecture is true

In this paper we prove the correctness of Dijkstra's algorithm. We also discuss it and at the end we show an application.

In this paper, we prove the conjecture that if there is an odd perfect number, then there are infinitely many of them.

In this paper, we formulate and prove several variants of the Erd\H{o}s-Tur\'{a}n additive bases conjecture.

In this paper we consider the remaining cases of Hebey-Vaugon conjecture.

We present a formulation of the Collatz conjecture that is potentially more amenable to modeling and analysis by automated termination checking tools.

We give an elementary proof to Hasse theorem.

An technically interesting proof of a known theorem.

We complete the proof of the McKay--Navarro conjecture (also known as the Galois--McKay conjecture) for the prime 2, by completing the proof of the inductive McKay--Navarro conditions introduced by Navarro--Sp\"ath--Vallejo in this…

In this paper we establish that the well-known Arithmetic System is consistent in the traditional sense. The proof is done within this Arithmetic System.

In this note we investigate the Cheltsov--Rubinstein conjecture. We show that this conjecture does not hold in general and some counterexamples will be presented.

In the paper we complete a case by case proof of Reeder's Conjecture started in our previous work, proving the conjecture for simple Lie algebras of type $D$ and for the exceptional cases.

We give a proof of the Marker-Steinhorn Theorem which fills a gap in previous proofs of the result.

This is an introduction to Taubes's proof of the Weinstein conjecture, written for the AMS Current Events Bulletin. It is intended to be accessible to nonspecialists, so much of the article is devoted to background and context.

We prove that a triangulated category which is the underlying category of a stable derivator has a filtered enhancement, providing an affirmative answer to a conjecture in [3].

Using Easton collapses, we give a simplified construction of a model in which Chang's Conjecture for triples holds.

It is shown that the question raised in Section 5.7 of [1] has an affirmative answer.

We present an astonishingly simple and elegant proof of the celebrated Basel problem.

In the paper it is demonstrated that Bells theorem is an unprovable theorem.

By creating a new method, the author proved the well-known world's baffling problems Goldbach conjecture, twin primes conjecture, the Proposition (C) and the Proposition $n^2+1$.

An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.