Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/5170
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Chanchal-
dc.contributor.authorRoy, Amit-
dc.date.accessioned2023-08-25T10:32:27Z-
dc.date.available2023-08-25T10:32:27Z-
dc.date.issued2021-
dc.identifier.citationProceedings - Mathematical Sciences, 131(2).en_US
dc.identifier.urihttps://doi.org/10.1007/s12044-021-00628-5-
dc.identifier.urihttp://hdl.handle.net/123456789/5170-
dc.descriptionOnly IISER Mohali authors are available in the record.en_US
dc.description.abstractLet Sn be the set of all permutations of [n]={1,…,n} and let W be the subset consisting of permutations σ∈Sn avoiding 132 and 312-patterns. The monomial ideal IW=⟨xσ=∏ni=1xσ(i)i:σ∈W⟩ in the polynomial ring R=k[x1,…,xn] over a field k is called a hypercubic ideal in Kumar and Kumar (Proc. Indian Acad. Sci. (Math Sci.) 126(4) (2016) 479–500). The Alexander dual I[n]W of IW with respect to n=(n,…,n) has the minimal cellular resolution supported on the first barycentric subdivision Bd(Δn−1) of an n−1-simplex Δn−1. We show that the number of standard monomials of the Artinian quotient RI[n]W equals the number of rooted-labelled unimodal forests on the vertex set [n]. In other words, dimk(RI[n]W)=∑r=1nr! s(n,r)=Per([mij]n×n), where s(n, r) is the (signless) Stirling number of the first kind and Per([mij]n×n) is the permanent of the matrix [mij] with mii=i and mij=1 for i≠j. For various subsets S of Sn consisting of permutations avoiding patterns, the corresponding integer sequences {dimk(RI[n]S)}∞n=1 are identified.en_US
dc.language.isoen_USen_US
dc.publisherSpringer Linken_US
dc.subjectIntegeren_US
dc.subjectsequencesen_US
dc.subjectmonomialen_US
dc.subjectidealsen_US
dc.titleInteger sequences and monomial idealsen_US
dc.typeArticleen_US
Appears in Collections:Research Articles

Files in This Item:
File Description SizeFormat 
Need to add pdf (1).odtOnly IISER Mohali authors are available in the record.8.63 kBOpenDocument TextView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.