English
Related papers

Related papers: Polynomial approximation, local polynomial convexi…

200 papers

An algebraic approximation, of order $K$, of a polyhedron correlation function (CF) can be obtained from $\gamma\pp(r)$, its chord-length distribution (CLD), considering first, within the subinterval $[D_{i-1},\, D_i]$ of the full range of…

General Mathematics · Mathematics 2020-12-03 Salvino Ciccariello

We show that a function $f : X \to \mathbb R$ defined on a closed uniformly polynomially cuspidal set $X$ in $\mathbb R^n$ is real analytic if and only if $f$ is smooth and all its composites with germs of polynomial curves in $X$ are real…

Classical Analysis and ODEs · Mathematics 2023-11-07 Armin Rainer

Classical theorems from the early 20th century state that any Haar measurable homomorphism between locally compact groups is continuous. In particular, any Lebesgue-measurable homomorphism $\phi:\mathbb{R} \to \mathbb{R}$ is of the form…

Geometric Topology · Mathematics 2024-09-05 Tom Meyerovitch , Omri Nisan Solan

The celebrated and famous Weierstrass approximation theorem characterizes the set of continuous functions on a compact interval via uniform approximation by algebraic polynomials. This theorem is the first significant result in…

Classical Analysis and ODEs · Mathematics 2008-05-07 Dilcia Perez , Yamilet Quintana

Let D be a smoothly bounded domain in complex space of dimension larger than 2. Suppose that D admits a smooth defining function which is plurisubharmonic on the boundary of D. Then the Diederich-Fornaess exponent can be chosen arbitrarily…

Complex Variables · Mathematics 2011-10-10 J. E. Fornaess , A. -K. Herbig

We prove a version of the Bernstein-Walsh theorem on uniform polynomial approximation of holomorphic functions on compact sets in several complex variables. Here we consider subclasses of the full polynomial space associated to a convex…

Complex Variables · Mathematics 2017-01-23 Len Bos , Norm Levenberg

Let $M$ be a strictly convex smooth connected hypersurface in $\mathbb R^n$ and $\widehat{M}$ its convex hull. We say that $M$ is locally polynomially integrable if the $(n-1)-$ dimensional volumes of the sections of $\widehat M$ by…

Metric Geometry · Mathematics 2021-03-03 Mark Agranovsky

A multivariate polynomial $p(x)=p(x_1,...,x_n)$ is sos-convex if its Hessian $H(x)$ can be factored as $H(x)= M^T(x) M(x)$ with a possibly nonsquare polynomial matrix $M(x)$. It is easy to see that sos-convexity is a sufficient condition…

Optimization and Control · Mathematics 2012-09-19 Amir Ali Ahmadi , Pablo A. Parrilo

A graph is well-covered if all its maximal independent sets are of the same cardinality (Plummer, 1970). If G is a well-covered graph, has at least two vertices, and G-v is well-covered for every vertex v, then G is a 1-well-covered graph…

Combinatorics · Mathematics 2016-12-13 Vadim E. Levit , Eugen Mandrescu

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin

This note adapts the sophisticated Richberg technique for approximation in pluripotential theory to the $F$-potential theory associated to a general nonlinear convex subequation $F \subset J^2(X)$ on a manifold $X$. The main theorem is the…

Analysis of PDEs · Mathematics 2020-05-11 F. Reese Harvey , H. Blaine Lawson, , Szymon Pliś

Reidl, S\'anchez Villaamil, and Stravopoulos (2019) characterized graph classes of bounded expansion as follows: A class $\mathcal{C}$ closed under subgraphs has bounded expansion if and only if there exists a function $f:\mathbb{N} \to…

Combinatorics · Mathematics 2024-11-05 Gwenaël Joret , Clément Rambaud

This is a continuation of the series of notes on the dynamics of quadratic polynomials. We show the following Rigidity Theorem: Any combinatorial class contains at most one quadratic polynomial satisfying the secondary limbs condition with…

Dynamical Systems · Mathematics 2016-09-06 Mikhail Lyubich

In this note we investigate the regularity of geodesics in the space of convex and plurisubharmonic functions. In the real setting we prove (optimal) local C^{1,1} regularity. We construct examples which prove that the global C^{1,1}…

Complex Variables · Mathematics 2019-06-05 Soufian Abja , Slawomir Dinew

In this paper, we investigate the geometric properties of complex-valued pluriharmonic mappings defined over convex Reinhardt domains in $\mathbb{C}^n$. We first establish a multidimensional analogue of the Noshiro-Warschawski Theorem,…

Complex Variables · Mathematics 2026-02-03 Molla Basir Ahamed , Sujoy Majumder , Debabrata Pramanik

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

Complex Variables · Mathematics 2019-09-11 Sushil Gorai

In this paper we characterize "large" regular graphs using certain entries in the projection matrices onto the eigenspaces of the graph. As a corollary of this result, we show that "large" association schemes become $P$-polynomial…

Combinatorics · Mathematics 2015-04-16 Hiroshi Nozaki

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

Complex Variables · Mathematics 2018-12-10 Kamal Diki , Sorin G. Gal , Irene Sabadini

In pursuit of a deeper understanding of Boolean Promise Constraint Satisfaction Problems (PCSPs), we identify a class of problems with restricted structural complexity, which could serve as a promising candidate for complete…

Computational Complexity · Computer Science 2025-10-01 Katzper Michno

We study the convex hull of the graph of a quadratic function $f(\mathbf{x})=\sum_{ij\in E}x_ix_j$, where the sum is over the edge set of a graph $G$ with vertex set $\{1,\dots,n\}$. Using an approach proposed by Gupte et al. (Discrete…

Optimization and Control · Mathematics 2020-07-14 Mitchell Harris , Thomas Kalinowski