English
Related papers

Related papers: Approximate polymorphisms of predicates

200 papers

Let $\mathcal{P}$ be a property of function $\mathbb{F}_p^n \to \{0,1\}$ for a fixed prime $p$. An algorithm is called a tester for $\mathcal{P}$ if, given a query access to the input function $f$, with high probability, it accepts when $f$…

Computational Complexity · Computer Science 2014-02-11 Yuichi Yoshida

We establish new recurrence and multiple recurrence results for a rather large family $\mathcal{F}$ of non-polynomial functions which includes tempered functions defined in [11], as well as functions from a Hardy field with the property…

Dynamical Systems · Mathematics 2020-04-16 Vitaly Bergelson , Joel Moreira , Florian K. Richter

Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…

Optimization and Control · Mathematics 2016-12-08 Taoran Fu , Bo Jiang , Zhening Li

A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…

Combinatorics · Mathematics 2025-05-06 Carmelo Cisto , Gioia Failla , Francesco Navarra

We define new generalized factorials in several variables over an arbitrary subset $\underline{S} \subseteq R^n,$ where $R$ is a Dedekind domain and $n$ is a positive integer. We then study the properties of the fixed divisor…

Rings and Algebras · Mathematics 2018-12-24 Devendra Prasad , Krishnan Rajkumar , A. Satyanarayana Reddy

The universal approximation theorem, in one of its most general versions, says that if we consider only continuous activation functions $\sigma$, then a standard feedforward neural network with one hidden layer is able to approximate any…

Machine Learning · Computer Science 2020-02-18 Kai Fong Ernest Chong

In a previous paper of the authors, we showed that for any polynomials $P_1,\dots,P_k \in \Z[\mathbf{m}]$ with $P_1(0)=\dots=P_k(0)$ and any subset $A$ of the primes in $[N] = \{1,\dots,N\}$ of relative density at least $\delta>0$, one can…

Number Theory · Mathematics 2014-10-13 Terence Tao , Tamar Ziegler

It is known from the Runge approximation theorem that every function which is holomorphic in a neighborhood of a compact polynomially convex set $K\subset \complexes^{n}$ can be approximated uniformly on $K$ by analytic polynomials. We…

Complex Variables · Mathematics 2007-05-23 Youssef Alaoui , My Abdelhakim El Idrissi Saad

Let $S$ be a dense subring of the real numbers. In this paper we prove a polynomial version of Van der Waerden's theorem near zero. In fact, we prove that if $p_1,\ldots,p_m \in \mathbb{Z}[x]$ are polynomials such that $p_i(0) = 0$ and…

Combinatorics · Mathematics 2025-08-13 Ghadir Ghadimi , Mohammad Akbari Tootkaboni

Generalizations of some known results on the best, best linear and best one-sided approxima- tions by trigonometric polynomials of the classes of 2\pi - periodic functions presented in the form of convolutions to the case of set-valued…

Functional Analysis · Mathematics 2015-04-29 V. F. Babenko , V. V. Babenko , M. V. Polischuk

We show that for multivariate Freud-type weights $W_\alpha(x)=\exp(-|x|^\alpha)$, $\alpha>1$, any convex function $f$ on $R^d$ satisfying $fW_\alpha\in L_p(R^d)$ if $1\le p<\infty$, or $\lim_{|x|\to\infty}f(x)W_\alpha(x)=0$ if $p=\infty$,…

Classical Analysis and ODEs · Mathematics 2014-11-14 Oleksandr Maizlish , Andriy Prymak

Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.

Numerical Analysis · Mathematics 2025-10-20 H. Hakopian , M. Tonoyan

We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…

Number Theory · Mathematics 2019-02-20 Oleksiy Klurman

Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…

Information Theory · Computer Science 2022-12-12 Yue Yu , Pavel Loskot

The paper explores connection between the generalized order and the generalized type of an entire function and the speed of the best polynomial approximation in the unit disk. The relations which define the generalized order and the…

Classical Analysis and ODEs · Mathematics 2014-05-20 Mykhaylo Z. Dveyrin , Antonina S. Levadnaya

Several questions of approximation theory are discussed: 1) can one approximate stably in $L^\infty$ norm $f^\prime$ given approximation $f_\delta, \parallel f_\delta - f \parallel_{L^\infty} < \delta$, of an unknown smooth function $f(x)$,…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. G. Ramm

In metrics of spaces $L_{s}, \ 1\leq s\leq\infty$, we find asymptotic equalities for upper bounds of approximations by Fourier sums on classes of generalized Poisson integrals of periodic functions, which belong to unit ball of space…

Classical Analysis and ODEs · Mathematics 2016-12-12 A. S. Serdyuk , T. A. Stepanyuk

We investigate the almost everywhere convergence of sequences of convolution operators given by probability measures $\mu_n$ on $\mathbb R$. If this sequence of operators constitutes an approximate identity on a particular class of…

Dynamical Systems · Mathematics 2024-07-15 Andrew Parrish , Joseph Rosenblatt

In this paper, approximation by means of algebraic polynomials of classes of functions defined by a generalised modulus of smoothness of operators of differentiation of these functions is considered. We give structural characteristics of…

Functional Analysis · Mathematics 2012-08-28 Nimete Sh. Berisha , Faton M. Berisha

Let $E$ be an arbitrary subset of the unit circle $T$ and let $f$ be a function defined on $E$. When there exist polynomials $P_n$ which are uniformly bounded by a number $M > 0$ on $T$ and converge (pointwise) to $f$ at each point of $E$?…

Complex Variables · Mathematics 2015-01-05 Arthur A. Danielyan
‹ Prev 1 4 5 6 7 8 10 Next ›