Related papers: Remarks on Pickands theorem
We present a proof of Moessner's theorem by double induction, using only basic rules of arithmetic. No prerequisite knowledge is assumed. Familiarity with summation is advised.
The transformations of the sum identities for generalized harmonic and oscillatory numbers, obtained earlier in our recent report [1], enable us to derive the new identities expressed in terms of the corresponding square roots of x. At…
We give a sharpened form of Siegel Lemma's w. r. t. the maximum norm. This implies a new lower bound on the greatest element of a sum-distinct set of positive integers (Erd\"os-Moser problem). The main tools are Minkowski's theorem on…
A lemma of Micchelli's, concerning radial polynomials and weighted sums of point evaluations, is shown to hold for arbitrary linear functionals, as is Schaback's more recent extension of this lemma and Schaback's result concerning…
We give a proof of the Bourgain-Milman theorem using complex methods. The proof is inspired by Kuperberg's, but considerably shorter.
There are several versions of Bell's inequalities, proved in different contexts, using different sets of assumptions. The discussions of their experimental violation often disregard some required assumptions and use loose formulations of…
In this paper we investigate some strong convergence theorems for partial sums with respect to Vilenkin system.
A poly-log time method to compute the truncated theta function, its derivatives, and integrals is presented. The method is elementary, rigorous, explicit, and suited for computer implementation. We repeatedly apply the Poisson summation…
Sylvester doubles sums, introduced first by Sylvester are symmetric expressions of the roots of two polynomials. Sylvester's definition of double sums makes no sense in the presence of multiple roots, since the definition involves…
This article establishes a real-variable argument for Zygmund's theorem on almost everywhere convergence of strong arithmetic means of partial sums of Fourier series on $\mathbb{T}$, up to passing to a subsequence. Our approach extends to,…
In this paper we give an elementary proof of the local sum conjecture in two dimensions. In a remarkable paper [CMN, arXiv:1810.11340], this conjecture has been established in all dimensions using sophisticated, powerful techniques from a…
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…
In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg…
In this paper, we confirm several conjectured congruences of Sun concerning the divisibility of binomial sums. For example, with help of a quadratic hypergeometric transformation, we prove that $$…
In this paper, we establish a doubling argument to obtain Hessian estimates for the special Lagrangian equation under general phase constraints. In particular, our approach does not rely on the Michael-Simon mean value inequality. As an…
We give a new, self-contained proof of the multidimensional central limit theorem using the technique of ``doubling variables," which is traditionally used to prove uniqueness of solutions of partial differential equations (PDEs). Our…
We offer a proof of a summation formula equivalent to one due to Berndt. Our proof uses the M$\ddot{u}$ntz formula and the Poisson summation formula. By utilizing known properties of Mellin inversion, we give an example from a discontinuous…
We study a weighted version of Carleman's inequality via Carleman's original approach. As an application of our result, we prove a conjecture of Bennett.
We collect some results in combinatorial geometry that follow from an inequality of Langer in algebraic geometry. Langer's inequality gives a lower bound on the number of incidences between a point set and its spanned lines, and was…