Related papers: Bounds on strong unicity for Chebyshev approximati…
Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For…
Using proof-theoretic methods in the style of proof mining, we give novel computationally effective limit theorems for the convergence of the Cesaro-means of certain sequences of random variables. These results are intimately related to…
In this paper, we establish a new estimate (including lower and upper bounds) for an important quantity involved in the convergence analysis of smoothed aggregation algebraic multigrid methods. The new upper bound improves the existing…
Energy bounds which are uniform in the background metric are obtained from upper bounds for entropy-like quantities. The argument is based on auxiliary Monge-Amp\`ere equations involving sublevel sets, and bypasses the…
We prove an endpoint version of the uniform Sobolev inequalities in Kenig-Ruiz-Sogge [8]. It was known that strong type inequalities no longer hold at the endpoints; however, we show that restricted weak type inequalities hold there, which…
We give new improvements to the Chudnovsky-Chudnovsky method that provides upper bounds on the bilinear complexity of multiplication in extensions of finite fields through interpolation on algebraic curves. Our approach features three…
In this paper, we derive new probability bounds for Chebyshev's inequality if the supremum of the probability density function is known. This result holds for one-dimensional or multivariate continuous probability distributions with finite…
Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…
In 1956, Green provided a bound on the order of the Schur multiplier of $p$-groups. This bound, given as a function of the order of the group, is the best possible. Since then, the bound has been refined numerous times by adding other…
In the present work we consider rational best approximations to the exponential function that minimize a uniform error on a subset of the imaginary axis. Namely, Chebyshev approximation and unitary best approximation where the latter is…
For a finite group we introduce a particular central extension, the unitary cover, having minimal exponent among those satisfying the projective lifting property. We obtain new bounds for the exponent of the Schur multiplier relating to…
We present a survey of central developments in the theory of Chebyshev polynomials, introduced by P.~L.~Chebyshev and later extended to the complex plane by G.~Faber. Our primary focus is their defining extremal property: among all…
We prove uniform $L^p$ bounds for multilinear operators which are given by multipliers whose symbols are singular on a one dimensional subspace. The novelty is that these bounds are uniform in the choice of the subspace.
We find optimal conditions on $m$-linear Fourier multipliers to give rise to bounded operators from a product of Hardy spaces $H^{p_j}$, $0<p_j\le 1$, to Lebesgue spaces $L^p$. The conditions we obtain are necessary and sufficient for…
We derive a stronger uniqueness result if a function with compact support and its truncated Hilbert transform are known on the same interval by using the Sokhotski-Plemelj formulas. To find a function from its truncated Hilbert transform,…
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and…
In this short note, we closely follow the approach of Green and Tao to extend the best known bound for recurrence modulo 1 from squares to the largest possible class of polynomials. The paper concludes with a brief discussion of a…
In this paper, we derive optimality conditions (Chebyshev approximation) for multivariate functions. The theory of Chebyshev (uniform) approximation for univariate functions is very elegant. The optimality conditions are based on the notion…
Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…
We give improved bounds for the equidistribution of (multiparameter) nilsequences subject to any degree filtration. The bounds we obtain are single exponential in dimension, improving on double exponential bounds of Green and Tao. To obtain…