Related papers: Bilinear systems with two supports: Koszul resulta…

This article is concerned with graded modules M with linear resolutions over a standard graded algebra R. It is proved that if such an M has Hilbert series $H_M(s)$ of the form $ps^d+qs^{d+1}$, then the algebra R is Koszul; if, in addition,…

We provide a complete description of the ideal that serves as the resultant ideal for n univariate polynomials of degree d. We in particular describe a set of generators of this resultant ideal arising as maximal minors of a set of…

Modular composition is the problem of computing the composition of two univariate polynomials modulo a third one. For a long time, the fastest algebraic algorithm for this problem was that of Brent and Kung (1978). Recently, we improved…

We construct biorthogonal polynomials for a measure over the complex plane which consists in the exponential of a potential V(z,z*) and in a set of external sources at the numerator and at the denominator. We use the pseudonorm of these…

Polynomial quantified entailments with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyQEnt which is a tool for solving polynomial quantified entailments in…

Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the…

This work builds on Varchenko et al's introduction of bilinear forms for hyperplane arrangements, where the determinant of the associated matrices factorizes into simple components. While one of the determinant formula developed by…

This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…

In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…

Let $\mathbb{K}$ be a field and let $f,g \in \mathbb{K}[x,y]$ be such that the ideal $\langle f,g \rangle$ is zero-dimensional. We study the Sylvester and B\'{e}zout resultant polynomial matrices, built by interpreting $f$ and $g$ as…

Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…

A well-known theorem by Milnor-Orlik provides a formula for the Milnor number of a weighted-homogeneous polynomial having an isolated singularity that depends only on the weights. In this paper we present a proof of that result using…

We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…

We study matrix elements of a change of base between two different bases of representations of the quantum algebra $U_q(su(1,1))$. The two bases, which are multivariate versions of Al-Salam--Chihara polynomials, are eigenfunctions of…

We study the commutative algebra of three bihomogeneous polynomials p_0,p_1,p_2 of degree (2,1) in variables x,y;z,w, assuming that they never vanish simultaneously on P^1 x P^1. Unlike the situation for P^2, the Koszul complex of the p_i…

Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…

The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of $n$ linear…

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

We consider systems of polynomial equations and inequalities in $\mathbb{Q}[\boldsymbol{y}][\boldsymbol{x}]$ where $\boldsymbol{x} = (x_1, \ldots, x_n)$ and $\boldsymbol{y} = (y_1, \ldots,y_t)$. The $\boldsymbol{y}$ indeterminates are…

By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (multivariate) setting. We introduce the concept of Horner…