Related papers: Multidimensional Pad\'e approximation of binomial …
Let (R;m) be a numerical semigroup ring. In this paper we study the properties of its associated graded ring G(m). In particular, we describe the H^0_M for G(m) (where M is the homogeneous maximal ideal of G(m)) and we characterize when…
In this paper, we estimate the simultaneous approximation exponents of the values of certain Mahler functions. For this we construct Hermite-Pad\'{e} approximations of the functions under consideration, then apply the functional equations…
We consider multiple orthogonal polynomials corresponding to two Macdonald functions (modified Bessel functions of the second kind), with emphasis on the polynomials on the diagonal of the Hermite-Pad\'e table. We give some properties of…
We study the best uniform approximation by polynomials of fixed degree of the function sgn(x) on the union of two intervals symmetric with respect to the origin. We obtain precise asymptotics, with explicit constants, for the error of the…
We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…
Using polynomial interpolation, along with structural properties of the family of positive real rational functions, we here show that a set of m nodes in the open left half of the complex plane, can always be mapped to anywhere in the…
Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…
Pickands dependence functions characterize bivariate extreme value copulas. In this paper, we study the class of polynomial Pickands functions. We provide a solution for the characterization of such polynomials of degree at most $m+2$,…
For $G$ an open set in $\mathbb{C}$ and $W$ a non-vanishing holomorphic function in $G$, in the late 1990's, Pritsker and Varga characterized pairs $(G,W)$ having the property that any $f$ holomorphic in $G$ can be locally uniformly…
In the Maximum Independent Set problem we are asked to find a set of pairwise nonadjacent vertices in a given graph with the maximum possible cardinality. In general graphs, this classical problem is known to be NP-hard and hard to…
It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…
Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…
An independent set in a graph is a set of pairwise non-adjacent vertices. The independence number $\alpha{(G)}$ is the size of a maximum independent set in the graph $G$. The independence polynomial of a graph is the generating function for…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial…
In this paper, we will discuss the notion of almost orthogonality in a functional sequence.Especially, we will define a few sequences of almost orthogonal polynomials which can be used successfully for modeling of electronic systems which…
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…
An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while mu(G) is the cardinality of a maximum matching.…
By the use of homotopy perturbation method-Pad\'e (HPM-Pad\'e) technique, a new analytical approximation of luminosity distance in the flat universe is proposed, which has the advantage of significant improvement for accuracy in…