English
Related papers

Related papers: A Simple Proof of Sharkovsky's Theorem Revisited

200 papers

Standard proofs of Lusin's theorem, using simple functions, are sometimes quite elaborate. Here, we give a one-sentence proof of Lusin's theorem. We do not believe our approach, by way of inverse images, is new. However, this particular…

Classical Analysis and ODEs · Mathematics 2018-11-01 Samuel J. Ferguson , Tianqi Wu

A new very simple proof of the number of labeled rooted forest-graphs with a given number of vertices is given. As a partial case of this formula we have Cayley's formula.

Mathematical Physics · Physics 2022-02-07 Alexei L. Rebenko

The famous Conway--Gordon--Sachs theorem for the complete graph on six vertices was extended to the general complete graph on $n$ vertices by Kazakov--Korablev as a congruence modulo $2$, and its integral lift was given by…

Geometric Topology · Mathematics 2025-06-24 Ryo Nikkuni

In this note, we give short inductive proofs of two known results on $k$-extendible graphs based on a property proved in [Qinglin Yu, A note on $n$-extendable graphs. Journal of Graph Theory, 16:349-353, 1992].

Combinatorics · Mathematics 2021-10-08 Shenwei Huang , Yongtang Shi

Chudnovsky, Kim, Oum, and Seymour recently established that any prime graph contains one of a short list of induced prime subgraphs [1]. In the present paper we reprove their theorem using many of the same ideas, but with the key…

Logic · Mathematics 2015-11-10 M. Malliaris , C. Terry

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

Formal Languages and Automata Theory · Computer Science 2018-01-23 Thijmen J. P. Krebs

In this note we provide a quick proof of the Sklar's Theorem on the existence of copulas by using the generalized inverse functions as in the one dimensional case, but a little more sophisticated.

Probability · Mathematics 2018-03-02 Gane Samb Lo

We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.

Combinatorics · Mathematics 2017-07-31 J. Cibulka , J. Hladky , M. A. LaCroix , D. G. Wagner

We study analogues of Sidorenko's conjecture and the forcing conjecture in oriented graphs, showing that natural variants of these conjectures in directed graphs are equivalent to the asymmetric, undirected analogues of the conjectures.

Combinatorics · Mathematics 2022-11-01 Jacob Fox , Zoe Himwich , Nitya Mani , Yunkun Zhou

In this work we present a simplifyed proof of Kantorovich's Theorem on Newton's Method. This analysis uses a technique which has already been used for obtaining new extensions of this theorem.

Numerical Analysis · Mathematics 2012-09-26 O. P. Ferreira , B. F. Svaiter

We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.

Functional Analysis · Mathematics 2019-12-06 R. S. Monahan , P. L. Robinson

In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in $\R^3$. We reduce these theorems to certain property of graphs mapped to the plane.

Geometric Topology · Mathematics 2014-04-15 Arseny Zimin

A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many preliminaries and the information density and mutual information…

Information Theory · Computer Science 2012-05-08 Yuval Lomnitz , Meir Feder

By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.

Commutative Algebra · Mathematics 2007-05-23 Jürgen Herzog , Takayuki Hibi , Xinxian Zheng

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…

General Topology · Mathematics 2011-12-02 V. V. Filippov , E. Yu. Mychka

Based on the main result presented in a recent paper, we derive Ambarzumian-type theorems for Schr\"odinger operators defined on quantum graphs. We recover existing results such as the classical theorem by Ambarzumian and establish some…

Spectral Theory · Mathematics 2024-05-07 Patrizio Bifulco , Joachim Kerner

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…

Discrete Mathematics · Computer Science 2022-01-21 Thomas Seiller , Jakob Simonsen

We give a simple direct proof of Fermat's two squares theorem. Our argument uses no intricate notions or ideas; one might say that it is a proof by careful bookkeeping. As such, the proof may be particularly easy to comprehend by students…

History and Overview · Mathematics 2025-08-15 Gennady Bachman

This is an analysis of the status of Brooks' Theorem, a celebrated result in graph coloring, from the point of view of Reverse Mathematics. We prove that the restriction of Brooks' theorem to bounded graphs of degree greater than or equal…

Logic · Mathematics 2026-01-08 Alberto Marcone , Gian Marco Osso

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…

Symplectic Geometry · Mathematics 2007-05-23 Joachim Albrecht