Binomial fibers and indispensable binomials. (May 2016)

• Record Type: Journal Article
• Authors: Charalambous, Hara; Thoma, Apostolos; Vladoiu, Marius
• Is Part Of: Journal of symbolic computation. Volume 74(2016)
• Page Start: 578
• Page End: 591
• Publication Date: 2016-05
• Subjects: 13P10 -- 14M25; Binomial ideals -- Markov basis -- Lattices; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2015.09.005
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: Let I be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of I . We provide a simple and efficient algorithm to compute the indispensable binomials of a binomial ideal from a given generating set of binomials and an algorithm to detect whether a binomial ideal is generated by indispensable binomials.