Related papers: A Proof of Kamp's theorem

We give a very simple proof of a strengthened version of Chernoff's Inequality. We derive the same conclusion from much weaker assumptions.

Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.

In this paper we present a short and elementary proof for the error in Simpson's rule.

We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.

A proof is given of Rosenthal's \(\ell_1\) theorem.

In this paper we give a new proof of Riemann's well known mapping theorem. The suggested method permits to prove an analog of that theorem for the three dimensional case.

We give a purely combinatorial proof for the infinitary van der Waerden's theorem.

I give a proof of the uniform boundedness theorem that is elementary (i.e. does not use any version of the Baire category theorem) and also extremely simple.

Recently we have obtained two simple proofs of Sharkovsky's theorem, one with directed graphs [7] and the other without [8]. In this note, we present yet more simple proofs of Sharkovsky's theorem.

Based on the results people have obtained, we try to prove the Jacobian conjecture, but there is a gap in the proof.

We prove a generalization of Lopes's theorem, that is, of the converse of Brolin's theorem.

We present a short and self-contained proof of the choosability version of Brooks' theorem.

In this note we give a detailed proof of a theorem of Aubin.

We prove an analytic KAM-Theorem, which is used in [1], where the differential part of KAM-theory is discussed. Related theorems on analytic KAM-theory exist in the literature (e. g., among many others, [7], [8], [13]). The aim of the…

We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.

We generalize Pappus chain theorem and give an analogue to this theorem.

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

We will give a simple proof of the ambiguous class number formula.

The aim of this article is to give a new proof of Cohen-Gabber theorem in the equal characteristic $p>0$ case.

The purpose of this note is to rephrase Speyer's elegant topological proof for Kasteleyn's Theorem in a simple graph theoretical manner.