An ackermannian polynomial ideal

  • Guillermo Moreno Socías
Submitted Contributions

DOI: 10.1007/3-540-54522-0_116

Part of the Lecture Notes in Computer Science book series (LNCS, volume 539)
Cite this paper as:
Moreno Socías G. (1991) An ackermannian polynomial ideal. In: Mattson H.F., Mora T., Rao T.R.N. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1991. Lecture Notes in Computer Science, vol 539. Springer, Berlin, Heidelberg

Abstract

In this paper we answer the following question of Teo Mora ([8]): Write down a monomial ideal starting with a monomial of degree d, adding a monomial of degree d+1, another one of degree d+2, and so on, with every new monomial added not being a multiple of the previous ones; which is the maximal degree one can reach with this construction?

The paper is organized as follows. In section 1 we state the result concerning Mora's question; sections 2 and 3 contain some preliminaries and the proof, while in section 4 an example is shown and some remarks are made.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • Guillermo Moreno Socías
    • 1
  1. 1.Équipe de Calcul FormelCentre de Mathématiques & LIX École PolytechniquePalaiseau CedexFrance

Personalised recommendations