Related papers: Approximate polymorphisms of predicates

Some properties of generalized convexity for sets and for functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is…

Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degree of uniformity $k$ such that assuming…

Let $ f_0 $ and $ f_\infty $ be formal power series at the origin and infinity, and $ P_n/Q_n $, with $ \mathrm{deg}(P_n),\mathrm{deg}(Q_n)\leq n $, be a rational function that simultaneously interpolates $ f_0 $ at the origin with order $…

Given a vector function ${\bf F}=(F_1,\ldots,F_d),$ analytic on a neighborhood of some compact subset $E$ of the complex plane with simply connected complement, we define a sequence of vector rational functions with common denominator in…

Let $F(x)=(f_1(x), \dots, f_m(x))$ be such that $1, f_1, \dots, f_m$ are linearly independent polynomials with real coefficients. Based on ideas of Bachoc, DeCorte, Oliveira and Vallentin in combination with estimating certain oscillatory…

Let $P$ be an $m$-homogeneous polynomial in $n$-complex variables $x_1, \dotsc, x_n$. Clearly, $P$ has a unique representation in the form \begin{equation*} P(x)= \sum_{1 \leq j_1 \leq \dotsc \leq j_m \leq n} c_{(j_1, \dotsc, j_m)} \,…

With a new proof approach we prove in a more general setting the classical convergence theorem that almost everywhere convergence of measurable functions on a finite measure space implies convergence in measure. Specifically, we generalize…

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be any linearly independent polynomials with zero constant term. We show that there exists a $\gamma>0$ such that any subset of $\mathbb{F}_q$ of size at least $q^{1-\gamma}$ contains a nontrivial…

Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…

We generalize the universal power series of Seleznev to several variables and we allow the coefficients to depend on parameters. Then, the approximable functions may depend on the same parameters. The universal approximation holds on…

Let $\mu$ be a positive measure on the real line with locally finite support $\Lambda$ and integer masses such that its Fourier transform in the sense of distributions is a purely point measure. An explicit form is found for an entire…

It is well known [Lov\'asz, 67] that up to isomorphism a graph~$G$ is determined by the homomorphism counts $\hom(F, G)$, i.e., the number of homomorphisms from $F$ to $G$, where $F$ ranges over all graphs. Thus, in principle, we can answer…

Given $k\in N$, a nonnegative function $f\in C^r[a,b]$, $r\ge 0$, an arbitrary finite collection of points $\big\{\alpha_i\big\}_{i\in J} \subset [a,b]$, and a corresponding collection of nonnegative integers $\big\{m_i\big\}_{i\in J}$ with…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…

Let us assume that $f$ is a continuous function defined on the unit ball of $\mathbb R^d$, of the form $f(x) = g (A x)$, where $A$ is a $k \times d$ matrix and $g$ is a function of $k$ variables for $k \ll d$. We are given a budget $m \in…

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$…

Let $[a,b]\subset\mathbb{R}$ be a non empty and non singleton closed interval and $P=\{a=x_0<\cdots<x_n=b\}$ is a partition of it. Then $f:I\to\mathbb{R}$ is said to be a function of $r$-bounded variation, if the expression…

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…

In this paper we consider a special class of polymorphisms with invariant measure, - (cf.[1])- the algebraic polymorphisms of compact groups. A general polymorphism is -- by definition -- a many-valued map with invariant measure, and the…