Pith. sign in

REVIEW 4 major objections 6 minor 42 references

Polyominoes and Knutson ideals

T0 review · 4 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proves that the polyomino ideals of closed path, weakly closed path, simple thin, and ladder polyominoes are Knutson ideals, and that a restricted class of thin polyominoes is prime with an explicit reduced Gröbner basis.

desk verdict Real progress on Knutson and prime polyomino ideals, but a load-bearing lemma for simple thin polyominoes is left unproved, so the paper needs revision before acceptance. read the letter →

arxiv 2411.16364 v1 pith:PMPPKG7D submitted 2024-11-25 math.AC

Mitra Koley , Nirmal Kotal , Dharm Veer This is my paper · ORCID
classification math.AC MSC 05E4005B5013P10
keywords polyominoidealsKnutsonradicalofKönigtypeGröbnerbasesprimethinpolyominoesladder
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper sets out to prove radicality and primality of polyomino ideals by bringing Knutson ideals into polyomino combinatorics. It establishes that the polyomino ideal of every closed path, weakly closed path, simple thin, and ladder polyomino is Knutson, meaning it has a squarefree initial ideal and is therefore radical. For a restricted class of thin collections of cells it proves more: the ideal is prime and the reduced Gröbner basis consists exactly of the binomials attached to inner intervals. A separate theorem shows that when a parallelogram polyomino is cut out of another parallelogram polyomino, the leftover collection is Knutson under a non-crossing condition, with a Gröbner basis computed. The payoff is a structural certificate of radicality that also produces explicit Gröbner bases, aligning these binomial ideals with the behavior already known for determinantal and ladder ideals.

What carries the argument

The central objects are the polyomino ideal $I_P$, the binomial ideal generated by $x_a x_b - x_c x_d$ for every inner interval $[a,b]$ with anti-diagonal vertices $c,d$; the Knutson ideal, an ideal obtainable from a principal ideal $(f)$ with squarefree leading term through colons, sums, and intersections; and the ideal of König type, a height-$h$ ideal generated by $h$ homogeneous generators whose initial terms form a regular sequence. Proposition 3.2 is the bridge: for an unmixed radical ideal, König type with squarefree initial terms implies Knutson. In the ladder section the paper adds a structural tool: vertices are partitioned into anti-diagonal sets $V_k$, each $V_k$ yields a determinant $f_k$ of a matrix of variables, and the product $f = \prod_k f_k$ has squarefree initial monomial equal to the product of all vertex variables. A transposition-pairing lemma shows each $f_k$ lies in the ideal of the sub-polyomino with one added cell, driving an induction that builds $I_P$ from Knutson pieces.

What would settle it

Run the induction of Theorem 3.6 on the polyomino of Figure 2: if, when the final cell is added, the asserted new generators do not have squarefree pairwise-coprime initial terms under the constructed order, the single-cell lemma and the theorem collapse. Separately, compute all S-pairs of the inner-interval binomials for the thin polyomino of Figure 19 under the stated reverse lexicographic order; any S-pair that fails to reduce to zero would refute the claimed reduced Gröbner basis and primality.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is that radicality of several classes of polyomino ideals can be certified by exhibiting them as Knutson ideals rather than by ad hoc initial-ideal computations. The proof chain is: certain polyomino ideals are ideals of König type; an unmixed radical ideal of König type whose chosen generators have squarefree initial terms is Knutson (Proposition 3.2); and Knutson ideals have squarefree initial ideals, hence are radical. Along the way the paper identifies a gap in the prior argument that simple thin polyominoes are of König type and supplies a generalized single-cell extension lemma to complete the induction. For the thin class satisfying three exclusions, it shows the inner-interval binomials themselves form the reduced Gröbner basis and the ideal is prime.

Load-bearing premise

The load-bearing assumption is that adding a single end cell to a polyomino that already has the special generator property preserves that property; the paper cites two earlier lemmas for this step instead of proving it, and the whole induction for simple thin polyominoes depends on it.

