Related papers: A new proof of Roth's theorem on arithmetic progre…

We prove a quantitative local limit theorem for the number of descents in a random permutation. Our proof uses a conditioning argument and is based on bounding the characteristic function $\phi(t)$ of the number of descents. We also…

The purpose of this note is to prove the celebrated Discrete Renewal Theorem in a common special case. We use only very elementary methods from real analysis, rather than markov chain theory, complex analysis, or generating functions.…

We give a new proof of a theorem of Mansour and Sun by using number theory and Rothe's identity.

Despite the many applications of rate-independent systems, their regularity theory is still largely unexplored. Usually, only weak solution with potentially very low regularity are considered, which requires non-smooth techniques. In this…

We introduce a new notion of "regularity structure" that provides an algebraic framework allowing to describe functions and / or distributions via a kind of "jet" or local Taylor expansion around each point. The main novel idea is to…

Revised proofs of Kenneth Arrow's impossibility theorem have been presented in prose form, incorporating novel ideas such as decisive sets and pivotal voters. This study develops another approach to proving the theorem. Using a proof…

This article has two objectives. The first is to give a guide to the proof of the (so-called) Casselman-Wallach theorem as it appears in Real Reductive Groups II. The emphasis will be on one aspect of the original proof that leads to the…

We show two results. First, a refinement of Freiman's theorem: if A is a finite set of integers and |A+A| < K|A|, then A is contained in a multidimensional progression of dimension at most O(K^{7/4} log^3K) and size at most exp(O(K^{7/4}…

In this paper we present a surprisingly short proof of Minkowski's second theorem. The author hopes there is no mistake in it, though the argument seems to be too plain to contain one. Also, we apply the main construction of the proof to…

Regular resolution is a refinement of the resolution proof system requiring that no variable be resolved on more than once along any path in the proof. It is known that there exist sequences of formulas that require exponential-size proofs…

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

Myriad articles are devoted to Mertens's theorem. In yet another, we merely wish to draw attention to a proof by Hardy, which uses a Tauberian theorem of Landau that "leads to the conclusion in a direct and elegant manner". Hardy's proof is…

A classical theorem of Fritz John allows one to describe a convex body, up to constants, as an ellipsoid. In this article we establish similar descriptions for generalized (i.e. multidimensional) arithmetic progressions in terms of proper…

To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

A famous theorem of Szemer\'edi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the…

This article is an exposition of recent results and methods on the prevalence of normal numbers in the support of self-similar measures on the line. We also provide an essentially self-contained proof of a recent Theorem that the Rajchman…

Here we present a new non-parametric approach to density estimation and classification derived from theory in Radon transforms and image reconstruction. We start by constructing a "forward problem" in which the unknown density is mapped to…

In this paper, we present a constructive proof of Herschfeld's Convergence Theorem. Our formulation differs from Herschfeld's in a few ways: We consider radicals that nest transfinitely many times, as these are essential to the proof;…

We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.