Bar code for monomial ideals (Q1994120): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2900359373 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1701.01781 / rank | |||
Normal rank |
Revision as of 00:31, 19 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bar code for monomial ideals |
scientific article |
Statements
Bar code for monomial ideals (English)
0 references
1 November 2018
0 references
The problem of listing all stable and strongly atble ideals with a fixed Hilbert polynomial is relevant for the study of Hilbert schemes. The present paper aims to count zerodimensional stable and strongly stable ideals in 2 and 3 variables, given their Hilbert polynomial. For this, the author introduces Bar Codes, which provide a connection between zerodimenional (strongly) stable monomial ideals and integer partitions. The main results of the paper are: \begin{itemize} \item[-] In two variables, there is a bijection between (strongly) stable ideals with affine Hilbert polynomial \(p\) and partitions of \(p\) with distinct parts, cf. Proposition 42. \item[-] In three variables, there is a bijection between (strongly) stable ideals and some special plane partitions of their affine Hilbert polynomial \(p\), cf. Theorem 55, Theorem 64. \end{itemize}
0 references
(strongly) stable ideals
0 references
integer partitions
0 references
determinantal formulas
0 references
pommaret basis
0 references