Bar code for monomial ideals

被引：9
|
作者：
Ceria, Michela [1 ,2 ]
机构：
[1] Univ Trento, Dept Math, Via Sommarive 14, I-38123 Trento, Italy
[2] Univ Milan, Dept Comp Sci, Via Comelico 39, Milan, Italy
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 2019年 / 91卷
关键词：
(Strongly) stable ideals; Integer partitions; Determinantal formulas; Pommaret basis; GENERATING-FUNCTIONS; CANONICAL FORM; STABLE IDEALS; BETTI NUMBERS; HILBERT; SCHEMES;
D O I：
10.1016/j.jsc.2018.06.012
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The aim of this paper is to count 0-dimensional stable and strongly stable ideals in 2 and 3 variables, given their (constant) affine Hilbert polynomial p, by means of a bijection between these ideals and some integer partitions of p, which can be counted via determinantal formulas. This will be achieved by the Bar Code, a bidimensional diagram that allows to represent any finite set of terms M and desume many properties of the corresponding monomial ideal I, if M is an order ideal. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码：30 / 56
页数：27
相关论文
共 50 条
12345