Related papers: Solving parametric systems of polynomial equations…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…

We consider fourth order singularly perturbed eigenvalue problems in one-dimension and the approximation of their solution by the $h$ version of the Finite Element Method (FEM). In particular, we use piecewise Hermite polynomials of degree…

Let $J\subset S=K[x_0,...,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of the homogeneous polynomial ideals $I$, such that the monomials outside $J$ form a $K$-vector basis of $S/I$, is called a {\em $J$-marked…

The problem of characterizing a real polynomial $f$ as a sum of squares of polynomials on a real algebraic variety $V$ dates back to the pioneering work of Hilbert in [Mathematische Annalen 32.3 (1888): 342-350]. In this paper, we…

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

Present day electromagnetic field calculations have limitations that are due to techniques employing edge-based discretization methods. While these vector finite element methods solve the issues of tangential continuity of fields and the…

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…

In this article, we solve the connection problem of the Hermite polynomials with the classical continuous orthogonal polynomials belonging to Askey scheme, using the hypergeometric functions method combined is with the work the Fields and…

It appears that, along with many of my friends and colleagues, I had been brainwashed by the great and tragic lives of Abel and Galois to believe that no general formulas are possible for roots of equations higher than quartic. This seemed…

We present a complete algorithm that computes all hypergeometric solutions of homogeneous linear difference equations and rational solutions of parameterized linear difference equations in the setting of $\Pi\Sigma^*$-fields. More…

We present new methods for solving the Satisfiability Modulo Theories problem over the theory of Quantifier-Free Non-linear Integer Arithmetic, SMT(QF-NIA), which consists in deciding the satisfiability of ground formulas with integer…

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

Many eigenvalue problems arising in practice are often of the generalized form $A\x=\lambda B\x$. One particularly important case is symmetric, namely $A, B$ are Hermitian and $B$ is positive definite. The standard algorithm for solving…

We present recent computer algebra methods that support the calculations of (multivariate) series solutions for (certain coupled systems of partial) linear differential equations. The summand of the series solutions may be built by…

A new algorithm to approximate Hermitian matrices by positive semidefinite Hermitian matrices based on modified Cholesky decompositions is presented. In contrast to existing algorithms, this algorithm allows to specify bounds on the…

We prove that we can always construct strongly minimal linearizations of an arbitrary rational matrix from its Laurent expansion around the point at infinity, which happens to be the case for polynomial matrices expressed in the monomial…

An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the…

We define the generalized basic hypergeometric polynomial of degree $N \geq 1$ in terms of the generalized basic hypergeometric function, which depends on (arbitrary, generic, possibly complex) parameters $q \neq 1$, the $r \geq 0$…

In pure integer linear programming it is often desirable to work with polyhedra that are full-dimensional, and it is well known that it is possible to reduce any polyhedron to a full-dimensional one in polynomial time. More precisely, using…