Related papers: A more reasonable proof of Cobham's theorem

We give a probabilistic proof of the orbit-counting lemma.

We expose here a short proof of Cramer's theorem in R based on convex duality.

We give an endorsement for Cornacchia's famous algorithm. Thus we do not claim anything new but an approach which is supposed to be simpler than those of previous works written with the same aim.

We prove new, general versions of Bernstein-von Mises theorem for both well-specified and misspecified models when the log-likelihood is concave in the parameter and the prior distribution is log-concave. Unlike classical versions of…

We give a new proof of the compactness of minimizing sequences of the Sobolev inequalities in the critical case. Our approach relies on a simplified version of the concentration-compactness principle, which does not require any refinement…

A new formalism is given for the renormalization of quantum field theories to all orders of perturbation theory, in which there are manifestly no overlapping divergences. We prove the BPH theorem in this formalism, and show how the local…

We give a simple proof of the Fourier Inversion Theorem, using the methods of nonstandard analysis.

Quantum Mechanics is a good example of a successful theory. Most of atomic phenomena are described well by quantum mechanics and cases such as Lamb Shift that are not described by quantum mechanics, are described by quantum electrodynamics.…

This proof of Godel's first incompleteness theorem doesn't require omega-consistency, nor does it refer to codes of negated sentences as in Rosser's. It begins from where Godel's usual proof ends, and stalks it till it ends proving it.

Based on various strategies, we obtain several simple proofs of the celebrated Sharkovsky cycle coexistence theorem.

There are proven few analogues of the Theorem of Moser using The Approximation Theorem of Artin.

We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.

The paper is devoted to a generalized and improved version of author's approach to Gromov bounded cohomology theory. In particular, the awkward countability assumption is removed and the aspects related to homological algebra are clarified.…

In this paper we prove the Bohr Theorem for slice regular functions. Following the historical path that led to the proof of the classical Bohr Theorem, we also extend the Borel-Carath\'eodory Theorem to the new setting.

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 Korovkin approximation theorems that incorporate summability methods. These result allows us to obtain a unified treatment of several previous results, focusing on the underlying structure and the properties that a summability…

We present a solution of Exercise 1.2.1 of [2] which yields a short new proof of a key step in one of proofs of Brouwer's fixed point theorem, 1910. A few people asked the author about the details of the solution and they might be…

In the paper titled "Bockstein basis and resolution theorems in extension theory" (arXiv:0907.0491v2), we stated a theorem that we claimed to be a generalization of the Edwards-Walsh resolution theorem. The goal of this note is to show that…

We produce a new, shorter construction of a minor-universal planar graph.

We give a new proof of Lucas' Theorem in elementary number theory.