On the bit-size of non-radical triangular sets

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

We present upper bounds on the bit-size of coefficients of non-radical purely lexicographical Gröbner bases (triangular sets) in dimension zero. This extends a previous work [4], constrained to radical triangular sets; it follows the same technical steps, based on interpolation. However, key notion of height of varieties is not available for points with multiplicities; therefore the bounds obtained are thus less universal and depend on some input data. We also introduce a related family of non-monic polynomials that have smaller coefficients, and smaller bounds. It is not obvious to compute them from the initial triangular set though.

本文言語English
ホスト出版物のタイトルMathematical Aspects of Computer and Information Sciences - 7th International Conference, MACIS 2017, Proceedings
編集者Ilias S. Kotsireas, Johannes Blomer, Dimitris E. Simos, Temur Kutsia
出版社Springer Verlag
ページ264-269
ページ数6
ISBN(印刷版)9783319724522
DOI
出版ステータスPublished - 2017
外部発表はい
イベント7th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2017 - Vienna, Austria
継続期間: 2017 11 152017 11 17

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10693 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Conference

Conference7th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2017
国/地域Austria
CityVienna
Period17/11/1517/11/17

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On the bit-size of non-radical triangular sets」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル