2015/01/19 by Simon Keicher, Thomas Kremer
Chemistry · Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Biology #Botany #Chemistry #Combinatorics #Commutative Algebra and Its Applications #Computer science #Containment (computer programming) #Discrete mathematics #Ideal (ethics) #Law #Mathematics #Monomial #Monomial basis #Monomial ideal #Political science #Polynomial #Polynomial and algebraic computation #Polynomial ring #Programming language #Ring (chemistry) #Test (biology) #cs.SC #math.AC #math.AG #msc:13P05 #msc:13P10 #msc:13P15 #msc:14Q99
paper · pdf · doi:10.1016/j.jsc.2017.01.001
published in Journal of Symbolic Computation 82, 74-90 (Elsevier BV) · 15 pages
arxiv created 2015/01/19 · openalex publication_date 2017/01/06 · arxiv updated 2017/04/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gröbner bases, factorization or sub-resultant computations.