Editorial extensions

If this is right

  • Every closed path, weakly closed path, simple thin, and ladder polyomino ideal is radical, because Knutson ideals have squarefree initial ideals.
  • For the thin class of Theorem 5.1, the polyomino ideal is prime and its quotient ring is a domain, with the inner-interval binomials as an explicit reduced Gröbner basis.
  • For weakly closed path polyominoes there is an explicit regular sequence of $n$ initial terms, one per cell, proving König type and hence Knutson membership.
  • For ladder polyominoes, the construction exhibits a polynomial $f$ whose leading term is the product of all vertex variables, and the proof realizes $I_P$ as a sum of Knutson ideals step by step.
  • When a parallelogram polyomino is extracted from another and no inner interval crosses both removed and kept layers, the leftover collection is Knutson and its quadratic binomials form a Gröbner basis.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • My inference: the anti-diagonal determinant construction suggests a general recipe for Knutson certificates on any polyomino admitting a vertex ordering with squarefree pairwise behavior, so the ladder argument may extend beyond ladders.
  • My inference: the transposition-pairing lemma behind the ladder proof resembles a straightening law for 2-minors; if it generalizes, the same induction could apply to ideals generated by $k$-minors of polyomino-shaped matrices.
  • My inference: the condition $I_{Q_1} + I_{Q_2} = I_P$ in Section 6 is plausibly equivalent to the cut between the removed parallelogram and the remainder having no interleaving cells, which computer search over small parallelogram extractions could test directly.
  • My inference: because Knutson ideals behave well under sums, the proofs give constructive radicality certificates; for the thin class the certificate is explicit enough to feed directly into a Gröbner basis computation.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper introduces the study of Knutson ideals for polyomino ideals. It proves that the polyomino ideals of simple thin, closed path, weakly closed path, ladder, and certain thin polyominoes are Knutson, hence radical; in several cases it also computes reduced Gröbner bases and proves primality. The main bridge is Proposition 3.2, which converts König-type ideals with unmixedness/radicality into Knutson ideals. The later sections develop a filtration method based on anti-diagonal vertex sets (Discussion 4.2) and apply it to ladder polyominoes, thin polyominoes, and parallelogram polyominoes with a parallelogram removed.

Significance. If the gaps noted below are repaired, the paper is a substantial contribution to the radicality and primality theory of polyomino ideals. It gives a clean criterion (Proposition 3.2) for passing from König type to Knutsonness, and Section 4 develops a genuinely useful anti-diagonal filtration with explicit permutation lemmas. The paper also supplies checkable consequences (explicit Gröbner bases, primality of certain thin polyominoes) and makes appropriate use of prior work by Dinu–Navarra, Herzog–Hibi, Mascia–Rinaldo–Romeo, and others. The main weaknesses are that two load-bearing proofs are deferred to figures or to [HH23] and one geometric decomposition in Section 6 is asserted without proof. These are correctness risks rather than demonstrated errors.

