Subresultants in multiple roots: an extremal case

We provide explicit formulae for the coefficients of the order-d polynomial subresultant of (x-\alpha)^m and (x-\beta)^n with respect to the set of Bernstein polynomials \{(x-\alpha)^j(x-\beta)^{d-j}, \, 0\le j\le d\}. They are given by hypergeometric expressions arising from determinants of binomial Hankel matrices.Comment: 18 pages, uses elsart. Revised version accepted for publication at Linear Algebra and its Application

On the irreducibility of multivariate subresultants

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants associated to the family $P_1,...,P_n$ in degree $\nu$ are irreducible. We show that the lower bound is sharp. As a byproduct, we get a formula for computing the residual resultant of $\binom{\rho-\nu +n-1}{n-1}$ smooth isolated points in \PP^{n-1}.Comment: Updated version, 4 pages, to appear in CRA

Subresultants in Multiple Roots

We extend our previous work on Poisson-like formulas for subresultants in roots to the case of polynomials with multiple roots in both the univariate and multivariate case, and also explore some closed formulas in roots for univariate polynomials in this multiple roots setting.Comment: 21 pages, latex file. Revised version accepted for publication in Linear Algebra and its Application

Sylvester's Double Sums: the general case

In 1853 Sylvester introduced a family of double sum expressions for two finite sets of indeterminates and showed that some members of the family are essentially the polynomial subresultants of the monic polynomials associated with these sets. A question naturally arises: What are the other members of the family? This paper provides a complete answer to this question. The technique that we developed to answer the question turns out to be general enough to charactise all members of the family, providing a uniform method.Comment: 16 pages, uses academic.cls and yjsco.sty. Revised version accepted for publication in the special issue of the Journal of Symbolic Computation on the occasion of the MEGA 2007 Conferenc

Improved algorithm for computing separating linear forms for bivariate systems

We address the problem of computing a linear separating form of a system of two bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at the distinct solutions of the system. The computation of such linear forms is at the core of most algorithms that solve algebraic systems by computing rational parameterizations of the solutions and this is the bottleneck of these algorithms in terms of worst-case bit complexity. We present for this problem a new algorithm of worst-case bit complexity \sOB(d^7+d^6\tau) where $d$ and $\tau$ denote respectively the maximum degree and bitsize of the input (and where \sO refers to the complexity where polylogarithmic factors are omitted and $O_B$ refers to the bit complexity). This algorithm simplifies and decreases by a factor $d$ the worst-case bit complexity presented for this problem by Bouzidi et al. \cite{bouzidiJSC2014a}. This algorithm also yields, for this problem, a probabilistic Las-Vegas algorithm of expected bit complexity \sOB(d^5+d^4\tau).Comment: ISSAC - 39th International Symposium on Symbolic and Algebraic Computation (2014

Polynomial Interrupt Timed Automata

Interrupt Timed Automata (ITA) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. Here we extend ITA with polynomial guards and updates, leading to the class of polynomial ITA (PolITA). We prove the decidability of the reachability and model checking of a timed version of CTL by an adaptation of the cylindrical decomposition method for the first-order theory of reals. Compared to previous approaches, our procedure handles parameters and clocks in a unified way. Moreover, we show that PolITA are incomparable with stopwatch automata. Finally additional features are introduced while preserving decidability

New and Old Results in Resultant Theory

Resultants are getting increasingly important in modern theoretical physics: they appear whenever one deals with non-linear (polynomial) equations, with non-quadratic forms or with non-Gaussian integrals. Being a subject of more than three-hundred-year research, resultants are of course rather well studied: a lot of explicit formulas, beautiful properties and intriguing relationships are known in this field. We present a brief overview of these results, including both recent and already classical. Emphasis is made on explicit formulas for resultants, which could be practically useful in a future physics research.Comment: 50 pages, 15 figure