Related papers: Local ABC theorems for analytic functions

As suggested by the title, it has recently become clear that theorems of Nonstandard Analysis (NSA) give rise to theorems in computability theory (no longer involving NSA). Now, the aforementioned discipline divides into classical and…

Assume that there is a set of monic polynomials $P_n(z)$ satisfying the second-order difference equation $$ A(s) P_n(z(s+1)) + B(s) P_n(z(s)) + C(s) P_n(z(s-1)) = \lambda_n P_n(z(s)), n=0,1,2,..., N$$ where $z(s), A(s), B(s), C(s)$ are some…

Approximate Bayesian computation (ABC) is a family of computational techniques in Bayesian statistics. These techniques allow to fi t a model to data without relying on the computation of the model likelihood. They instead require to…

We give a general version of Bryc's theorem valid on any topological space and with any algebra $\mathcal{A}$ of real-valued continuous functions separating the points, or any well-separating class. In absence of exponential tightness, and…

This paper gives an elementary proof of an improved version of the algebraic Local B\'ezout Theorem (given by the authors in JSC 45 (2010) 975--985). Here we remove some ad hoc hypotheses and obtain an optimal algebraic version of the…

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…

For a nonempty compact subset $\sigma$ in the plane, the space $AC(\sigma)$ is the closure of the space of complex polynomials in two real variables under a particular variation norm. In the classical setting, $AC[0,1]$ contains several…

This note formulates a conjecture generalizing both the abc conjecture of Masser-Oesterl\'e and the author's diophantine conjecture for algebraic points of bounded degree. It also shows that the new conjecture is implied by the earlier…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

A classical inequality, which is known for families of monotone functions, is generalized to a larger class of families of measurable functions. Moreover we characterize all the families of functions for which the equality holds. We apply…

A classical result due to Levinson characterizes the existence of non-zero functions defined on a circle vanishing on an open subset of the circle in terms of the pointwise decay of their Fourier coefficients [13]. We prove certain analogue…

The $T$-adic exponential sum of a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the $C$-function of the…

The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness,…

We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs.…

Let $ V_{n} = X_{1,n} + X_{2,n} + \cdots + X_{n,n}$ where $X_{i,n}$ are Bernoulli random variables which take the value $1$ with probability $b(i;n)$. Let $\lambda_{n} = \sum\limits_{i=1}^{n} b(i;n) $, $\lambda = \lim\limits_{n \to \infty}…

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…

An analogue of the Gauss-Lucas theorem for polynomials over the algebraic closure $\mathbb C_p$ of the field of $p$-adic numbers is considered.

In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…

This paper develops the theory of Macdonald-Koornwinder polynomials in parallel analogy with the work done for the $GL_n$ case in [CR22]. In the context of the type $CC_n$ affine root system the Macdonald polynomials of other root systems…