Skip to main content

On Connection Between Constructive Involutive Divisions and Monomial Orderings

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2006)

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

Included in the following conference series:

Abstract

This work considers the basic issues of the theory of involutive divisions, namely, the property of constructivity which assures the existence of minimal involutive basis. The work deals with class of ≻ -divisions which possess many good properties of Janet division and can be considered as its analogs for orderings different from the lexicographic one. Various criteria of constructivity and non-constructivity are given in the paper for these divisions in terms of admissible monomial orderings ≻ . It is proven that Janet division has the advantage in the minimal involutive basis size of the class of ≻ -divisions for which x 1x 2 ≻ ... ≻ x n holds. Also examples of new involutive divisions which can be better than Janet division in minimal involutive basis size for some ideals are given.

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. Apel, J.: The theory of involutive divisions and an application to Hilbert function computations. Journal of Symbolic Computation 25(6), 683–704 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Calmet, J., Hausdorf, M., Seiler, W.M.: A constructive introduction to involution. In: Proc. Int. Symp. Applications of Computer Algebra – ISACA 2000, pp. 33–50 (2001)

    Google Scholar 

  3. Gerdt, V.P., Blinkov, Y.A.: Involutive bases of polynomial ideals. Mathematics and Computers in Simulation 45, 519–542 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gerdt, V.P., Blinkov, Y.A.: Minimal involutive bases. Mathematics and Computers in Simulation 45, 543–560 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gerdt, V.P.: Involutive division technique: some generalizations and optimizations. Journal of Mathematical Sciences 108(6), 1034–1051 (2002)

    Article  MathSciNet  Google Scholar 

  6. Hemmecke, R.: Involutive Bases for Polynomial Ideals. Institut für Symbolisches Rechnen, Linz (2003)

    Google Scholar 

  7. Semenov, A.S.: Pair analysis of involutive divisions. Fundamental and Applied Mathematics 9(3), 199–212 (2003)

    MATH  Google Scholar 

  8. Gerdt, V.P., Blinkov, Y.A., Yanovich, D.A.: Quick search of Janet divisor. Programmirovanie 1, 32–36 (2001) (in Russian)

    MathSciNet  Google Scholar 

  9. Zharkov, A.Y., Blinkov, Y.A.: Involutive systems of algebraic equations. Programmirovanie (1994) (in Russian)

    Google Scholar 

  10. Zharkov, A.Y., Blinkov, Y.A.: Involutive Bases of Zero-Dimensional Ideals. Preprint No. E5-94-318, Joint Institute for Nuclear Research, Dubna (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Semenov, A. (2006). On Connection Between Constructive Involutive Divisions and Monomial Orderings. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2006. Lecture Notes in Computer Science, vol 4194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11870814_22

Download citation

  • DOI: https://doi.org/10.1007/11870814_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45182-2

  • Online ISBN: 978-3-540-45195-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics