English
Related papers

Related papers: Approximation of sets defined by polynomials with …

200 papers

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

Combinatorics · Mathematics 2022-07-19 T. Mitchell Roddenberry , Santiago Segarra

We give conditions in order to approximate locally uniformly holomorphic covering mappings of the unit ball of $\mathbb{C}^n$ with respect to an arbitrary norm, with entire holomorphic covering mappings. The results rely on a generalization…

Complex Variables · Mathematics 2023-06-16 Matteo Fiacchi

Some Dirichlet-like functions, attached to a pair (periodic function, polynomial) are introduced and studied. These functions generalize the standard Dirichlet L-functions of Dirichlet characters. They have similar properties, being…

Number Theory · Mathematics 2025-03-25 Frédéric Chapoton

Let D be a strictly convex domain of C^n, f_1 and f_2 be two holomorphic functions defined on a neighborhood of closure of D and set X_l={z, f_l(z)=0}, l=1,2. Suppose that X_l\cap bD is transverse for l=1 and l=2, and that X_1\cap X_2 is a…

Complex Variables · Mathematics 2012-07-09 William Alexandre , Emmanuel Mazzilli

Given a system of functions f = (f1, . . . , fd) analytic on a neighborhood of some compact subset E of the complex plane, we give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of…

Complex Variables · Mathematics 2018-10-17 N. Bosuwan , G. Lopez Lagomasino , Y. Zaldivar Gerpe

We prove that, if f:R^n\to R satisfies Fr\'echet's functional equation and f(x_1,...,x_n) is not an ordinary algebraic polynomial in the variables x_1,...,x_n, then f is unbounded on all non-empty open set U of R^n. Furthermore, the closure…

Classical Analysis and ODEs · Mathematics 2014-01-21 J. M. Almira , Kh. F. Abu-Helaiel

We consider a formal power series in one variable whose coefficients are holomorphic functions in a given multidimensional complex domain. Assume the following two conditions on the series. (C1) The restriction of the series at each point…

Complex Variables · Mathematics 2025-09-09 Hiroki Aoki , Kyoji Saito

We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.

Complex Variables · Mathematics 2020-11-06 Javad Mashreghi , Thomas Ransford

We prove that each semialgebraic subset of $\R^n$ of positive codimension can be locally approximated of any order by means of an algebraic set of the same dimension. As a consequence of previous results, algebraic approximation preserving…

Algebraic Geometry · Mathematics 2014-09-24 Massimo Ferrarotti , Elisabetta Fortuna , Leslie Wilson

We study sufficient conditions on weight functions under which norm approximations by analytic polynomials are possible. The weights we study include radial, non-radial, and angular weights.

Functional Analysis · Mathematics 2022-02-09 Ali Abkar

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

Computational Complexity · Computer Science 2020-11-17 Balagopal Komarath , Anurag Pandey , C. S. Rahul

Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…

Numerical Analysis · Mathematics 2025-01-27 Nira Dyn , David Levin

Given an arbitrary long but finite sequence of observations from a finite set, we construct a simple process that approximates the sequence, in the sense that with high probability the empirical frequency, as well as the empirical one-step…

Statistics Theory · Mathematics 2007-06-13 Dinah Rosenberg , Eilon Solan , Nicolas Vieille

In this note, we continue to highlight some applications of Theorem 1 of [3]. Here is a sample: Let $X$ be an open set in ${\bf C}^n$, $\Omega$ an open convex set in ${\bf C}$ and $f, g : X\to {\bf C}$ two holomorphic functions such that…

Functional Analysis · Mathematics 2014-02-19 Biagio Ricceri

Under mild conditions on a family of independent random variables $(X_n)$ we prove that almost sure convergence of a sequence of tetrahedral polynomial chaoses of uniformly bounded degrees in the variables $(X_n)$ implies the almost sure…

Probability · Mathematics 2019-10-24 Radosław Adamczak

We consider sequences of operators $U_n:L^1(X)\to M(X)$, where $X$ is a space of homogeneous type. Under certain conditions on the operators $U_n$ we give a complete characterization of convergence (divergence) sets of functional sequences…

Classical Analysis and ODEs · Mathematics 2025-12-09 Grigori A. Karagulyan

For a function $f$ that is piecewise analytic on a quasi-smooth arc $\mathcal{L}$ and any $0<\sigma<1$ we construct a sequence of "near-best" polynomials that converge at a rate $e^{-n^{\sigma}}$ at each point of analyticity of $f$ and are…

Complex Variables · Mathematics 2021-02-04 Liudmyla Kryvonos

We consider matrices of the form $qD+A$, with $D$ being the diagonal matrix of degrees, $A$ being the adjacency matrix, and $q$ a fixed value. Given a graph $H$ and $B\subseteq V(G)$, which we call a coalescent pair $(H,B)$, we derive a…

Combinatorics · Mathematics 2022-09-09 Steve Butler , Elena D'Avanzo , Rachel Heikkinen , Joel Jeffries , Alyssa Kruczek , Harper Niergarth

A method for constructing homogeneous Lyapunov functions of degree 1 from polynomial invariant sets is presented for linear time varying systems, homogeneous dynamic systems and the class of nonlinear systems that can be represented as…

Dynamical Systems · Mathematics 2023-03-07 Hassan Abdelraouf , Eric Feron , Jeff Shamma

We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least nonnegative solution, say mu, of such equation systems is…

Data Structures and Algorithms · Computer Science 2010-02-03 Javier Esparza , Andreas Gaiser , Stefan Kiefer