Related papers: Multidimensional Pad\'e approximation of binomial …

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…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

For an arbitrary tuple of $m+1$ germs of analytic functions at a fixed point, we introduce the so-called polynomial Hermite-Pad\'e $m$-system (of order $n$, $n\in\mathbb N$), which consists of $m$ tuples of polynomials; these tuples, which…

We consider linear combinations of eigenfunctions of the Laplace-Beltrami operator on a compact Riemannian manifold $(M,g)$ and investigate a density property of their zero sets. More precisely, let $f=\sum_{k=1}^m a_k…

To generalize the concept of Pad\'e approximation for functions to more than one variable, several definitions have been introduced. All definitions have advantages and disadvantages. The advantages of these approaches has been discussed in…

In this paper we show that that greedy bases can be defined as those where the error term using $m$-greedy approximant is uniformly bounded by the best $m$-term approximation with respect to polynomials with constant coefficients in the…

In this paper are discussed the results of new numerical experiments on zero distribution of type I Hermite-Pad\'e polynomials of order $n=200$ for three different collections of three functions $[1,f_1,f_2]$. These results are obtained by…

Let $ \mathbb{Q}\mathcal{E}_{\mathbb{Z}} $ be the set of power sums whose characteristic roots belong to $ \mathbb{Z} $ and whose coefficients belong to $ \mathbb{Q} $, i.e. $ G : \mathbb{N} \rightarrow \mathbb{Q} $ satisfies…

Starting from the orthogonal polynomial expansion of a function $F$ corresponding to a finite positive Borel measure with infinite compact support, we study the asymptotic behavior of certain associated rational functions…

Say that a graph G has property $\mathcal{K}$ if the size of its maximum matching is equal to the order of a minimal vertex cover. We study the following process. Set $N:= \binom{n}{2}$ and let $e_1, e_2, \dots e_{N}$ be a uniformly random…

Lasserre [La] proved that for every compact set $K\subset\mathbb R^n$ and every even number $d$ there exists a unique homogeneous polynomial $g_0$ of degree $d$ with $K\subset G_1(g_0)=\{x\in\mathbb R^n:g_0(x)\leq 1\}$ minimizing $|G_1(g)|$…

Under the assumption of the existence of Stahl's $S$-compact set we give a short proof of the limit zeros distribution of Pad\'e polynomials and convergence in capacity of diagonal Pad\'e approximants for a generic class of algebraic…

In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…

Let $G$ be a graph and let $m_{ij}(G)$, $i,j\ge 1$, be the number of edges $uv$ of $G$ such that $\{d_v(G), d_u(G)\} = \{i,j\}$. The {\em $M$-polynomial} of $G$ is introduced with $\displaystyle{M(G;x,y) = \sum_{i\le j} m_{ij}(G)x^iy^j}$.…

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…

We define notions of higher order spectra of a complex quasi-projective manifold with an action of a finite group $G$ and with a $G$-equivariant automorphism of finite order, some of their refinements and give Macdonald type equations for…

For a graph $G$, let $Z(G,\lambda)$ be the partition function of the monomer-dimer system defined by $\sum_k m_k(G)\lambda^k$, where $m_k(G)$ is the number of matchings of size $k$ in $G$. We consider graphs of bounded degree and develop a…

In this paper, we obtain a Schwartz-Zippel type estimate for homogenous finite field polynomials. Specifically, we use a probabilistic recursion technique to find upper and lower bounds for the number of zeros of a homogenous polynomial and…

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and S{\l}omczy{\'n}ska introduced the completeness concept of being \emph{polynomially rich}: a finite algebra is…