major comments (4)
  1. [Section 3.1, Lemma 3.4] Lemma 3.4 is load-bearing for Theorem 3.6 and is explicitly introduced as a strengthened version of [HH23, Lemma 5.4] needed because Example 3.3 shows the original lemma is insufficient. However, its proof is only the sentence 'The proof follows the argument of [HH23, Lemma 3.2, 3.3].' The manuscript does not show that the cited lemmas cover the strengthened hypotheses, in particular the condition that {a,b} is an edge of C only in P and the specification that the new order <' extends < and forces the two displayed initial terms. Since Theorem 3.6 and Corollary 3.7 collapse if this lemma is not available, the authors should either provide a complete proof or a precise reduction to [HH23] with every hypothesis checked.
  2. [Section 3.2, Theorem 3.12] The proof of Theorem 3.12 is presented as a case analysis conducted through Figures 8–11. The central assertions that the inductive labeling 'allows us to complete the labeling of all the vertices of P' and that the chosen generators f_i have pairwise coprime square-free initial terms are asserted rather than formally verified. A rigorous proof should enumerate the possible configurations, prove that the figures cover all weakly closed path shapes, and verify the stated order inequalities at every step, including the final step involving A_{n-4}, A_{n-3}, A_{n-2}, A_{n-1}. Since Corollary 3.14 depends on this theorem, the case analysis needs to be made checkable.
  3. [Section 6, Theorem 6.2] The proof of Theorem 6.2 rests on an unproved geometric decomposition of Q1: it asserts that if Q1 is not a polyomino, then Q1 is a union of polyominoes R, R_1^L,...,R_r^L, R_1^R,...,R_s^R satisfying the listed vertex-intersection conditions (1)–(3). No argument is given that this decomposition follows from the definition of Q1 in terms of the V_i filtration, nor is the analogous statement for Q2 proved. This decomposition is essential for applying Proposition 4.10 and Proposition 6.1. The authors should state and prove this decomposition as a lemma.
  4. [Corollary 5.2 and Proposition 5.4] The primality conclusions in Corollary 5.2 and Proposition 5.4 depend on identifying the monomial order < of Discussion 4.2 with the orders <4 and <6 of [MRR22], respectively. The text only asserts these identifications. Since [MRR22, Corollary 3.3] is an external result whose hypotheses include the specific monomial order, the identifications are load-bearing and should be verified explicitly with reference to the definitions in [MRR22].
minor comments (6)
  1. [Lemma 4.5] In the proof of Lemma 4.5, in the subcase 4.4.2 (1), the displayed equalities appear to contain a typo: they should probably read eσ(i)=σ(i) and eσ(j)=σ(j), not eσ(i)=σ(j), eσ(j)=σ(j).
  2. [Theorem 5.1 proof] In the proof of Theorem 5.1, the symbol C_{i_k} is used both for the set of cells associated with V_{i_k} and for the single cell C_k obtained as C_{i_k} ∩ J. Separate notations would make the argument much easier to follow.
  3. [After Figure 19] The sentence following Figure 19 is confusing: it says the displayed polyomino satisfies the hypothesis of Theorem 5.1 even though it contains a collection of cells isomorphic to Figure 18a. Since condition (1) of Theorem 5.1 is coordinate-specific, the intended convention about rotations/reflections should be spelled out.
  4. [Corollary 3.14] The proof states without justification that IP1 (resp. IP2) is a minimal prime ideal of (f1,...,f_{n-1}) (resp. (f0,...,f_{n-2})). A sentence explaining minimality, using the known height of these ideals, would remove an avoidable gap.
  5. [Theorem 6.2] The notation h1 = ∪_{i<b} f_i uses a union symbol where the product of polynomials is meant; the same applies to h2. This should be corrected to ∏_{i<b} f_i and ∏_{i>a} f_i.
  6. [Table 1] The table header 'IF it occurs ... THEN we refer to ...' is typographically awkward, and the surrounding text would be clearer if each row explicitly stated which rotations and reflections are allowed rather than relying on a single global phrase.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular derivation found: the Knutson conclusions are reached through independent K\"onig-type, unmixedness and primeness results; the only self-citation ([CNV24]) is published supporting evidence, and the deferred proof of Lemma 3.4 is a missing-proof concern, not a circular step.

full rationale

