Related papers: More simple proofs of Sharkovsky's theorem
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…
Let f(x) be a continuous function from a compact real interval into itself with a periodic orbit of minimal period m, where m is not an integral power of 2. Then, by Sharkovsky's theorem, for every positive integer n with m \prec n in the…
We present simple and direct proof to an important case of Nash-Moser-Ekeland theorem.
We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…
In his paper on the Mordell-Lang conjecture, Hrushovski employed techniques from model theory to prove the function field version of the conjecture. In doing so he was able to answer a related question of Voloch, which we refer to…
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…
In this paper we prove the theorem on freedom for relatively free Lie algebras with a single relation (analogous with the well-known result of Shirshov) and a generalized Freiheitssatz for relatively free Lie algebras (analogous with the…
A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion.
We give a simple proof of Bourgain's theorem on the singularity of Ornstein's maps.
We partially prove and partially disprove Oka's conjecture on the fundamental group/Alexander polynomial of an irreducible plane sextic. Among other results, we enumerate all irreducible sextics with simple singularities admitting dihedral…
We prove a generalisation of the Khukhro--Makarenko theorem on large characteristic subgroups with laws. This general fact implies new results on groups, algebras, and even graphs and other structures. Concerning groups, we obtain, e.g., a…
Kepler's laws are derived from the inverse square law without the use of calculus and are simplified over previous such derivations.
We show that there are simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least $\Omega(n/\log n)$. This establishes a strong form of a claim by Thurston, for which the construction and proof…
In this paper we first prove that a simple root of a polynomial satisfies the Sendov's conjecture. As the multiple roots trivially satisfy the Sendov's conjecture we conclude that the Sendov's conjecture holds true.
A simple topological graph is a topological graph in which any two edges have at most one common point, which is either their common endpoint or a proper crossing. More generally, in a k-simple topological graph, every pair of edges has at…
We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non…
In this note we introduce a representation of simple undirected graphs in terms of polynomials and obtain a unique code for a simple undirected graph.
Here we simplify the proof of the de Rham theorem for Schwartz functions on affine Nash manifolds and generalize the result to the case of non affine Nash manifolds.
We sketch several proofs of F\'ary--Milnor theorem.
Utilizing an embedding theorem of Obraztsov we construct groups as described in the title. This provides an affirmative answer to a problem of D. O. Revin. The constructed groups also provide a negative answer to a question highlighted by…