English
Related papers

Related papers: Approximate polymorphisms

200 papers

Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…

Computational Physics · Physics 2007-05-23 C. Semay

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

Computational Complexity · Computer Science 2021-07-08 Srikanth Srinivasan , S. Venkitesh

This paper presents a novel method for generating a single polynomial approximation that produces correctly rounded results for all inputs of an elementary function for multiple representations. The generated polynomial approximation has…

Mathematical Software · Computer Science 2022-03-18 Mridul Aanjaneya , Jay P. Lim , Santosh Nagarakatte

Let $G$ be a group. A function $l:G\rightarrow \lbrack 0,\infty )$ is called a length function if (1) $l(g^{n})=|n|l(g)$ for any $g\in G$ and $n\in \mathbb{Z};$ (2) $l(hgh^{-1})=l(g)$ for any $h,g\in G;$ and (3) $l(ab)\leq l(a)+l(b)$ for…

Group Theory · Mathematics 2023-01-11 Shengkui Ye

Let $f$ be a chain mixing continuous onto mapping from the Cantor set onto itself.Let $g$ be an aperiodic homeomorphism on the Cantor set. We show that homeomorphisms that are topologically conjugate to g approximate $f$ in the topology of…

Dynamical Systems · Mathematics 2015-06-26 Takashi Shimomura

The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…

Computational Complexity · Computer Science 2018-12-18 Peter Bürgisser

This expository article proves some results of Ferguson, on the approximation of continuous functions on a compact subset of R by polynomials with integral coefficients.

Classical Analysis and ODEs · Mathematics 2025-10-20 Laurent Berger

Gowers introduced, for d\geq 1, the notion of dimension-d uniformity U^d(f) of a function f: G -> \C, where G is a finite abelian group and \C are the complex numbers. Roughly speaking, if U^d(f) is small, then f has certain…

Combinatorics · Mathematics 2007-05-23 Alex Samorodnitsky , Luca Trevisan

This note establishes smooth approximation from above for J-plurisubharmonic functions on an almost complex manifold (X,J). The following theorem is proved. Suppose X is J-pseudoconvex, i.e., X admits a smooth strictly J-plurisubharmonic…

Complex Variables · Mathematics 2017-12-12 F. Reese Harvey , H. Blaine Lawson, , Szymon Pliś

We analyze the accuracy of the discrete least-squares approximation of a function $u$ in multivariate polynomial spaces $\mathbb{P}_\Lambda:={\rm span} \{y\mapsto y^\nu \,: \, \nu\in \Lambda\}$ with $\Lambda\subset \mathbb{N}_0^d$ over the…

Numerical Analysis · Mathematics 2016-10-25 Albert Cohen , Giovanni Migliorati , Fabio Nobile

We present a new method for approximating real-valued functions on ${\mathbb R}^+$ by linear combinations of exponential functions with complex coefficients. The approach is based on a multi-point Pad\'e approximation of the Laplace…

Numerical Analysis · Mathematics 2026-05-05 Alexey Kuznetsov , Armin Mohammadioroojeh

It is known that the dynamics of $f$ and $g$ vary to a large extent from that of its composite entire functions. Using Approximation theory of entire functions, we have shown the existence of entire functions $f$ and $g$ having infinite…

Dynamical Systems · Mathematics 2015-10-08 Dinesh Kumar , Gopal Datt , Sanjay Kumar Pant

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

Optimization and Control · Mathematics 2018-07-18 Amir Ali Ahmadi , Etienne de Klerk , Georgina Hall

To every subspace arrangement X we will associate symmetric functions P[X] and H[X]. These symmetric functions encode the Hilbert series and the minimal projective resolution of the product ideal associated to the subspace arrangement. They…

Combinatorics · Mathematics 2008-01-30 Harm Derksen

It was conjectured that if $f\in C^1(\mathbb{R}^n,\mathbb{R}^n)$ satisfies $\operatorname{rank} Df\leq m<n$ everywhere in $\mathbb{R}^n$, then $f$ can be uniformly approximated by $C^\infty$-mappings $g$ satisfying $\operatorname{rank}…

Metric Geometry · Mathematics 2023-02-07 Paweł Goldstein , Piotr Hajłasz

For a polynomial map $\mathbf{f} : k^n \to k^m$ ($k$ a field), we investigate those polynomials $g \in k[t_1,\ldots, t_n]$ that can be written as a composition $g = h \circ \mathbf{f}$, where $h: k^m \to k$ is an arbitrary function. In the…

Commutative Algebra · Mathematics 2019-09-04 Erhard Aichinger

Motivated by recent work on optimal approximation by polynomials in the unit disk, we consider the following noncommutative approximation problem: for a polynomial $f$ in $d$ freely noncommuting arguments, find a free polynomial $p_n$, of…

Functional Analysis · Mathematics 2022-09-22 Palak Arora , Meric Augat , Michael Jury , Meredith Sargent

Let X be an affine irreducible variety over an algebraically closed field k of characteristic zero. Given an automorphism F, we denote by k(X)^F its field of invariants, i.e. the set of rational functions f on X such that f(F)=f. Let n(F)…

Algebraic Geometry · Mathematics 2007-05-23 Philippe Bonnet

Given any non-polynomial $G$-function $F(z)=\sum\_{k=0}^\infty A\_k z^k$ of radius of convergence $R$, we consider the $G$-functions $F\_n^{[s]}(z)=\sum\_{k=0}^\infty \frac{A\_k}{(k+n)^s}z^k$ for any integers $s\geq 0$ and $n\geq 1$. For…

Number Theory · Mathematics 2017-02-01 Stéphane Fischler , Tanguy Rivoal

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

Dynamical Systems · Mathematics 2025-09-10 Robert Bland , Kevin McGoff