Related papers: Another simple proof of the 1-dimensional flat cha…

We prove that two chains of linear mappings are topologically isomorphic if and only if they are linearly isomorphic.

In this paper we present a short and elementary proof for the error in Simpson's rule.

This note contains a newly streamlined version of the original proof that Outer space is contractible.

In this note we give a detailed proof of a theorem of Aubin.

We give an elementary proof of low rank cases of the conjecture that the tensor product of two semistable Euclidean lattices is again semistable.

We give a purely combinatorial proof for the infinitary van der Waerden's theorem.

We give a counterexample of Morrison's cone conjecture for a strict Calabi-Yau threefold.

In this note, we give short inductive proofs of two known results on $k$-extendible graphs based on a property proved in [Qinglin Yu, A note on $n$-extendable graphs. Journal of Graph Theory, 16:349-353, 1992].

The article provides a counterexample to a conjecture by Blocki-Zwonek.

We prove an elementary lemma concerning primitive amalgams and use it to greatly simplify the proof of the Sims conjecture in the case of almost simple groups.

We present a formulation of the Collatz conjecture that is potentially more amenable to modeling and analysis by automated termination checking tools.

We construct a simple acyclic directed graph for which the Bunkbed Conjecture is false, thereby resolving conjectures posed by Leander and by Hollom.

Any flat connection on a principal fibre bundle comes from a linear representation of the fundamental group. The noncommutative analog of this fact is discussed here.

We will prove the Brannan conjecture for particular values of the parameter. The basic tool of the study is an integral representation published in a recent work [3].

A much simpler proof of Theorem 1 from M.Burnashev "Code spectrum and reliability function: Binary symmetric channel" is presented.

This is a critical discussion of theoretical and descriptive deficiencies of the recently used "flat Odderon" model.

In this note we shall give a new proof to a quadrature formulae due to Newton.

We provide a short proof, not utilizing complex numbers, for the solution set of homogeneous second order linear differential equations with constant coefficients.

In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.

In this short note we give an elementary proof of the fact that connections and their geometric parallel-transport counterpart are equivalent notions.