Related papers: B\'ezout Subresultants for Univariate Polynomials …

We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…

We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. More precisely, we consider the sequence $(S_b(n))_{n\ge 0}$ counting the number of positive entries on each row of a…

The coefficients occurring in summation formulae of the Lubbock type are shown to be generalised Bernoulli polynomials which turn up in subdivision questions such as quantum field theory around a conical singularity and on spherical lunes.…

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

We develop a new kind of nonnegativity certificate for univariate polynomials on an interval. In many applications, nonnegative Bernstein coefficients are often used as a simple way of certifying polynomial nonnegativity. Our proposed…

In the paper it is considered the generalized Faber polynomials defined inside and outside a regular curve on the complex plane. The weighted Smirnov spaces corresponding to bounded and unbounded regions are defined. It is proved that the…

We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…

Improvements in technology lead to increasing availability of large data sets which makes the need for data reduction and informative subsamples ever more important. In this paper we construct $ D $-optimal subsampling designs for…

Generalized sampling consists in the recovery of a function $f$, from the samples of the responses of a collection of linear shift-invariant systems to the input $f$. The reconstructed function is typically a member of a finitely generated…

Let $(a_n), (b_n)$ be linear recursive sequences of integers with characteristic polynomials $A(X),B(X)\in \mathbb{Z}[X]$ respectively. Assume that $A(X)$ has a dominating and simple real root $\alpha$, while $B(X)$ has a pair of conjugate…

Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…

We present a formula for a generalisation of the Eulerian polynomial, namely the generating polynomial of the joint distribution of major index and descent statistic over the set of signed multiset permutations. It has a description in…

We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…

We present a novel, global algorithm for solving polynomial multiparameter eigenvalue problems (PMEPs) by leveraging a hidden variable tensor Dixon resultant framework. Our method transforms a PMEP into one or more univariate polynomial…

In this paper we study scalar multivariate subdivision schemes with general integer expanding dilation matrix. Our main result yields simple algebraic conditions on the symbols of such schemes that characterize their polynomial…

It is proposed the algorithm that find a basis of the ideal and a basis of the space of all root functionals by using the extension operation for bounded root functionals, when the number of polynomials is equal to the number of variables,…

We introduce a non-commutative resultant, for slice regular polynomials in two quaternionic variables, defined in terms of a suitable Dieudonn\'e determinant.We use this tool to investigate the existence of common zeros of slice regular…

Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its…

The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…

The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…