318 research outputs found
Presentations of Finitely Generated Cancellative Commutative Monoids and Nonnegative Solutions of Systems of Linear Equations
Varying methods exist for computing a presentation of a finitely generated commutative cancellative monoid. We use an algorithm of Contejean and Devie [An efficient incremental algorithm for solving systems of linear diophantine equations, Inform. and Comput. 113 (1994) 143–172] to show how these presentations can be obtained from the nonnegative integer solutions to a linear system of equations. We later introduce an alternate algorithm to show how such a presentation can be efficiently computed from an integer basis
Polar Varieties and Efficient Real Elimination
Let be a smooth and compact real variety given by a reduced regular
sequence of polynomials . This paper is devoted to the
algorithmic problem of finding {\em efficiently} a representative point for
each connected component of . For this purpose we exhibit explicit
polynomial equations that describe the generic polar varieties of . This
leads to a procedure which solves our algorithmic problem in time that is
polynomial in the (extrinsic) description length of the input equations and in a suitably introduced, intrinsic geometric parameter, called
the {\em degree} of the real interpretation of the given equation system .Comment: 32 page
An Algorithm for Computing Primitive Relations
Let X be a smooth complete toric variety of dimension n. It is described by its fan . To study X from the point
of view of Mori theory it is very convenient to present enumerating its primitive relations and collections (see [2], [3]). In
this paper we describe the algorithm that computes the primitive
relation associated to a primitive collection
Polar Varieties, Real Equation Solving and Data-Structures: The hypersurface case
In this paper we apply for the first time a new method for multivariate
equation solving which was developed in \cite{gh1}, \cite{gh2}, \cite{gh3} for
complex root determination to the {\em real} case. Our main result concerns the
problem of finding at least one representative point for each connected
component of a real compact and smooth hypersurface. The basic algorithm of
\cite{gh1}, \cite{gh2}, \cite{gh3} yields a new method for symbolically solving
zero-dimensional polynomial equation systems over the complex numbers. One
feature of central importance of this algorithm is the use of a
problem--adapted data type represented by the data structures arithmetic
network and straight-line program (arithmetic circuit). The algorithm finds the
complex solutions of any affine zero-dimensional equation system in non-uniform
sequential time that is {\em polynomial} in the length of the input (given in
straight--line program representation) and an adequately defined {\em geometric
degree of the equation system}. Replacing the notion of geometric degree of the
given polynomial equation system by a suitably defined {\em real (or complex)
degree} of certain polar varieties associated to the input equation of the real
hypersurface under consideration, we are able to find for each connected
component of the hypersurface a representative point (this point will be given
in a suitable encoding). The input equation is supposed to be given by a
straight-line program and the (sequential time) complexity of the algorithm is
polynomial in the input length and the degree of the polar varieties mentioned
above.Comment: Late
- …