English
Related papers

Related papers: Approximation of conformal mapping via the Szeg\H{…

200 papers

Let $\mathcal{D}=G/K$ be a complex bounded symmetric domain of tube type in a complex Jordan algebra $V$ and let $\mathcal{D}_{\mathbb{R}}=H/L\subset \mathcal{D}$ be its real form in a formally real Euclidean Jordan algebra $J\subset V$. We…

Representation Theory · Mathematics 2007-05-23 Mark Davidson , Gestur Olafsson , Genkai Zhang

We extend the result of Lavrentiev which asserts that the harmonic measure and the arc-length measure are $A_\infty$ equivalent in a chord-arc Jordan domain. By using this result we extend the classical result of Lindel\"of to the class of…

Complex Variables · Mathematics 2014-10-31 David Kalaj

We consider the Szeg\"o kernel for non-pseudoconvex domains in C^2 given by \Omega = {(z,w): Im w > b(Re z)} for b a non-convex even-degree polynomial with positive leading coefficient. This is an extension of results previously obtained by…

Complex Variables · Mathematics 2011-07-11 Michael Gilliam , Jennifer Halfpap

We describe polynomials of the best uniform approximation to sgn(x) on the union of two intervals in terms of special conformal mappings. This permits us to find the exact asymptotic behavior of the error of this approximation.

Complex Variables · Mathematics 2012-02-07 Alexandre Eremenko , Peter Yuditskii

A circle pattern is a configuration of circles in the plane whose combinatorics is given by a planar graph G such that to each vertex of G corresponds a circle. If two vertices are connected by an edge in G, the corresponding circles…

Metric Geometry · Mathematics 2009-06-09 Ulrike Bücking

We study a cutting-plane method for semidefinite optimization problems (SDOs), and supply a proof of the method's convergence, under a boundedness assumption. By relating the method's rate of convergence to an initial outer approximation's…

Optimization and Control · Mathematics 2020-02-17 Dimitris Bertsimas , Ryan Cory-Wright

We study connections between orthogonal polynomials, reproducing kernel functions, and polynomials $p$ minimizing Dirichlet-type norms $\|pf-1\|_{\alpha}$ for a given function $f$. For $\alpha\in [0,1]$ (which includes the Hardy and…

Complex Variables · Mathematics 2016-12-26 Catherine Bénéteau , Dmitry Khavinson , Constanze Liaw , Daniel Seco , Alan A. Sola

In this paper, we study the relations between the log term of the Szeg\"o kernel of the unit circle bundle of the dual line bundle of an ample line bundle over a compact K\"ahlermanifold. We proved a local rigidity theorem. The result is…

Differential Geometry · Mathematics 2007-05-23 Zhiqin Lu , Gang Tian

Approximation of non-linear kernels using random feature maps has become a powerful technique for scaling kernel methods to large datasets. We propose $\textit{Tensor Sketch}$, an efficient random feature map for approximating polynomial…

Data Structures and Algorithms · Computer Science 2025-05-20 Ninh Pham , Rasmus Pagh

In this paper, we provide new discrete uniformization theorems for bounded, $m$-connected planar domains. To this end, we consider a planar, bounded, $m$-connected domain $\Omega$ and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$…

Geometric Topology · Mathematics 2013-12-24 Sa'ar Hersonsky

The Andreev-Thurston Circle Packing Theorem is generalized to packings of convex bodies in planar simply connected domains. This turns out to be a useful tool for constructing conformal and quasiconformal mappings with interesting geometric…

Complex Variables · Mathematics 2007-09-06 Oded Schramm

In this paper, we deal with the family of Steklov sampling operators in the general setting of Orlicz spaces. The main result of the paper is a modular convergence theorem established following a density approach. To do this, a Luxemburg…

Functional Analysis · Mathematics 2025-10-08 Danilo Costarelli , Erika Russo

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…

Classical Analysis and ODEs · Mathematics 2010-02-11 I. Moale , P. Yuditskii

We consider the problem of positive-semidefinite continuation: extending a partially specified covariance kernel from a subdomain $\Omega$ of a rectangular domain $I\times I$ to a covariance kernel on the entire domain $I\times I$. For a…

Statistics Theory · Mathematics 2022-05-13 Kartik G. Waghmare , Victor M. Panaretos

In this paper, we introduce a method known as polynomial frame approximation for approximating smooth, multivariate functions defined on irregular domains in $d$ dimensions, where $d$ can be arbitrary. This method is simple, and relies only…

Numerical Analysis · Mathematics 2020-05-27 Ben Adcock , Daan Huybrechs

As is well known the kernel of the orthogonal projector onto the polynomials of degree $n$ in $L^2(w_{\a,\b}, [-1, 1])$ with $w_{\a,\b}(t) = (1-t)^\a(1+t)^\b$ can be written in terms of Jacobi polynomials. It is shown that if the…

Classical Analysis and ODEs · Mathematics 2007-05-23 Pencho Petrushev , Yuan Xu

We study the convergence of a discretized Fourier orthogonal expansion in orthogonal polynomials on $B^2 \times [-1,1]$, where $B^2$ is the closed unit disk in $\RR^2$. The discretized expansion uses a finite set of Radon projections and…

Numerical Analysis · Mathematics 2009-06-15 Jeremy Wade

In Mergelyan type approximation we uniformly approximate functions on compact sets K by polynomials or rational functions or holomorphic functions on varying open sets containing K. In the present paper we consider analogous approximation,…

Complex Variables · Mathematics 2020-06-04 Sotiris Armeniakos , Giorgos Kotsovolis , Vassili Nestoridis

We prove optimal estimates of the Bergman and Szeg\H{o} kernels on the diagonal, and the Bergman metric near the boundary of bounded smooth generalized decoupled pseudoconvex domains in $\mathbb{C}^n$. The generalized decoupled domains we…

Complex Variables · Mathematics 2023-12-21 Ravi Shankar Jaiswal

We extend recent work of Gurel-Gurevich--Jerison--Nachmias (2020) and Bou-Rabee--Gwynne (2024) by showing that as the mesh of our lattice tends to $0$, we have a polynomial rate of convergence for the Dirichlet problem on orthodiagonal maps…

Probability · Mathematics 2025-03-27 David Pechersky
‹ Prev 1 4 5 6 7 8 10 Next ›