English
Related papers

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

200 papers

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

Dynamical Systems · Mathematics 2007-09-09 Bau-Sen Du

In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].

Dynamical Systems · Mathematics 2007-05-23 Bau-Sen Du

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.

Dynamical Systems · Mathematics 2007-05-23 Bau-Sen Du

In this note, we present a simple directed graph proof of Sharkovsky's theorem.

Dynamical Systems · Mathematics 2007-05-23 Bau-Sen Du

The original proof of the Sharkovsky theorem is presented in full detail. The proof should be accessible to readers with basic Real Analysis background. Although nowadays there are several alternative proofs of this classical result, we…

Dynamical Systems · Mathematics 2017-02-28 Veniamin L. Smirnov , Juan J. Tolosa

This note is intended primarily for college calculus students right after the introduction of the Intermediate Value Theorem, to show them how the Intermediate Value Theorem is used repeatedly and straightforwardly to prove the celebrated…

History and Overview · Mathematics 2017-02-24 Bau-Sen Du

We give a new independent proof of a generalised version of the theorem by Rashevskii, which appeared in [Uch. Zapiski Ped. Inst. K. 2 (1938), 83 -- 94] and from which the classical Chow-Rashevskii Theorem follows as a corollary. The proof…

Differential Geometry · Mathematics 2024-07-18 Cristina Giannotti , Andrea Spiro , Marta Zoppello

Circular proofs, introduced by Daniyar Shamkanov, are proofs in which assumptions are allowed that are not axioms but do appear at least twice along a branch. Shamkanov has shown that a formula belongs to the provability logic GL exactly if…

Logic · Mathematics 2022-01-03 Rosalie Iemhoff

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

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

In [FJJK] the Sharkovski\u{i} Theorem was extended to periodic orbits of strips of quasiperiodic skew products in the cylinder. In this paper we deal with the following natural question that arises in this setting: Does Sharkovski\u{i}…

Dynamical Systems · Mathematics 2016-05-31 Lluís Alsedà , Francesc Mañosas , Leopoldo Morales

We introduce four new elementary short proofs of the famous K\"onig's theorem which characterizes bipartite graphs by absence of odd cycles.

Combinatorics · Mathematics 2017-09-06 Salman Ghazal

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

General Topology · Mathematics 2011-10-28 Agelos Georgakopoulos

We give a simple short proof of Brooks' theorem using only induction and greedy coloring, while avoiding issues of graph connectivity. The argument generalizes easily to some extensions of Brooks' theorem, including its variants for list…

Combinatorics · Mathematics 2018-05-30 Mariusz Zając

A diagrammatic logical calculus for the syllogistic reasoning is introduced and discussed. We prove that a syllogism is valid if and only if it is provable in the calculus.

Logic · Mathematics 2013-03-01 Ruggero Pagnan

We obtain sharp bounds for the number of n-cycles in a finite graph as a function of the number of edges, and prove that the complete graph is optimal in more ways than could be imagined. En route, we prove some sharp estimates on power…

Combinatorics · Mathematics 2007-05-23 Igor Rivin

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

In this note, we would like to propose a suitable extension of the arithmetic Chow group of codimension one, in which the Hodge index theorem holds. We also prove an arithmetic analogue of Bogomolov's instability theorem for rank 2 vector…

Algebraic Geometry · Mathematics 2007-05-23 Atsushi Moriwaki

Cyclic proof theory studies proofs where cycles are allowed. This is useful for developing proof theory for logics with fixpoint operators: cycles can be used to represent the unfolding of a fixpoint. However, this cyclic character is not…

Logic · Mathematics 2025-11-05 Borja Sierra Miranda

The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…

Mathematical Physics · Physics 2020-01-29 Freddy Cachazo , Karen Yeats , Samuel Yusim
‹ Prev 1 2 3 10 Next ›