Related papers: Higher discriminants of polynomials
We present a new technique for constructing solutions of quasilinear systems of first-order partial differential equations, in particular inhomogeneous ones. A generalization of the Riemann invariants method to the case of inhomogeneous…
We introduce the degenerate Bernoulli numbers of the second kind as a degenerate version of the Bernoulli numbers of the second kind. We derive a family of nonlinear differential equations satisfied by a function closely related to the…
We consider the problem of inference in higher-order undirected graphical models with binary labels. We formulate this problem as a binary polynomial optimization problem and propose several linear programming relaxations for it. We compare…
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…
We solve a special type of linear systems with coefficients in multivariate polynomial rings. These systems arise in the computation of parametric Bernstein-Sato polynomials associated with certain hypergeometric ideals in the Weyl algebra.
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…
We consider Tuenter polynomials as linear combinations of descending factorials and show that coefficients of these linear combinations are expressed via a Catalan triangle of numbers. We also describe a triangle of coefficients in terms of…
The aim of this paper is to study the degenerate Bell numbers and polynomials which are degenerate version of the Bell numbers and polynomials. we derive some new identities and properties of those numbers and polynomials that are…
We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…
An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…
We show a method to construct isospectral deformations of classical orthogonal polynomials. The construction is based on confluent Darboux transformations, and it allows to construct Sturm-Liouville problems with polynomial eigenfunctions…
The goal of this paper is to provide computational tools able to find a solution of a system of polynomial inequalities. The set of inequalities is reformulated as a system of polynomial equations. Three different methods, two of which…
We give partial generalizations of the classical Descartes' rule of signs to multivariate polynomials (with real exponents), in the sense that we provide upper bounds on the number of connected components of the complement of a hypersurface…
This paper investigates the idea of designing data-driven partial estimators for nonlinear systems showing parametric uncertainties using sparse multivariate polynomial relationships. A general framework is first presented and then…
We present higher order polynomial algebras which are the dynamical symmetry algebras of a wide class of multi-mode boson systems in non-linear optics. We construct their unitary representations and the corresponding single-variable…
For the system of second order quasilinear parabolic equations the problem of reducing them to the equations of diffusion type is considered. In non-degenerate case an effective algorithm for solving this problem is suggested.
We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex)…
In this paper, we study the degenerate Eulerian polynomials and numbers and give some new and interesting identities associated with several special numbers and polynomials.