Computing the Canonical Representation of Constructible Sets

详细信息    查看全文

• 作者：Josep M. Brunat ; Antonio Montes
• 关键词：Constructible sets ; Locally closed sets ; Canonical representation ; Parametric polynomial system ; Gröbner Cover ; Comprehensive Gröbner system
• 刊名：Mathematics in Computer Science
• 出版年：2016
• 出版时间：March 2016
• 年：2016
• 卷：10
• 期：1
• 页码：165-178
• 全文大小：487 KB
• 参考文献：1.Abanades M., Botana F., Montes A., Recio T.: An Algebraic taxonomy for locus computation in dynamic geometry. Comput. Aided Geom. D. 56, 22–33 (2014)CrossRef MATH
  2.Adhikari M.R., Adhikari A.: Basic modern algebra with applications. Springer, New Delhi (2014)CrossRef MATH
  3.Allouche, J.P.: Note on the constructible sets of a topological space. In: Papers on general topology and applications (Gorham, ME, 1995). Ann. New York Acad. Sci., vol. 806, pp. 1–10 (1996)
  4.Chen, C., Lemaire, F., Li, L., Maza, M.M., Pan, W., Xie, Y.: The Constructiblesettools and parametricsystemtools modules of the regularchains library in maple. In: Proceedings of ICCSA’2008, pp. 342–352. IEEE Computer Society (2008)
  5.Cox D., Little J., O’Shea D.: Ideals, varieties and algorithms, vol. 2007, 3rd edn. Springer, New-York (1992)CrossRef MATH
  6.de la Llave, R., Petzold, L., Lorenz, J.: Mathematical robotics: problem 4, two-arm robot. In: Dynamics of algorithms, vol. 118, pp. 1–29. Springer-Verlag (2000)
  7.Decker, W., Greuel, G.-M., Pfister, G., Schönemann, H.: Singular 4-0-2. A computer algebra system for polynomial computations. http://​www.​singular.​uni-kl.​de
  8.Gianni P., Trager B., Zacharias G.: Gröbner bases and primary decomposition of polynomial ideals. J. Symbolic Comput. 6, 149–167 (1988)MathSciNet CrossRef MATH
  9.Gonzalez, M.J., Recio, T.: The ROMIN inverse geometric model and the dynamic evaluation method. In: Computer algebra in industry, pp. 117–141. Wiley (1993)
  10.O’Halloran J., Schilmoeller M.: Gröbner bases for constructible sets. Commun. Algebra 30(11), 5479–5483 (2002)MathSciNet CrossRef MATH
  11.Kapur, D., Sun, Y., Wang, D.: A new algorithm for computing comprehensive Gröbner systems. In: Proceedings of ISSAC’2010, pp. 29–36. ACM Press, New York (2010)
  12.Kemper, G.: Morphisms and constructible sets: making two theorems of Chevalley constructive. Preprint Technische Universität München (2007)
  13.Leykin A.: Constructibility of the set of polynomials with a fixed bernstein-sato polynomial: an algorithmic approach. J. Symbolic Comput. 32(6), 663–675 (2001)MathSciNet CrossRef MATH
  14.Montes, A.: Personal web page. http://​www-ma2.​upc.​edu/​~montes
  15.Montes A., Recio T.: Generalizing the Steiner-Lehmus theorem using the Gröbner cover. Math. Comput. Simul. 104, 67–81 (2014)MathSciNet CrossRef
  16.Montes A., Wibmer M.: Gröbner bases for polynomial systems with parameters. J. Symbolic Comput. 45, 1391–1425 (2010)MathSciNet CrossRef MATH
  17.Wibmer M.: Gröbner bases for families of affine or projective schemes. J. Symbolic Comput. 42, 803–834 (2007)MathSciNet CrossRef MATH
  
• 作者单位：Josep M. Brunat (1)
  Antonio Montes (1)
  
  1. Universitat Politècnica de Catalunya, Barcelona, Spain
  
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Mathematics
  Computer Science, general
  
• 出版者：Springer Basel
• ISSN：1661-8289

文摘

Constructible sets are needed in many algorithms of Computer Algebra, particularly in the Gröbner Cover and other algorithms for parametric polynomial systems. In this paper we review the canonical form of constructible sets and give algorithms for computing it.