Primality of polyomino ideals by quadratic Gröbner basis
نویسندگان
چکیده
In this work, we provide a necessary and sufficient condition on polyomino ideal for having the set of inner 2-minors as graded reverse lexicographic Gröbner basis, due to combinatorial properties itself. Moreover, prove that when latter holds coincides with lattice associated polyomino, is prime. As an application, describe two new infinite families prime polyominoes.
منابع مشابه
Binomial Edge Ideals with Quadratic Gröbner Bases
We prove that a binomial edge ideal of a graph G has a quadratic Gröbner basis with respect to some term order if and only if the graph G is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph G that do not depend on the labelling of its vertex set.
متن کاملOn Gröbner Basis Detection for Zero-dimensional Ideals
The Gröbner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if “yes” finda term order such that the set of polynomials is a Gröbner basis. This problem was shown to be NP-hard by Sturmfels and Wiegelmann. We show that GBD when studied in the context of zero dimensional ideals is also NP-hard. An algorithm to solve GBD for zero dimensiona...
متن کاملGröbner bases of ideals invariant under endomorphisms
We introduce the notion of Gröbner S-basis of an ideal of the free associative algebra K〈X〉 over a field K invariant under the action of a semigroup S of endomorphisms of the algebra. We calculate the Gröbner S-bases of the ideal corresponding to the universal enveloping algebra of the free nilpotent of class 2 Lie algebra and of the T-ideal generated by the polynomial identity [x, y, z] = 0, w...
متن کاملOptimal Gröbner Base Algorithms for Binomial Ideals
Little is known about upper complexity bounds for the normal form algorithms which transform a given polynomial ideal basis into a Grr obner basis. In this paper, we exhibit an optimal, exponential space algorithm for generating the reduced Grr obner basis of binomial ideals. This result is then applied to derive space optimal decision procedures for the nite enumeration and subword problems fo...
متن کاملGRÖBNER BASES AND DETERMINANTAL IDEALS -- An Introduction
We give an introduction to the theory of determinantal ideals and rings, their Gröbner bases, initial ideals and algebras, respectively. The approach is based on the straightening law and the Knuth-Robinson-Schensted correspondence. The article contains a section treating the basic results about the passage to initial ideals and algebras. Let K be a field and X an m × n matrix of indeterminates...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Nachrichten
سال: 2022
ISSN: ['1522-2616', '0025-584X']
DOI: https://doi.org/10.1002/mana.202000252