Related papers: Remarks on Pickands theorem

In this note we show that any proof of Wallis's formula or of the probability integral formula proves both assertions.

Eagleson's Theorem asserts that, given a probability-preserving map, ifrenormalized Birkhoff sums of a function converge in distribution, thenthey also converge with respect to any probability measure which isabsolutely continuous with…

This paper refines the argument of Lehman by reducing the size of the constants in Turing's method. This improvement is given in Theorem 1 and scope for further improvements is also given. Analogous improvements to Dirichlet L-functions and…

We prove fractional Leibniz rules and related commutator estimates in the settings of weighted and variable Lebesgue spaces. Our main tools are uniform weighted estimates for sequences of square-function-type operators and a bilinear…

In this paper, we consider a discrete version of iterated integrals by the naive (equally divided) Riemann sum. In particular, basic three formulas for usual iterated integrals are discritized. Moreover, we proved cyclic sum formulas for…

We prove that an innocent looking inequality implies the Riemann Hypothesis and show a way to approach this inequality through sums of Legendre symbols.

In our companion paper \cite{Stojnicgscomp16} we introduce a collection of fairly powerful statistical comparison results. They relate to a general comparison concept and its an upgrade that we call lifting procedure. Here we provide a…

We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…

Bivariate partial-sums discrete probability distributions are defined. The question of the existence of a limit distribution for iterated partial summations is solved for finite-support bivariate distributions which satisfy conditions under…

Given a truncated perturbation expansion of a physical quantity, one can, under certain circumstances, obtain lower or upper bounds (or both) to the sum of the full perturbation series by using the Borel transform and a variational…

We prove a conjecture that arose in the context of a subspace enumeration problem over finite fields. We prove, more generally, a bibasic, double-sum identity, which extends a $q$-analogue of the (terminating) binomial theorem.

Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The…

We give a counting based proof of the Graham Pollak Theorem

We consider backward problems for semilinear coupled parabolic systems in bounded domains. We prove conditional stability estimates for linear and semilinear systems of strongly coupled parabolic equations involving general semilinearities.…

We give a new proof of the fundamental theorem of algebra. It is entirely elementary, focused on using long division to its fullest extent. Further, the method quickly recovers a more general version of the theorem recently obtained by…

The main purpose of this article is to study higher power mean values of generalized quadratic Gauss sums using estimates for character sums, analytic method and algebraic geometric methods. In this article, we prove two conjectures which…

We prove L^p estimates for a class of two-dimensional multilinear forms that naturally generalize (dyadic variants of) both classical paraproducts and the twisted paraproduct introduced in [5] and studied in [1] and [6]. The method we use…

We introduce the subsum polynomial of a partition $\lambda=(\lambda_1, \lambda_2, \ldots, \lambda_k)$ defined by $\mathrm{sp}(\lambda, x)=\prod_{i=1}^k(1+x^{\lambda_i})$. We study the sum of reciprocals of $\mathrm{sp}(\lambda, x)$ over all…

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

We estimate double sums $$ S_\chi(a, I, G) = \sum_{x \in I} \sum_{\lambda \in G} \chi(x + a\lambda), \qquad 1\le a < p-1, $$ with a multiplicative character $\chi$ modulo $p$ where $I= \{1,\ldots, H\}$ and $G$ is a subgroup of order $T$ of…