Related papers: A Simple Proof of Sharkovsky's Theorem Rerevisited
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
We present a proof of the Chevalley-Weil Theorem that is somewhat different from the proofs appearing in the literature and with somewhat weaker hypotheses, of purely topological type. We also provide a discussion of the assumptions, and an…
We extend the diagrammatic calculus of syllogisms introduced in our previous paper to the general case of n-term syllogisms, showing that the valid ones are exactly those whose conclusion follows by calculation. Moreover, by pointing out…
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…
In this article, we give a positive answer to the cycle double cover conjecture. Ones who are mainly interesting in the proof of the conjecture can only read Sections 2 and 4.
By using Alexander duality on simplicial complexes we give a new and algebraic proof of Dirac's theorem on chordal graphs.
We present an adaptation of a relatively simple topological argument to show the existence of many periodic orbits in an infinite dimensional dynamical system, provided that the system is close to a one-dimensional map in a certain sense.…
We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.
This note tries to show that a re-examination of a first course in analysis, using the more sophisticated tools and approaches obtained in later stages, can be a real fun for experts, advanced students, etc. We start by going to the…
In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…
In this paper, we shall prove the Chung-Feller Theorem in several ways. We provide an inductive proof, bijective proof, and proofs using generating functions, and the Cycle Lemma of Dvoretzky and Motzkin.
We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish…
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…
A new shortest proof of Kotzig's Theorem about graphs with unique perfect matching is presented in this paper. It is well known that Kotzig's theorem is a consequence of Yeo's Theorem about edge-colored graph without alternating cycle. We…
One of the themes in algebraic geometry is the study of the relation between the ``topology'' of a smooth projective variety and a (``general'') hyperplane section. Recent results of Nori produce cohomological evidence for a conjecture that…
We prove the Liv\v{s}ic Theorem for arbitrary $GL(m,\mathbb R)$ cocycles. We consider a hyperbolic dynamical system $f : X \to X$ and a H\"older continuous function $A: X \to GL(m,\mathbb R)$. We show that if $A$ has trivial periodic data,…
The paper gives a unified and simple proof of both theorems and Cousin's theorem.
We generalize certain arguments in Zariski's irregularity theorem on cyclic multiple planes.
In this expository paper we present some ideas of algebraic topology (more precisely, of homology theory) in a language accessible to non-specialists in the area. A $1$-cycle in a graph is a set $C$ of edges such that every vertex is…
The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…