The derivation chain is not circular. Proposition 3.2 is a conditional bridge: an unmixed radical ideal of K\"onig type with square-free leading forms is Knutson. Each application supplies the hypotheses from outside the target claim: for simple thin polyominoes, Theorem 3.6 proves K\"onig type and primeness is known from [HSM14]; for closed paths, K\"onig type is cited from [DN22], unmixedness from [CNV24], and square-free Gr\"obner/radicality from [CNU22a]; for weakly closed paths, an explicit monomial order and generators are constructed in Theorem 3.12, with height cited from [CNV24, Proposition 4.10]. The self-citation [CNV24] is used as a published external theorem about unmixedness and height of closed and weakly closed path ideals, not as a restatement of the Knutson conclusion, so it does not create a loop. The ladder, thin, and extraction results are constructive: f is built from determinants of vertex matrices (Discussion 4.2), and Lemma 4.3 computes its square-free initial term; no parameter is fitted to the claimed Knutson membership. The only notable gap is Lemma 3.4, whose proof is the single sentence 'The proof follows the argument of [HH23, Lemma 3.2, 3.3].' This is an omitted proof and a correctness risk, since Example 3.3 shows the original [HH23, Lemma 5.4] is insufficient, but it is a deferral to external lemmas, not an equation that reduces to its own input. Hence the circularity score is 1.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

The central claims rest on a mixture of new unproved lemmas and standard external theorems. No free parameters or invented entities appear. The paper does not fit any numerical data.

assumptions (6)
  • ad hoc to paper Lemma 3.4: adding a cell to a simple thin polyomino of König type preserves König type under the stated conditions.
    The proof is not given; the text says 'The proof follows the argument of [HH23, Lemma 3.2, 3.3]' (Section 3.1). This lemma is the engine of the induction in Theorem 3.6.
  • domain assumption Simple polyominoes are prime, so their coordinate rings are domains ([HSM14, Corollary 2.2]).
    Used in Theorem 4.1 to assert IP_{k-1} and IP_{k-1}∪{C} are prime, and in Corollary 3.14.
  • domain assumption For a parallelogram polyomino (or Hibi ring), the set of all binomials corresponding to inner intervals forms a Gröbner basis under the order < ([HHO18, Theorem 6.17]).
    Used in the proofs of Proposition 4.11, Corollary 5.2, and Proposition 6.4.
  • domain assumption Closed path polyominoes are of König type ([DN22, Theorem 4.9]) and closed path polyomino ideals are unmixed ([CNV24, Theorem 4.19]).
    Used in Proposition 3.11 to prove closed path polyominoes are Knutson.
  • domain assumption The monomial order < used in Discussion 4.2 coincides with order <4 of [MRR22], and [MRR22, Corollary 3.3] implies primality from a reduced Gröbner basis of quadratic binomials.
    Used in Corollary 5.2 and Proposition 5.4.
  • domain assumption For thin polyominoes where non-trivial intersections of maximal inner intervals are cells, the set of inner-interval binomials forms a reduced Gröbner basis ([JN24, Theorem 2.1]).
    Used in Proposition 5.4.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Polyominoes and Knutson ideals." pith.science (2026). https://pith.science/paper/PMPPKG7D

@misc{pith2026241116364,
  author       = {Pith},
  title        = {Pith review of: Polyominoes and Knutson ideals},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PMPPKG7D}},
  note         = {Machine review of arXiv:2411.16364}
}
read the original abstract

In this article, we study two fundamental questions on polyomino ideals which are radicality and primality. In order to study the question of radicality, we initiate the study of Knutson ideals among polyominoes. Knutson ideals were introduced by Conca and Varbaro after the work of Knutson on compatibly split ideals. Knutson ideals are known to have nice properties, for example, they are well behaved with Gr\"{o}bner bases, and it has square-free initial ideals; hence they are radical. We show that polyomino ideals associated with closed path, weakly closed path, simple thin, and ladder polyominoes are Knutson. We also show that polyomino ideals associated with a class of thin polyominoes are Knutson; hence they are radical. In fact, we show that these polyomino ideals are prime and the reduced Gr\"{o}bner basis is computed. Furthermore, we prove that under a certain condition, if a parallelogram polyomino is extracted from another parallelogram polyomino, the resulting collection of cells is Knutson. We also compute their Gr\"{o}bner basis.

Figures

Figures reproduced from arXiv: 2411.16364 by the authors.

