Skip to main content

Regular Chains under Linear Changes of Coordinates and Applications

  • Conference paper
  • First Online:
Computer Algebra in Scientific Computing (CASC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9301))

Included in the following conference series:

Abstract

Given a regular chain, we are interested in questions like computing the limit points of its quasi-component, or equivalently, computing the variety of its saturated ideal. We propose techniques relying on linear changes of coordinates and we consider strategies where these changes can be either generic or guided by the input.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alvandi, P., Chen, C., Maza, M.M.: Computing the limit points of the quasi-component of a regular chain in dimension one. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2013. LNCS, vol. 8136, pp. 30–45. Springer, Heidelberg (2013)

    Google Scholar 

  2. Aubry, P., Lazard, D., Maza, M.M.: On the theories of triangular Sets. J. Symb. Comput. 28(1–2), 105–124 (1999)

    Google Scholar 

  3. Boulier, F., Lemaire, F., Moreno Maza, M.: Pardi! In: Proceedings of International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, pp. 38–47 (2001)

    Google Scholar 

  4. Boulier, F., Lemaire, F., Maza, M.M.: Computing differential characteristic sets by change of ordering. J. Symb. Comput. 45(1), 124–149 (2010)

    Google Scholar 

  5. Chen, C., Golubitsky, O., Lemaire, F., Maza, M.M., Pan, W.: Comprehensive triangular decomposition. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2007. LNCS, vol. 4770, pp. 73–101. Springer, Heidelberg (2007)

    Google Scholar 

  6. Chen, C., Maza, M.M.: Algorithms for computing triangular decomposition of polynomial systems. J. Symb. Comput. 47(6), 610–642 (2012)

    Google Scholar 

  7. Dahan, X., Jin, X., Maza, M.M., Schost, É.: Change of order for regular chains in positive dimension. Theor. Comput. Sci. 392(1–3), 37–65 (2008)

    Google Scholar 

  8. Eisenbud, D.: Commutative Algebra with a View toward Algebraic Geometry. Springer, New York (1995)

    Google Scholar 

  9. Greuel, G.M., Pfister, G.: A Singular Introduction to Commutative Algebra. Springer, Berlin (2002)

    Google Scholar 

  10. Hashemi, A.: Effective computation of radical of ideals and its application to invariant theory. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 382–389. Springer, Heidelberg (2014)

    Google Scholar 

  11. Krick, T., Logar, A.: An algorithm for the computation of the radical of an ideal in the ring of polynomials. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1991. LNCS, vol. 539, pp. 195–205. Springer, Heidelberg (1991)

    Google Scholar 

  12. Lecerf, G.: Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. J. of Complexity 19(4), 564–596 (2003)

    Google Scholar 

  13. Lemaire, F., Maza, M.M., Pan, W., Xie, Y.: When does 〈T〉 equal sat(T)? J. Symb. Comput. 46(12), 1291–1305 (2011)

    Google Scholar 

  14. Logar, A.: A computational proof of the noether normalization lemma. In: Mora, T. (ed.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC 1988. LNCS, vol. 357, pp. 259–273. Springer, Heidelberg (1989)

    Google Scholar 

  15. Rouillier, F.: Solving zero-dimensional systems through the rational univariate representation. Appl. Algebra Eng. Commun. Comput. 9(5), 433–461 (1999)

    Google Scholar 

  16. Seiler, W.M.: A combinatorial approach to involution and δ-regularity II: Structure analysis of polynomial modules with Pommaret bases. Appl. Alg. Eng. Comm. Comp. 20, 261–338 (2009)

    Google Scholar 

  17. Sommese, A.J., Verschelde, J.: Numerical homotopies to compute generic points on positive dimensional algebraic sets. J. Complexity 16(3), 572–602 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Parisa Alvandi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Alvandi, P., Chen, C., Hashemi, A., Maza, M.M. (2015). Regular Chains under Linear Changes of Coordinates and Applications. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2015. Lecture Notes in Computer Science(), vol 9301. Springer, Cham. https://doi.org/10.1007/978-3-319-24021-3_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-24021-3_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-24020-6

  • Online ISBN: 978-3-319-24021-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics