Related papers: Remarks on Pickands theorem
We represent a general bilinear Calder\'on-Zygmund operator as a sum of simple dyadic operators. The appearing dyadic operators also admit a simple proof of a sparse bound. In particular, the representation implies a so called sparse T1…
Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An entropic proof of Chang's inequality. SIAM Journal on Discrete Mathematics, 28(1), pp.173-176.] we give a short information theoretic proof for Chang's lemma that is…
We present a simple extension of Lindeberg's argument for the Central Limit Theorem to get a general invariance result. We apply the technique to prove results from random matrix theory, spin glasses, and maxima of random fields.
The aim of this work is to prove a Tauberian theorem for the Ingham summability method. The Tauberian theorem we prove is then applied to analyze asymptotics of mean values of multiplicative functions on natural numbers.
We give a purely combinatorial proof for a two-fold generalization of van der Waerden-Brauer's theorem and Hindman's theorem. We also give tower bounds for a finite version of it.
We generalize the method of combinatorial telescoping to the case of multiple summations. We shall demonstrate this idea by giving combinatorial proofs for two identities of Andrews on parity indices of partitions.
The asymptotic analysis of high exceedance probabilities for Gaussian processes and fields has been a blooming research area since J. Pickands introduced the now-standard techniques in the late 60's. The \textit{vector-valued} processes,…
We prove new upper bounds for a spectral exponential sum by refining the process by which one evaluates mean values of $L$-functions multiplied by an oscillating function. In particular, we introduce a method which is capable of taking into…
In this note, we give a simple proof of the pointwise BMO estimate for Poisson's equation. Then the Calder\'{o}n-Zygmund estimate follows by the interpolation and duality.
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…
We define "splitting functions of level l" for any integer l>0. These functions generalize Dwork's splitting functions : they allow us to represent additive characters of order $p^l$. Then we use these functions to obtain a Stickleberger…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
First we prove a modified version of the famous Lemma on the mean square estimate for exponential sums, by plugging the Cesaro weights in the right hand side of Gallagher's inequality. Then we apply it, in order to establish a mean value…
We give in the present work a new methodology that allows to give isoperimetric proofs, for Kneser's Theorem and Kemperman's structure Theory and most sophisticated results of this type. As an illustration we present a new proof of Kneser's…
Modifying an idea of E. Brietzke we give simple proofs for the recurrence relations of some sequences of binomial sums which have previously been obtained by other more complicated methods.
A new and easy way of deriving Gauss's Generalized Hypergeometric Theorem is presented by using the Bilateral Binomial Theorem.
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.
In this article, we improve the classical Bukhgeim-Klibanov method presented in [1],which can be used to prove the conditional stability of inverse source problem for a hyperbolic equation from the measurement on the subboundary. A major…
The objective of this paper is to give alternative proofs for the symmetric Poincar\'e-Birkhoff-Witt theorem utilizing the Magnus recursion formulae or Dynkin's non-commutative polynomial comparison method and simple universal algebraic…
We demonstrate and develop dyadic-probabilistic methods in connection with non-homogeneous bilinear operators, namely singular integrals and square functions. We develop the full non-homogeneous theory of bilinear singular integrals using a…