Related papers: A Bivariate Polynomial Problem for Matrices
We study paving matroids, their realization spaces, and their closures, along with matroid varieties and circuit varieties. Within this context, we introduce three distinct methods for generating polynomials within the associated ideals of…
This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…
The aim of the paper is twofold. Firstly, by using the constant rank level set theorem from differential geometry, we establish sharp upper bounds for the dimensions of the solution sets of polynomial variational inequalities under mild…
Complexity bounds for many problems on matrices with univariate polynomial entries have been improved in the last few years. Still, for most related algorithms, efficient implementations are not available, which leaves open the question of…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
Recently the authors presented a matrix representation approach to real Appell polynomials essentially determined by a nilpotent matrix with natural number entries. It allows to consider a set of real Appell polynomials as solution of a…
A classical result due to Bochner classifies the orthogonal polynomials on the real line which are common eigenfunctions of a second order linear differential operator. We settle a natural version of the Bochner problem on the unit circle…
Some properties and relations satisfied by the polynomial solutions of a bispectral problem are studied. Given a finite order differential operator, under certain restrictions, its polynomial eigenfunctions are explicitly obtained, as well…
The "bisimulation problem" for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the bisimulation problem for deterministic rational (vectors of) boolean series on the alphabet of a dpda M. We then…
The Matrix Bochner Problem aims to classify which weight matrices have their sequence of orthogonal polynomials as eigenfunctions of a second-order differential operator. Casper and Yakimov, in [4], demonstrated that, under certain…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…
We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…
In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…
Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
The Maximum Balanced Biclique Problem (MBBP) is a prominent model with numerous applications. Yet, the problem is NP-hard and thus computationally challenging. We propose novel ideas for designing effective exact algorithms for MBBP.…
In a multidimensional infinite layer bounded by two hyperplanes, the Poisson equation with the polynomial right-hand side is considered. It is shown that the Dirichlet boundary value problem and the mixed Dirichlet-Neumann boundary value…
In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…