Related papers: A Short Proof of the Poincar\'e Conjecture

We survey recent developments on the Restriction conjecture.

In this paper, we survey some recent results on the Artin conjecture and discuss some aspects for the Artin conjecture.

A very short proof of Kneser's theorem via transversal is given.

In this paper, we give a simple counter example to the famous Hodge conjecture.

We give a counterexample to a recently conjectured variant of the Penrose inequality.

This is an erratum to an earlier paper, "Generalizations of the Poincar\'e-Birkhoff theorem." An error in the statement of one of the theorems is corrected.

This article is not a proof of the Poincar\'{e} conjecture but a discussion of the proof, its context, and some of the people who played a prominent role. It is a personal, anecdotal account. There may be omission or transpositions as these…

In this note, we establish the validity of a conjecture recently proposed in Mathematics Magazine and connect it to the existing interesting results

The purpose of the paper is to present an short proof of the Chuang's inequality.

In this very short note, we give a counterexample to a recent conjecture of Gilmer which would have implied the union-closed conjecture.

The better title is "Yet another FALSE proof of the 4-colour theorem." Please consider all versions of this paper as historical material on the way to a non-computer proof of the 4-colour theorem. Interpreted as proofs, all versions are…

In this paper the circulant Hadamard conjecture is proved.

In this paper, we give a short proof of a relation generalizing many identities for Bernoulli numbers.

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

In this work we resolve several conjectures stated in the On-Line Encyclopedia of Integer sequences.

A proof of Sendov's conjecture is given.

In this short note I restate and simplify the proof of the impossibility of probabilistic induction from Popper (1992). Other proofs are possible (cf. Popper (1985)).

By changing variables in a suitable way and using dominated convergence methods, this note gives a short proof of Stirling's formula and its refinement.

We give a pen and paper and (comparatively) much simpler proof to verify of the Four Colour Theorem.