Finding binomials in polynomial ideals

Anders Nedergaard Jensen, Thomas Kahle, Lukas Katthän

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

165 Downloads (Pure)


We describe an algorithm which finds binomials in a given ideal I⊂ Q[x 1, ⋯ , x n] and in particular decides whether binomials exist in I at all. Binomials in polynomial ideals can be well hidden. For example, the lowest degree of a binomial cannot be bounded as a function of the number of indeterminates, the degree of the generators, or the Castelnuovo–Mumford regularity. We approach the detection problem by reduction to the Artinian case using tropical geometry. The Artinian case is solved with algorithms from computational number theory.

Original languageEnglish
Article number16
JournalResearch In the Mathematical Sciences
Publication statusPublished - 2017


  • Algorithm
  • Binomial detection
  • Binomial ideal
  • Tropical geometry


Dive into the research topics of 'Finding binomials in polynomial ideals'. Together they form a unique fingerprint.

Cite this