Computing Chow Forms and Some Applications
β Scribed by Gabriela Jeronimo; Susana Puddu; Juan Sabia
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 136 KB
- Volume
- 41
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
β¦ Synopsis
We prove the existence of an algorithm that, from a finite set of polynomials defining an algebraic projective variety, computes the Chow form of its equidimensional component of the greatest dimension. Applying this algorithm, a finite set of polynomials defining the equidimensional component of the greatest dimension of an algebraic (projective or affine) variety can be computed. The complexities of the algorithms involved are lower than the complexities of the known algorithms solving the same tasks. This is due to a special way of coding output polynomials, called straight-line programs.
π SIMILAR VOLUMES
We describe a polynomial time algorithm to compute Jacobi symbols of exponentially large integers of special form, including so-called sparse integers which are exponentially large integers with only polynomially many nonzero binary digits. In a number of papers sequences of Jacobi symbols have been
## Kerkkfy, P. and T. Rem& On some applications of form management, Mathematics and Computers in Simulation 33 (1991) 295-302. In this paper we summarize and gene&z some concepts in form management. A form management system is used for illustration, and some usage examples are aIso presented.