相关论文: Bounding the zeros of polynomials using the Froben…

In this paper we relate the location of the complex zeros of the reliability polynomial to parameters at which a certain family of rational functions derived from the reliability polynomial exhibits chaotic behaviour. We use this connection…

We give a survey concerning both very classical and recent results on the electrostatic interpretation of the zeros of some well-known families of polynomials, and the interplay between these models and the asymptotic distribution of their…

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to…

The efficacy of numerical methods like integral estimates via Gaussian quadrature formulas depends on the localization of the zeros of the associated family of orthogonal polynomials. In this regard, following the renewed interest in…

In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the…

We introduce the notion of tropical defects, certificates that a system of polynomial equations is not a tropical basis, and provide two algorithms for finding them in affine spaces of complementary dimension to the zero set. We use these…

In this paper, we give some sufficient conditions for a $n$-dimensional rectangle to be tiled with a set of bricks. These conditions are obtained by using the so-called Frobenius number.

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…

The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…

This paper provides geometrical descriptions of the Frobenius monad freely generated by a single object. These descriptions are related to results connecting Frobenius algebras and topological quantum field theories. In these descriptions,…

This paper proves the existence of potentials of the first and second kind of a Frobenius like structure in a frame which encompasses families of arrangements. The frame uses the notion of matroids. For the proof of the existence of the…

In this note we investigate, as a natural continuation of [K. Castillo, Constr. Approx., 55 (2022) 605-627], the behaviour of the zeros of discrete paraorthogonal polynomials on the unit circle with respect to a real parameter.

We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…

The purpose of the present paper is to examine the zeros of $R$-Bonacci polynomials and their derivatives. We confirm a conjecture about the zeros of $R$-Bonacci polynomials for some special cases. We also find explicit formulas of the…

The techniques for polynomial interpolation and Gaussian quadrature are generalized to matrix-valued functions. It is shown how the zeros and rootvectors of matrix orthonormal polynomials can be used to get a quadrature formula with the…

We demonstrate a new kind of companion matrix, for polynomials of the form $c(\lambda) = \lambda a(\lambda)b(\lambda) + c_0$ where upper Hessenberg companions are known for the polynomials $a(\lambda)$ and $b(\lambda)$. This construction…

We present a new algorithm for isolating the real roots of a system of multivariate polynomials, given in the monomial basis. It is inspired by existing subdivision methods in the Bernstein basis; it can be seen as generalization of the…

We approximate the d complex zeros of a univariate polynomial p(x) of a degree d or those zeros that lie in a fixed region of interest on the complex plane such as a disc or a square. Our divide and conquer algorithm of STOC 1995 supports…

Mhaskar-Saff found a kind of universal behavior for the bulk structure of the zeros of orthogonal polynomials for large $n$. Motivated by two plots, we look at the finer structure for the case of random Verblunsky coefficients and for what…