相关论文: Absolute Bounds for Ergodic Deviations of Toral Tr…

Given a positive increasing function $\varphi$, we show that for a full measure set of vectors $\alpha\in \mathbb{R}^d$, the maximal ergodic discrepancy of the $d$-linear form sequence $\left\{\sum_{1\le i\le d} k_i\alpha_i \mod…

We show the existence of a limiting distribution $\cD_\cC$ of the adequately normalized discrepancy function of a random translation on a torus relative to a strictly convex set $\cC$. Using a correspondence between the small divisors in…

Let $\Omega \subset \mathbb{R}^2$ be a bounded convex domain in the plane and consider \begin{align*} -\Delta u &=1 \qquad \mbox{in}~\Omega \\ u &= 0 \qquad \mbox{on}~\partial \Omega. \end{align*} If $u$ assumes its maximum in $x_0 \in…

We prove the following asymptotically tight lower bound for $k$-color discrepancy: For any $k \geq 2$, there exists a hypergraph with $n$ hyperedges such that its $k$-color discrepancy is at least $\Omega(\sqrt{n})$. This improves on the…

We prove the first nontrivial worst-case lower bounds for two closely related problems. First, $\Omega(n^{3/2})$ degree-1 reductions, series-parallel reductions, and $\Delta$Y transformations are required in the worst case to reduce an…

We discuss some classical and recent results and open problems on the statistical behavior of ergodic sums above toral translations, and their applications to Diophantine approximations and to ergodic properties of systems related to…

A new upper bound on the relative entropy is derived as a function of the total variation distance for probability measures defined on a common finite alphabet. The bound improves a previously reported bound by Csisz\'ar and Talata. It is…

We introduce sufficient conditions on discrete singular integral operators for their maximal truncations to satisfy a sparse bound. The latter imply a range of quantitative weighted inequalities, which are new. As an application, we prove…

We prove polynomial upper bounds for the deviation of ergodic averages for the straight line flow on every translation surface in almost every direction, in particular for those surfaces arising from rational polygonal billiards.

The distributional properties of the translation flow on the unit square have been considered in different fields of mathematics, including algebraic geometry and discrepancy theory. One method to quantify equidistribution is to compare the…

We consider large deviations of the cover time of the discrete torus $(\mathbb{Z}/N\mathbb{Z})^d$, $d \geq 3$ by simple random walk. We prove a lower bound on the probability that the cover time is smaller than $\gamma\in (0,1)$ times its…

We study the Kronecker sequence $\{n\alpha\}_{n\leq N}$ on the torus ${\mathbb T}^d$ when $\alpha$ is uniformly distributed on ${\mathbb T}^d.$ We show that the discrepancy of the number of visits of this sequence to a random box,…

We study non-trivial translation-invariant probability measures on the space of entire functions of one complex variable. The existence (and even an abundance) of such measures was proven by Benjamin Weiss. Answering Weiss question, we find…

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

There exists a positive function $\psi(t)${on}$t\geq0${, with fast decay at infinity, such that for every measurable set}$\Omega${in the Euclidean space and}$R>0${, there exist entire functions}$A(x) ${and}$B(x) ${of exponential type}$R${,…

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…

Based on T.Tao's result of norm convergence of multiple ergodic averages for commut-ing transformation, we obtain there is a subsequence which converges almost everywhere. Meanwhile, the ergodic behaviour, which the time average is equal to…

Elementary trapping sets (ETSs) are the main culprits for the performance of LDPC codes in the error floor region. Due to the large quantity, complex structures, and computational difficulties of ETSs, how to eliminate dominant ETSs in…

We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by…

The Moser-Trudinger embedding has been generalized in [Adimurthi A.; Sandeep K., A singular Moser-Trudinger embedding and its applications, \textit{NoDEA Nonlinear Differential Equations Appl.}, 13 (2007), no. 5-6, 585--603] to the…