Related papers: The Sharkovsky Theorem
In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].
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 various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.
In this note, we present a simple directed graph proof of Sharkovsky's theorem.
A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an…
Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…
We give a modern account of Agafonov's original proof of his eponymous theorem. The original proof was only reported in Russian in a journal not widely available, and the work most commonly cited in western literature is instead the English…
We give a very simple proof of a strengthened version of Chernoff's Inequality. We derive the same conclusion from much weaker assumptions.
Parikh's theorem is a fundamental result of the formal language's theory. There had been published many proofs and many papers claimed to provide a simplified proof, but most of them are long and still complicated. We provide the proof that…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…
In this note we give a quick and simple proof of the existence (and uniqueness) of Zariski decompositions on surfaces. While Zariski's original proof employs a rather sophisticated procedure to construct the negative part of the…
This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
This is a 20-year old review on singularities and singularity theorems. The main reason to submit it now is -apart from increasing its availability- to correct a very strange error that appears in the journal's online version: it contains…
The SOM algorithm is very astonishing. On the one hand, it is very simple to write down and to simulate, its practical properties are clear and easy to observe. But, on the other hand, its theoretical properties still remain without proof…
We give a brief historical overview of the famous Pythagoras' theorem and Pythagoras. We present a simple proof of the result and dicsuss some extensions. We follow \cite{thales}, \cite{wiki} and \cite{wiki2} for the historical comments and…
The recently developed proof of Fermat's Last Theorem is very lengthy and difficult, so much so as to be beyond all but a small body of specialists. While certainly of value in the developments that resulted, that proof could not be, nor…
The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.
A theorem of Mirsky provides necessary and sufficient conditions for the existence of an N-square complex matrix with prescribed diagonal entries and prescribed eigenvalues. We give a simple inductive proof of this theorem.
The first version of this paper gave another proof of the Kropholler Conjecture, which gives a relative version of Stallings Ends Theorem, following an earlier incorrect proof. It has been pointed out by Sam Shepherd that the the second…