English
Related papers

Related papers: Logarithmic Derivatives of Least Deviation from Ze…

200 papers

This paper studies the $H^1$ Sobolev seminorm of quadratic functions. The research is motivated by the least-norm interpolation that is widely used in derivative-free optimization. We express the $H^1$ seminorm of a quadratic function…

Optimization and Control · Mathematics 2013-03-21 Zaikun Zhang

We strengthen the Weierstrass approximation theorem by proving that any real-valued continuous function on an interval $I \subset \mathbb{R}$ can be uniformly approximated by a real-valued polynomial whose only (possibly complex) critical…

Classical Analysis and ODEs · Mathematics 2025-01-07 David L. Bishop

In order to construct regularizations of continuous linear functionals acting on Sobolev spaces such as $W_0^{1,q}(\Omega)$, where $1<q<\infty$ and $\Omega$ is a Lipschitz domain, we propose a projection method in negative Sobolev spaces…

Numerical Analysis · Mathematics 2022-11-15 Felipe Millar , Ignacio Muga , Sergio Rojas , Kristoffer G. Van der Zee

We obtain upper bounds for the norm of the Schwarzian derivative of convex holomorphic mappings defined on the polydisk and the unit ball in $\mathbb{C}^n$. For coordinate-wise convex mappings on the polydisk, we derive a sharp estimate…

Complex Variables · Mathematics 2026-04-15 Rodrigo Hernández

The goal of this paper is to attract attention of the reader to a dimension-free geometric inequality that can be proved using the classical needle decomposition. This inequality allows us to derive sharp dimension-free estimates for the…

Classical Analysis and ODEs · Mathematics 2007-05-23 F. Nazarov , M. Sodin , A. Volberg

We study the approximation of arbitrary distributions $P$ on $d$-dimensional space by distributions with log-concave density. Approximation means minimizing a Kullback--Leibler-type functional. We show that such an approximation exists if…

Statistics Theory · Mathematics 2011-10-17 Lutz Duembgen , Richard Samworth , Dominic Schuhmacher

The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…

Quantum Physics · Physics 2008-02-15 Ronald de Wolf

We examine several characteristics of conformal maps that resemble the variance of a Gaussian: asymptotic variance, the constant in Makarov's law of iterated logarithm and the second derivative of the integral means spectrum at the origin.…

Complex Variables · Mathematics 2016-04-20 Oleg Ivrii

Lavrik and the author gave uniform bounds of the error term in the approximate functional equation for the derivatives of the Hardy's Z-function. We obtain a new bound of this error term which is much better for high order derivatives.

Number Theory · Mathematics 2018-09-05 Philippe Blanc

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

Data Structures and Algorithms · Computer Science 2009-02-10 Mahdi Cheraghchi , Amin Shokrollahi

Theorem 1.2.6 of [ATW20] provides a relatively functorial logarithmic principalization of ideals on relative logarithmic orbifolds $X\to B$ in characteristic 0, relying on a delicate monomialization theorem for Kummer ideals. The paper…

Algebraic Geometry · Mathematics 2025-03-18 Dan Abramovich , Michael Temkin , Jarosław Włodarczyk

We investigate Chebyshev polynomials corresponding to Jacobi weights and determine monotonicity properties of their related Widom factors. This complements work by Bernstein from 1930-31 where the asymptotical behavior of the related…

Classical Analysis and ODEs · Mathematics 2024-09-05 Jacob S. Christiansen , Olof Rubin

In this paper, using techniques developed in our earlier works on the theory of mod-Gaussian convergence, we prove precise moderate and large deviation results for the logarithm of the characteristic polynomial of a random unitary matrix.…

Probability · Mathematics 2022-02-18 Pierre-Loïc Méliot , Ashkan Nikeghbali

We establish moment estimates for the invariant measure of a stochastic partial differential equation describing motion by mean curvature flow in (1+1) dimension, leading to polynomial stability of the associated Markov semigroup. We also…

Probability · Mathematics 2019-01-28 Abelhadi Es-Sarhir , Max von Renesse , Wilhelm Stannat

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

Classical Analysis and ODEs · Mathematics 2020-01-01 R. M. Trigub

The Lemma on the Logarithmic Derivative of a meromorphic function has many applications in the study of meromorphic functions and ordinary differential equations. In this paper, a difference analogue of the Logarithmic Derivative Lemma is…

Complex Variables · Mathematics 2007-05-23 R. G. Halburd , R. J. Korhonen

This paper is devoted to studying the first-order variational analysis of non-convex and non-differentiable functions that may not be subdifferentially regular. To achieve this goal, we entirely rely on two concepts of directional…

Optimization and Control · Mathematics 2022-04-22 Ashkan Mohammadi

We prove well-posedness for some abstract differential equations of the first order. Our result covers the usual case of Lipschitz composition operators. It also contains the case of some integro-differential operators acting on spaces with…

Functional Analysis · Mathematics 2017-09-28 Arnaud Heibig

The problem of low rank approximation is ubiquitous in science. Traditionally this problem is solved in unitary invariant norms such as Frobenius or spectral norm due to existence of efficient methods for building approximations. However,…

Numerical Analysis · Mathematics 2023-08-25 Stanislav Morozov , Matvey Smirnov , Nikolai Zamarashkin

There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given…

Numerical Analysis · Mathematics 2025-10-20 P. H. D. Ramakrishna , Sudebkumar Prasant Pal , Samir Bhalla , Hironmay Basu , Sudhir Kumar Singh