Figure 13
Figure 13. A ladder polyomino Theorem 4.1. Let P be a ladder polyomino. Then, IP is a Knutson ideal. 14 [PITH_FULL_IMAGE:figures/full_fig_p014_13.png] view at source ↗
Figure 14
Figure 14. A ladder polyomino In loose words, Vi ’s are the sets of vertices on anti-diagonal lines. For i < j, either Vj is on the anti-diagonal line to the right of Vi , or if they reside on the same anti-diagonal line, then Vj is positioned lower than Vi . An example is given in [PITH_FULL_IMAGE:figures/full_fig_p015_14.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

42 extracted references · 40 canonical work pages

  1. [1]

    Ladder determinantal rings have rational singularities

    Aldo Conca and J\"urgen Herzog. Ladder determinantal rings have rational singularities. Adv. Math. , 132(1):120--147, 1997

    work page 1997

  2. [2]

    Primality of closed path polyominoes

    Carmelo Cisto and Francesco Navarra. Primality of closed path polyominoes. J. Algebra Appl. , 22(2):Paper No. 2350055, 29, 2023

    work page 2023

  3. [3]

    On G r\"obner basis and C ohen- M acaulay property of closed path polyominoes

    Carmelo Cisto, Francesco Navarra, and Rosanna Utano. On G r\"obner basis and C ohen- M acaulay property of closed path polyominoes. Electron. J. Combin. , 29(3):Paper No. 3.54, 22, 2022

    work page 2022

  4. [4]

    Primality of weakly connected collections of cells and weakly closed path polyominoes

    Carmelo Cisto, Francesco Navarra, and Rosanna Utano. Primality of weakly connected collections of cells and weakly closed path polyominoes. Illinois J. Math. , 66(4):545--563, 2022

    work page 2022

  5. [5]

    Hilbert- P oincar\'e series and G orenstein property for some non-simple polyominoes

    Carmelo Cisto, Francesco Navarra, and Rosanna Utano. Hilbert- P oincar\'e series and G orenstein property for some non-simple polyominoes. Bull. Iranian Math. Soc. , 49(3):Paper No. 22, 26, 2023

    work page 2023

  6. [6]

    Polyocollection ideals and primary decomposition of polyomino ideals

    Carmelo Cisto, Francesco Navarra, and Dharm Veer. Polyocollection ideals and primary decomposition of polyomino ideals. Journal of Algebra , 641:498--529, 2024

    work page 2024

  7. [7]

    Ladder determinantal rings

    Aldo Conca. Ladder determinantal rings. J. Pure Appl. Algebra , 98(2):119--134, 1995

    work page 1995

  8. [8]

    Gorenstein ladder determinantal rings

    Aldo Conca. Gorenstein ladder determinantal rings. J. London Math. Soc. (2) , 54(3):453--474, 1996

    work page 1996

Show all 42 references
  1. [9]

    Square-free G r\" o bner degenerations

    Aldo Conca and Matteo Varbaro. Square-free G r\" o bner degenerations. Invent. Math. , 221(3):713--730, 2020

    2020

  2. [10]

    Lattice walks and primary decomposition

    Persi Diaconis, David Eisenbud, and Bernd Sturmfels. Lattice walks and primary decomposition. In Mathematical essays in honor of G ian- C arlo R ota ( C ambridge, MA , 1996) , volume 161 of Progr. Math. , pages 173--193. Birkh\"auser Boston, Boston, MA, 1998

    1996

  3. [11]

    Non-simple polyominoes of k\" o nig type and their canonical module

    Rodica Dinu and Francesco Navarra. Non-simple polyominoes of k\" o nig type and their canonical module. arXiv preprint arXiv:2210.12665 , 2022

    2022 arXiv

  4. [12]

    Regularity and the G orenstein property of L -convex polyominoes

    Viviana Ene, J\" u rgen Herzog, Ayesha Asloob Qureshi, and Francesco Romeo. Regularity and the G orenstein property of L -convex polyominoes. Electron. J. Combin. , 28(1):Paper No. 1.50, 23, 2021

    2021

  5. [13]

    S. W. Golomb. Checker boards and polyominoes. Amer. Math. Monthly , 61:675--682, 1954

    1954

  6. [14]

    Solomon W. Golomb. Polyominoes . Princeton University Press, Princeton, NJ, second edition, 1994. Puzzles, patterns, problems, and packings, With diagrams by Warren Lushbaugh, With an appendix by Andy Liu

    1994

  7. [15]

    Mixed ladder determinantal varieties from two-sided ladders

    Elisa Gorla. Mixed ladder determinantal varieties from two-sided ladders. J. Pure Appl. Algebra , 211(2):433--444, 2007

    2007

  8. [16]

    Ideals generated by adjacent 2-minors

    J\"urgen Herzog and Takayuki Hibi. Ideals generated by adjacent 2-minors. J. Commut. Algebra , 4(4):525--549, 2012

    2012

  9. [17]

    urgen Herzog and Takayuki Hibi. Finite distributive lattices, polyominoes and ideals of K \

    J\"urgen Herzog and Takayuki Hibi. Finite distributive lattices, polyominoes and ideals of K \"onig type. Internat. J. Math. , 34(14):Paper No. 2350089, 13, 2023

    2023

  10. [18]

    Binomial edge ideals and conditional independence statements

    J\"urgen Herzog, Takayuki Hibi, Freyja Hreinsd\'ottir, Thomas Kahle, and Johannes Rauh. Binomial edge ideals and conditional independence statements. Adv. in Appl. Math. , 45(3):317--333, 2010

    2010

  11. [19]

    urgen Herzog, Takayuki Hibi, and Somayeh Moradi. Graded ideals of K \

    J\"urgen Herzog, Takayuki Hibi, and Somayeh Moradi. Graded ideals of K \"onig type. Trans. Amer. Math. Soc. , 375(1):301--323, 2022

    2022

  12. [20]

    Binomial ideals , volume 279 of Graduate Texts in Mathematics

    J\" u rgen Herzog, Takayuki Hibi, and Hidefumi Ohsugi. Binomial ideals , volume 279 of Graduate Texts in Mathematics . Springer, Cham, 2018

    2018

  13. [21]

    Special simplices and G orenstein toric rings

    Takayuki Hibi and Hidefumi Ohsugi. Special simplices and G orenstein toric rings. J. Combin. Theory Ser. A , 113(4):718--725, 2006

    2006

  14. [22]

    Nonsimple polyominoes and prime ideals

    Takayuki Hibi and Ayesha Asloob Qureshi. Nonsimple polyominoes and prime ideals. Illinois J. Math. , 59(2):391--398, 2015

    2015

  15. [23]

    Ideals of adjacent minors

    Serkan Ho s ten and Seth Sullivant. Ideals of adjacent minors. J. Algebra , 277(2):615--642, 2004

    2004

  16. [24]

    The coordinate ring of a simple polyomino

    J\" u rgen Herzog and Sara Saeedi Madani. The coordinate ring of a simple polyomino. Illinois J. Math. , 58(4):981--995, 2014

    2014

  17. [25]

    Shellable simplicial complex and switching rook polynomial of frame polyominoes

    Rizwan Jahangir and Francesco Navarra. Shellable simplicial complex and switching rook polynomial of frame polyominoes. J. Pure Appl. Algebra , 228(6):Paper No. 107576, 25, 2024

    2024

  18. [26]

    Frobenius splitting, point-counting, and degeneration

    Allen Knutson. Frobenius splitting, point-counting, and degeneration. arXiv preprint arXiv:0911.4941 , 2009

    2009 arXiv

  19. [27]

    The C harney- D avis conjecture for simple thin polyominoes

    Manoj Kummini and Dharm Veer. The C harney- D avis conjecture for simple thin polyominoes. Comm. Algebra , 51(4):1654--1662, 2023

    2023

  20. [28]

    The h -polynomial and the rook polynomial of some polyominoes

    Manoj Kummini and Dharm Veer. The h -polynomial and the rook polynomial of some polyominoes. Electron. J. Combin. , 30(2):Paper No. 2.6, 7, 2023

    2023

  21. [29]

    Primality of multiply connected polyominoes

    Carla Mascia, Giancarlo Rinaldo, and Francesco Romeo. Primality of multiply connected polyominoes. Illinois J. Math. , 64(3):291--304, 2020

    2020

  22. [30]

    Mascia, G

    C. Mascia, G. Rinaldo, and F. Romeo. Primality of polyomino ideals by quadratic Gr \"o bner basis. Math. Nachr. , 295(3):593--606, 2022

    2022

  23. [31]

    Shellable flag simplicial complexes of non-simple polyominoes

    Francesco Navarra. Shellable flag simplicial complexes of non-simple polyominoes. arXiv preprint arXiv:2408.12367 , 2024

    2024 arXiv

  24. [32]

    Giovanni Pistone, Eva Riccomagno, and Henry P. Wynn. Algebraic statistics , volume 89 of Monographs on Statistics and Applied Probability . Chapman & Hall/CRC, Boca Raton, FL, 2001. Computational commutative algebra in statistics

    2001

  25. [33]

    Hilbert series of parallelogram polyominoes

    Ayesha Asloob Qureshi, Giancarlo Rinaldo, and Francesco Romeo. Hilbert series of parallelogram polyominoes. Research in the Mathematical Sciences , 9(2):1--24, 2022

    2022

  26. [34]

    Simple polyominoes are prime

    Ayesha Asloob Qureshi, Takafumi Shibuta, and Akihiro Shikama. Simple polyominoes are prime. J. Commut. Algebra , 9(3):413--422, 2017

    2017

  27. [35]

    Ideals generated by 2-minors, collections of cells and stack polyominoes

    Ayesha Asloob Qureshi. Ideals generated by 2-minors, collections of cells and stack polyominoes. J. Algebra , 357:279--303, 2012

    2012

  28. [36]

    Hilbert series of simple thin polyominoes

    Giancarlo Rinaldo and Francesco Romeo. Hilbert series of simple thin polyominoes. Journal of Algebraic Combinatorics , pages 1--18, 2021

    2021

  29. [37]

    Knutson ideals and determinantal ideals of H ankel matrices

    Lisa Seccia. Knutson ideals and determinantal ideals of H ankel matrices. J. Pure Appl. Algebra , 225(12):Paper No. 106788, 17, 2021

    2021

  30. [38]

    Knutson ideals of generic matrices

    Lisa Seccia. Knutson ideals of generic matrices. Proc. Amer. Math. Soc. , 150(5):1967--1973, 2022

    1967

  31. [39]

    Binomial edge ideals of weakly closed graphs

    Lisa Seccia. Binomial edge ideals of weakly closed graphs. Int. Math. Res. Not. IMRN , (24):22045--22068, 2023

    2023

  32. [40]

    Toric representations of algebras defined by certain nonsimple polyominoes

    Akihiro Shikama. Toric representations of algebras defined by certain nonsimple polyominoes. J. Commut. Algebra , 10(2):265--274, 2018

    2018

  33. [41]

    Ladder determinantal varieties and their symbolic blowups, 2023

    Alessandro De Stefani, Jonathan Montaño, Luis Núñez-Betancourt, Lisa Seccia, and Matteo Varbaro. Ladder determinantal varieties and their symbolic blowups, 2023

    2023

  34. [42]

    Solving systems of polynomial equations , volume 97 of CBMS Regional Conference Series in Mathematics

    Bernd Sturmfels. Solving systems of polynomial equations , volume 97 of CBMS Regional Conference Series in Mathematics . Conference Board of the Mathematical Sciences, Washington, DC; by the American Mathematical Society, Providence, RI, 2002

    2002

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.