Related papers: More simple proofs of Sharkovsky's theorem

We give a direct proof of the Ohsawa-Takegoshi by solving directly the d-bar equation.

We give a new proof of the existence of designs, which is much shorter and gives better bounds.

Many of the strengthenings and extensions of the topological Tverberg theorem can be derived with surprising ease directly from the original theorem: For this we introduce a proof technique that combines a concept of "Tverberg unavoidable…

In this short note, we give a simple proof of a Lee-Yang type theorem which appeared in "Lee-Yang theorems and the complexity of computing averages" by Alistair Sinclair and Piyush Srivastava.

The aim of this paper is to give another proof to a result on the image of a homogeneous quadratic map which is positive with respect to a homogeneous cone, given by Graczyk and Ishi in 2014. The new proof depends on a purely algebraic…

We give two proofs of the Kalman Theorem, alternative to the most common ones, which infer such a classical result of Control Theory using just very basic facts on flows of vector fields. These proofs are apt to be generalised in diverse…

In the paper, we give a Schur-Toponogov theorem in Riemannian geometry, which not only generalizes Schur's and Toponogov's theorem but also indicates their relation. Inspired by its proof, we also supply a new proof of Toponogov's theorem…

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…

We present here a simple proof of Brown's diagonalizability theorem for certain elements of the algebra of a left regular band, including probability measures.

We prove new results on the derivative of the Minkowski question mark function. Some of our theorems are non-improvable.

We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…

We present a proof of the Sturm-Hurwitz theorem, using basic calculus.

It is discussed that Zeeman's theorem can be directly obtained from Liouville's theorem if we assume sufficient differentiability.

This article presents a clear proof of the Riemann Mapping Theorem via Riemann's method, uncompromised by any appeals to topological intuition.

We give a new proof of the known Shunkov's Theorem on locally finite groups with the minimal condition for nonabelian subgroups and also an extension of the known Suchkova-Shunkov Theorem on Shunkov groups with the minimal condition for…

By the famous ADE classification rational double points are simple. Rational triple points are also simple. We conjecture that the simple normal surface singularities are exactly those rational singularities, whose resolution graph can be…

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d > a/b$, then $G$ is not necessarily $(c:d)$-choosable. The simplest case of another problem, stated by the same…

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…

An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…