Related papers: On Serini's relativistic theorem

We give a new proof of a theorem of B.M. Bredihin which was originally proved by extending Linnik's solution, via his dispersion method, of a problem of Hardy and Littlewood.

We generalise the Caristi Fixed Point Theorem to the mappings of the complete semi-metric spaces.

As a corollary to the recent extraordinary theorem of Maynard and Tao, we re-prove, in a stronger form, a result of Shiu concerning "strings" of consecutive, congruent primes.

We prove a stronger version of a termination theorem appeared in the paper "On existence of log minimal models II". We essentially just get rid of the redundant assumptions so the proof is almost the same as in there. However, we give a…

We give a stack-theoretic proof for some results on families of hyperelliptic curves.

We present a new, elementary, dynamical proof of the prime number theorem.

We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.

We give a simple proof of Dorronsoro's theorem and use similar ideas to establish an equivalence for embeddings of vector fields.

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.

This paper is a complement of our recent works on the semilinear Tricomi equations in [8] and[9].

In this note we fill a gap in the proof of the main theorem (Theorem 1.2) of our paper 'Surfaces in 4-manifolds', Math. Res. Letters 4 (1997), 907-914.

We give a proof of the Marker-Steinhorn Theorem which fills a gap in previous proofs of the result.

In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…

We generalize and prove a result which was first shown by Zippin, and was explicitly formulated by Benyamini.

We prove a generalization of Istvan F\'ary's celebrated theorem to higher dimension.

In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.

A very simple but useful almost sure convergence theorem of probability is given.

We give a proof of a result of Bonet, Engli\v{s} and Taskinen filling in several details and correcting some flaws.

Simple and shorter proofs of two Dirac-type theorems involving connectivity are presented.