相关论文: A Simple Proof of Sharkovsky's Theorem
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k edge-disjoint spanning trees.
The paper contains an alternative proof of M. Kontsevich Formality Theorem.
We prove an infinitary version of the Brauer-Schur theorem.
A very short and direct proof along the lines of the Kamae-Katznelson-Weiss approach.
We present an alternative proof of Perron's theorem, which is probabilistic in nature. It rests on the representation of the Perron eigenvector as a functional of the trajectory of an auxiliary Markov chain.
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…
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.
This paper provides a one-line proof of Frequent Directions (FD) for sketching streams of matrices. The simpler proof arises from sketching the covariance of the stream of matrices rather than the stream itself.
This note concerns a one-line diagrammatic proof of the Cayley-Hamilton Theorem. We discuss the proof's implications regarding the "core truth" of the theorem, and provide a generalization. We review the notation of trace diagrams and…
We survey the classical results of the Dirichlet Approximation Theorem.
We will give a new proof for the Gromov's theorem on almost flat manifolds, which is an inductive proof on dimension.
A weighted area estimate for entire graphs with bounded weighted mean curvature in Gauss space is given by a simple proof. Bernstein type theorems for self shrinkers (\cite {wa}) as well as for graphic $\lambda$-hypersurfaces (\cite{…
A much simpler proof of Theorem 1 from M.Burnashev "Code spectrum and reliability function: Binary symmetric channel" is presented.
We give a simple proof of Kolmogorov's theorem on the persistence of a quasiperiodic invariant torus in Hamiltonian systems. The theorem is first reduced to a well-posed inversion problem (Herman's normal form) by switching the frequency…
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…
We present a simple inductive proof of the Lagrange Inversion Formula.
We give a purely combinatorial proof for the infinitary van der Waerden's theorem.
In this short note, we give a description of the Parry-Sullivan number of a graph in terms of the cycles in the graph. This tool is occasionally useful in reasoning about the Parry-Sullivan numbers of graphs.
A proof is given of Rosenthal's \(\ell_1\) theorem.
The purpose of this paper is to present a generalization of Forelli's theorem. In particular, we prove an all dimensional version of the two-dimensional theorem of Chirka of 2005.