Related papers: Error bounds of regularized gap functions for poly…

We consider stochastic variational inequality problems where the mapping is monotone over a compact convex set. We present two robust variants of stochastic extragradient algorithms for solving such problems. Of these, the first scheme…

For a polynomial $P$ mapping the integers into the integers, define an averaging operator $A_{N} f(x):=\frac{1}{N}\sum_{k=1}^N f(x+P(k))$ acting on functions on the integers. We prove sufficient conditions for the $\ell^{p}$-improving…

In this article we prove modular and norm P\'olya-Szeg\"o inequalities in general fractional Orlicz-Sobolev spaces by using the polarization technique. We introduce a general framework which includes the different definitions of theses…

A classical inequality of Sz\'asz bounds polynomials with no zeros in the upper half plane entirely in terms of their first few coefficients. Borcea-Br\"and\'en generalized this result to several variables as a piece of their…

Uniformly regular equilibrium problems are natural generalizations of abstract equilibrium prob lems and they are defined over the uniformly prox-regular nonconvex sets. Some new efficient implicit methods for solving uniformly regular…

Nikol'skii inequalities for various sets of functions, domains and weights will be discussed. Much of the work is dedicated to the class of algebraic polynomials of total degree $n$ on a bounded convex domain $D$. That is, we study…

We investigate random compact sets with random functions defined thereon, such as polynomials, rational functions, the pluricomplex Green function and the Siciak extremal function. One surprising consequence of our study is that randomness…

We investigate degree bounds for fields of rational invariants of representations of finite groups. We prove many cases of a bound for $\mathbb{Z}/p\mathbb{Z}$ conjectured by Blum-Smith, Garcia, Hidalgo, and Rodriguez. For arbitrary groups,…

The primary objective of this paper is to establish several sharp versions of improved Bohr inequality, refined Bohr-type inequality, and refined Bohr-Rogosinski inequality for the class of $K$-quasiconformal sense-preserving harmonic…

This survey paper was primarily written as as the support for a course pesented at the JNCF2025: it aims to present some material that illustrates the kind of estimates one can obtain in effective algebraic geometry, for affine polynomial…

This is the second part of a series of four articles on weighted norm inequalities, off-diagonal estimates and elliptic operators. We consider a substitute to the notion of pointwise bounds for kernels of operators which usually is a…

This paper identifies necessary and sufficient conditions for the exactness of penalty functions in optimization problems whose constraint sets are not necessarily bounded. The case where the data of problems is locally Lipschitz,…

This paper introduces a novel error estimator for the Proper Generalized Decomposition (PGD) approximation of parametrized equations. The estimator is intrinsically random: It builds on concentration inequalities of Gaussian maps and an…

We present a global version of the {\L}ojasiewicz inequality on comparing the rate of growth of two polynomial functions in the case the mapping defined by these functions is (Newton) non-degenerate at infinity. In addition, we show that…

Many interesting functions arising in applications map into Riemannian manifolds. We present an algorithm, using the manifold exponential and logarithm, for approximating such functions. Our approach extends approximation techniques for…

Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…

We present a general approach, based on exponential inequalities, to derive bounds on the generalization error of randomized learning algorithms. Using this approach, we provide bounds on the average generalization error as well as bounds…

The partial coloring method is one of the most powerful and widely used method in combinatorial discrepancy problems. However, in many cases it leads to sub-optimal bounds as the partial coloring step must be iterated a logarithmic number…

We investigate Lawruk elliptic boundary-value problems for homogeneous differential equations in a two-sided refined Sobolev scale. These problems contain additional unknown functions in the boundary conditions of arbitrary orders. The…

The gap probability generating function has as its coefficients the probability of an interval containing exactly $k$ eigenvalues. For scaled random matrices with orthogonal symmetry, and the interval at the hard or soft spectrum edge, the…