Abstract
The aim of this paper is to investigate upper bounds for the maximum degree of the elements of any minimal Janet basis of an ideal generated by a set of homogeneous polynomials. The presented bounds depend on the number of variables and the maximum degree of the generating set of the ideal. For this purpose, by giving a deeper analysis of the method due to Dubé (SIAM J Comput 19:750–773, 1990), we improve (and correct) his bound on the degrees of the elements of a reduced Gröbner basis. By giving a simple proof, it is shown that this new bound is valid for Pommaret bases, as well. Furthermore, based on Dubé’s method, and by introducing two new notions of genericity, so-called J-stable position and prime position, we show that Dubé’s (new) bound holds also for the maximum degree of polynomials in any minimal Janet basis of a homogeneous ideal in any of these positions. Finally, we study the introduced generic positions by proposing deterministic algorithms to transform any given homogeneous ideal into these positions.
Similar content being viewed by others
Notes
The Maple code to calculate \({\mathcal {F}}_{1}(d)\) for any n is available at http://amirhashemi.iut.ac.ir/softwares
The Maple code of our implementations are available at http://amirhashemi.iut.ac.ir/softwares
For further details see the SymbolicData Project (http://www.SymbolicData.org)
References
Albert, M., Fetzer, M., Seiler, W.M.: Janet bases and resolutions in CoCoALib. Computer algebra in scientific computing. In: 17th International Workshop, CASC 2015, Aachen, Germany, September 14–18, 2015. Proceedings. pp. 15–29, Cham: Springer (2015)
Bayer, D., Stillman, M.: A criterion for detecting m-regularity. Invent. Math. 87, 1–11 (1987)
Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph. D. thesis, Universität Innsbruck, (1965)
Buchberger, B. Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German. J. Symb. Comput., 41(3–4), 475–511 (2006)
Cox, D.A., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra. Springer, Cham (2015)
Dubé, T.W.: The structure of polynomial ideals and Gröbner bases. SIAM J. Comput. 19(4), 750–773 (1990)
Fröberg, R.: An Introduction to Gröbner Bases. Pure and Applied Mathematics (New York). Wiley, Chichester (1997)
Gerdt, V.P.: On the relation between Pommaret and Janet bases. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) Computer Algebra in Scientific Computing, pp. 167–181. Springer, Berlin (2000)
Gerdt, V.P.: Involutive algorithms for computing Gröbner bases. Computational commutative and non-commutative algebraic geometry. In: Proceedings of the NATO Advanced Research Workshop, 2004. Amsterdam: IOS Press, pp. 199–225 (2005)
Gerdt, V.P., Blinkov, Y.A.: Involutive bases of polynomial ideals. Math. Comput. Simul. 45(5–6), 519–541 (1998)
Giusti, M.: Some effectivity problems in polynomial ideal theory. EUROSAM 84. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation. Lecture Notes on Computer Science, Cambridge/Engl 174, pp. 159–171 (1984)
Hashemi, A., Parnian, H., Seiler, W.M.: Nœther bases and their applications. Bulletin of the Iranian Mathematical Society, to appear (2019)
Hashemi, A., Schweinfurter, M., Seiler, W.M.: Deterministic genericity for polynomial ideals. J. Symb. Comput. 86, 20–50 (2018)
Hashemi, A., Seiler, W.M.: Dimension-dependent upper bounds for Gröbner bases. In: Proceedings of the 42th International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25–28, 2017. New York, NY: Association for Computing Machinery (ACM), 2017, pp 189–196 (2017)
Janet, M.: Sur les systèmes d’équations aux dérivées partielles. C. R. Acad. Sci. Paris 170, 1101–1103 (1920)
Lazard, D.: Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. Computer algebra, EUROCAL’83. In: Proceedings. Conference on Lecture Notes of Computer Science 162, pp 146-156, London (1983)
Mall, D.: On the relation between Gröbner and Pommaret bases. Appl. Algebra Eng. Commun. Comput. 9(2), 117–123 (1998)
Mayr, E.W., Ritscher, S.: Dimension-dependent bounds for Gröbner bases of polynomial ideals. J. Symb. Comput. 49, 78–94 (2013)
Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra, vol. 227. Springer, New York (2005)
Möller, H., Mora, F.: Upper and lower bounds for the degree of Gröbner bases. EUROSAM 84, Symbolic and algebraic computation. In: Proceedings of International Symposium, Cambridge/Engl. 1984, Lecture Notes on Computer Science 174, pp 172–183 (1984)
Mora, T.: Solving Polynomial Equation Systems II: Macaulay’s Paradigm and Gröbner Technology. Cambridge University Press, Cambridge (2005)
Pommaret, J.: Systems of Partial Differential Equations and Lie Pseudogroups. Gordon and Breach Science Publishers, London (1978)
Seiler, W.M.: A combinatorial approach to involution and \(\delta \)-regularity II: structure analysis of polynomial modules with Pommaret bases. Appl. Algebra Eng. Commun. Comput. 20(3–4), 261–338 (2009)
Seiler, W.M.: Involution: The formal Theory of Differential Equations and its Applications in Computer Algebra. Springer, Berlin (2010)
Zharkov, A., Blinkov, Y.: Involution approach to investigating polynomial systems. Math. Comput. Simul. 42(4), 323–332 (1996)
Acknowledgements
The authors would like to thank the anonymous reviewers for their helpful and constructive comments. The research of the first author was in part supported by a Grant from IPM (No. 98550413).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Hashemi, A., Parnian, H. & Seiler, W.M. Degree Upper Bounds for Involutive Bases. Math.Comput.Sci. 15, 233–254 (2021). https://doi.org/10.1007/s11786-020-00480-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11786-020-00480-2
Keywords
- Polynomial ideals
- Gröbner bases
- Hilbert functions
- Exact cone decompositions
- Degree upper bounds
- Involutive bases