JSC
2007
13 years 5 months ago
2007
Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms i...
JSC
2007
13 years 5 months ago
2007
Buchberger’s Gr¨obner basis theory plays a fundamental role in symbolic computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his PhD ...
JSC
2007
13 years 5 months ago
2007
We present an algorithm which, given a deformation with section of a reduced plane curve singularity, computes equations for the equisingularity stratum (that is, the µ-constant s...
JSC
2007
13 years 5 months ago
2007
JSC
2007
13 years 5 months ago
2007
We present a method based on extended linear real quantifier elimination for multiple object semilinear motion planning, i.e. finding collision-free trajectories for several rob...
JSC
2007
13 years 5 months ago
2007
JSC
2007
13 years 5 months ago
2007
We study the A-discriminant of toric varieties. We reduce its computation to the case of irreducible configurations and describe its behavior under specialization of some of the ...
JSC
2007
13 years 5 months ago
2007
JSC
2007
13 years 5 months ago
2007
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
JSC
2007
13 years 5 months ago
2007
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester’s formula was also r...