English
Related papers

Related papers: Approximate polymorphisms

200 papers

We study the maximum Hamming distance (or rather, the complementary notion of "minimum approximability") of a general function on a finite group $G$ to either of the sets $\operatorname{End}(G)$ and $\operatorname{Aff}(G)$, of group…

Group Theory · Mathematics 2019-10-31 Alexander Bors

Given a function f: {0,1}^n \to {0,1}, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. An…

Data Structures and Algorithms · Computer Science 2011-12-30 Eric Blais , Amit Weinstein , Yuichi Yoshida

In this paper, we address the problem of approximating a multivariate function defined on a general domain in $d$ dimensions from sample points. We consider weighted least-squares approximation in an arbitrary finite-dimensional space $P$…

Numerical Analysis · Mathematics 2019-12-17 Ben Adcock , Juan M. Cardenas

Let $X_{1},...,X_{n}$ be compact spaces and $X=X_{1}\times ... \times X_{n}.$ Consider the approximation of a function $f\in C(X)$ by sums $g_{1}(x_{1})+... g_{n}(x_{n}),$ where $g_{i}\in C(X_{i}),$ $i=1,...,n.$ In [8], M.Golomb obtained a…

Functional Analysis · Mathematics 2008-07-10 Vugar Ismailov

We consider the problem of jointly minimizing forms of two Boolean functions $f, g \colon \{0,1\}^J \to \{0,1\}$ such that $f + g \leq 1$ and so as to separate disjoint sets $A \cup B \subseteq \{0,1\}^J$ such that $f(A) = \{1\}$ and $g(B)…

Machine Learning · Computer Science 2022-09-09 David Stein , Bjoern Andres

We show that if a polynomial $f\in \mathbb{R}[x_1,\ldots,x_n]$ is nonnegative on a closed basic semialgebraic set $X=\{x\in\mathbb{R}^n:g_1(x)\ge 0,\ldots,g_r (x)\ge 0\}$, where $g_1,\ldots,g_r\in\mathbb{R}[x_1,\ldots,x_n]$, then $f$ can be…

Algebraic Geometry · Mathematics 2015-07-23 Krzysztof Kurdyka , Stanisław Spodzieja

Let $G$ be a graph with vertex set $V(G)$, $f$ a permutation of $V(G)$. Define $\delta_f(G)=|d(x,y)-d(f(x),f(y))|$ and $\delta_f(G)=\Sigma\delta_f(x,y)$, where the sum is taken over all unordered pair $x$, $y$ of distinct vertices of $G$.…

Combinatorics · Mathematics 2023-12-01 Songnian Xu

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

Computational Complexity · Computer Science 2017-03-20 Mark Bun , Justin Thaler

Efroymson's approximation theorem asserts that if $f$ is a $\mathcal{C}^0$ semialgebraic mapping on a $\mathcal{C}^\infty$ semialgebraic submanifold $M$ of $\mathbb{R}^n$ and if $\varepsilon:M\to \mathbb{R}$ is a positive continuous…

Algebraic Geometry · Mathematics 2019-05-15 Anna Valette , Guillaume Valette

Let $X, Y$ be smooth algebraic varieties of the same dimension. Let $f, g : X \to Y$ be finite polynomial mappings. We say that $f, g$ are equivalent if there exists a regular automorphism $\Phi \in Aut(X)$ such that $f = g\circ \Phi$. Of…

Algebraic Geometry · Mathematics 2015-03-10 Zbigniew Jelonek

These notes are about ridge functions. Recent years have witnessed a flurry of interest in these functions. Ridge functions appear in various fields and under various guises. They appear in fields as diverse as partial differential…

Classical Analysis and ODEs · Mathematics 2020-09-01 Vugar Ismailov

There exist well-known tight bounds on the error between a function $f \in C^{\,n + 1}([-1, 1])$ and its best polynomial approximation of degree $n$. We show that the error meets these bounds when and only when $f$ is a polynomial of degree…

Classical Analysis and ODEs · Mathematics 2020-01-06 Patrick Kidger

Let $X$ be a compact metric space which is locally absolutely retract and let $\phi: C(X)\to C(Y, M_n)$ be a unital homomorphism, where $Y$ is a compact metric space with ${\rm dim}Y\le 2.$ It is proved that there exists a sequence of $n$…

Operator Algebras · Mathematics 2009-09-10 Huaxin Lin

If $f\in L^2(R^d)$ and if the function $f(x)f(y)$ is close in $L^2(R^{2d})$ norm to a radially symmetric function of $(x,y)$ then $f$ is close in $L^2$ norm to a centered Gaussian function. This is proved in a quantitative form with the…

Classical Analysis and ODEs · Mathematics 2015-06-02 Michael Christ

The diagonal of a multivariate power series F is the univariate power series Diag(F) generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and…

Symbolic Computation · Computer Science 2015-10-16 Alin Bostan , Louis Dumont , Bruno Salvy

We propose to approximate a (possibly discontinuous) multivariate function f (x) on a compact set by the partial minimizer arg miny p(x, y) of an appropriate polynomial p whose construction can be cast in a univariate sum of squares (SOS)…

Numerical Analysis · Mathematics 2025-07-22 Didier Henrion , Milan Korda , Jean-Bernard Lasserre

We consider the Lommel functions $s_{\mu,\nu}(z)$ for different values of the parameters $(\mu,\nu)$. We show that if $(\mu,\nu)$ are half integers, then it is possible to describe these functions with an explicit combination of polynomials…

Classical Analysis and ODEs · Mathematics 2024-06-28 Federico Zullo

The functional equation f(p(z))=g(q(z)) is studied, where p,q are polynomials and f,g are trancendental meromorphic functions in C. We find all the pairs p,q for which there exist nonconstant f,g satisfying our equation and there exist no…

Dynamical Systems · Mathematics 2015-06-26 Sergei Lysenko

Let $\cal{P}$ be an affine invariant property of functions $\mathbb{F}_p^n \to [R]$ for fixed $p$ and $R$. We show that if $\cal{P}$ is locally testable with a constant number of queries, then one can estimate the distance of a function $f$…

Computational Complexity · Computer Science 2013-06-05 Hamed Hatami , Shachar Lovett

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Symbolic Computation · Computer Science 2025-05-01 Thi Xuan Vu