EUVIMEDEUVIMED entdecken
Crossref

Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters

Kosaku Nagasaka, Ryo Oshimatani

ACM Communications in Computer Algebra · 2023

DOI: 10.1145/3637529.3637540 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Communications in Computer Algebra, 2023. Verfasst von Kosaku Nagasaka und 1 weiteren Autor:innen. Die Arbeit nennt 8 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For a given finite polynomial set, finding a monomial order such that the given set is already a GrÖbner basis for the ideal generated by the given set with respect to the found monomial order is called GrÖbner basis detection (GBD) problem and there is also its simpler version, called structural GrÖbner basis detection (SGBD) problem. In this short communication, we give algorithms to solve these problems for polynomials with parameters on their coefficients.

Zitieren

APA

Nagasaka, K., & Oshimatani, R. (2023). Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters. ACM Communications in Computer Algebra. https://doi.org/10.1145/3637529.3637540

Vancouver

Nagasaka K, Oshimatani R. Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters. ACM Communications in Computer Algebra. 2023. doi:10.1145/3637529.3637540

BibTeX
@article{Nagasaka2023,
  author = {Nagasaka, Kosaku and Oshimatani, Ryo},
  title = {Conditional GrÖbner Basis: GrÖbner Basis Detection with Parameters},
  journal = {ACM Communications in Computer Algebra},
  year = {2023},
  doi = {10.1145/3637529.3637540}
}
Kostenlos starten →