Research Article

Computational methods for t-spread monomial ideals

Volume: 35 Number: 35 January 9, 2024
  • Luca Amata *
EN

Computational methods for t-spread monomial ideals

Abstract

Let $K$ be a field and $S=K[x_1,\ldots,x_n]$ a standard polynomial ring over $K$. In this paper, we give new combinatorial algorithms to compute the smallest $t$-spread lexicographic set and the smallest $t$-spread strongly stable set containing a given set of $t$-spread monomials of $S$. Some technical tools allowing to compute the cardinality of $t$-spread strongly stable sets avoiding their construction are also presented. Such functions are also implemented in a \emph{Macaulay2} package, \texttt{TSpreadIdeals}, to ease the computation of well-known results about algebraic invariants for $t$-spread ideals.

Keywords

References

  1. L. Amata, Graded Algebras: Theoretical and Computational Aspects, Doctoral Thesis, University of Catania, 2020.
  2. L. Amata and M. Crupi, Extremal Betti numbers of $t$-spread strongly stable ideals, Mathematics, {7}(8) (2019), 695 (16 pp).
  3. L. Amata and M. Crupi, On the extremal Betti numbers of squarefree monomial ideals, Int. Electron. J. Algebra, {30} (2021), 168-202.
  4. L. Amata, M. Crupi and A. Ficarra, Upper bounds for extremal Betti numbers of $t$-spread strongly stable ideals, Bull. Math. Soc. Sci. Math. Roumanie (N.S.), 65(113)(1) (2022), 13-34.
  5. L. Amata, M. Crupi and A. Ficarra, Projective dimension and Castelnuovo-Mumford regularity of $t$-spread ideals, Internat. J. Algebra Comput., 32(4) (2022), 837-858.
  6. L. Amata, A. Ficarra and M. Crupi, A numerical characterization of the extremal Betti numbers of $t$-spread strongly stable ideals, J. Algebraic Combin., 55(3) (2022), 891-918.
  7. C. Andrei-Ciobanu, V. Ene and B. Lajmiri, Powers of $t$-spread principal Borel ideals, Arch. Math. (Basel), {112}(6) (2019), 587-597.
  8. C. Andrei-Ciobanu, Kruskal-Katona Theorem for $t$-spread strongly stable ideals, Bull. Math. Soc. Sci. Math. Roumanie ({N.S.}), {62(110)(2)} (2019), 107-122.

Details

Primary Language

English

Subjects

Algebra and Number Theory

Journal Section

Research Article

Authors

Luca Amata * This is me
Italy

Early Pub Date

December 13, 2023

Publication Date

January 9, 2024

Submission Date

October 6, 2023

Acceptance Date

November 16, 2023

Published in Issue

Year 2024 Volume: 35 Number: 35

APA
Amata, L. (2024). Computational methods for t-spread monomial ideals. International Electronic Journal of Algebra, 35(35), 186-216. https://doi.org/10.24330/ieja.1402973
AMA
1.Amata L. Computational methods for t-spread monomial ideals. IEJA. 2024;35(35):186-216. doi:10.24330/ieja.1402973
Chicago
Amata, Luca. 2024. “Computational Methods for T-Spread Monomial Ideals”. International Electronic Journal of Algebra 35 (35): 186-216. https://doi.org/10.24330/ieja.1402973.
EndNote
Amata L (January 1, 2024) Computational methods for t-spread monomial ideals. International Electronic Journal of Algebra 35 35 186–216.
IEEE
[1]L. Amata, “Computational methods for t-spread monomial ideals”, IEJA, vol. 35, no. 35, pp. 186–216, Jan. 2024, doi: 10.24330/ieja.1402973.
ISNAD
Amata, Luca. “Computational Methods for T-Spread Monomial Ideals”. International Electronic Journal of Algebra 35/35 (January 1, 2024): 186-216. https://doi.org/10.24330/ieja.1402973.
JAMA
1.Amata L. Computational methods for t-spread monomial ideals. IEJA. 2024;35:186–216.
MLA
Amata, Luca. “Computational Methods for T-Spread Monomial Ideals”. International Electronic Journal of Algebra, vol. 35, no. 35, Jan. 2024, pp. 186-1, doi:10.24330/ieja.1402973.
Vancouver
1.Luca Amata. Computational methods for t-spread monomial ideals. IEJA. 2024 Jan. 1;35(35):186-21. doi:10.24330/ieja.1402973