Membership criteria and containments of powers of monomial ideals
type: Item
instance of: scholarly article
title: Membership criteria and containments of powers of monomial ideals
zbMATH Open document ID: 1464.13024
author: Trung Ngo Viet
author: Huy Tài Hà
published in: Acta Mathematica Vietnamica
publication date: 2019-06-28T00:00:00Z
full work available at URL: https://arxiv.org/abs/1808.05899
review text: The difference between an ordinary and symbolic power of a homogeneous ideal in a polynomial ring is an important and challenging problem underlying many projects in commutative algebra and algebraic geometry. When restricting to monomial ideals, insight has been gained by exploiting techniques from combinatorics and graph theory. Recall that, by \textit{J. Herzog} et al. [Adv. Math. 210, No. 1, 304--322 (2007; Zbl 1112.13006)], if \(I\) is a monomial ideal in \(R = K[x_1, \ldots, x_n]\) with \(K\) a field, then the \textbf{\(k\)th symbolic power} of \(I\) is \[I^{(k)} = \bigcap_{P \in \mathrm{Min}(I)} I^k_P.\] Also, we let \(\overline{I^k}\) denote the integral closure of the ordinary power \(I^k\). In this paper, the authors use combinatorial optimization to connect ordinary powers of \(I\), symbolic powers of \(I\), and integral closures of \(I\) with certain matching numbers, covering numbers and their fractional versions. Four optimal values of programming problems are considered as follows. Let \(x^{\mathbf{a_1}}, \ldots, x^{\mathbf{a_m}}\) be the minimal monomial generators of \(I\) and \(M\) be the matrix whose \(i\)th column is \(\mathbf{a_i}\) be the ``exponent matrix'' of \(I\). We have \begin{align*} \nu_{\mathbf a}(I) & = \nu_{\mathbf a}(M) = \max \{ \mathbf{1}^m \cdot \mathbf{ y} \mid \mathbf{y} \in \mathbb N^m, M \cdot\mathbf{y} \leq \mathbf{ a} \} \\ \nu_{\mathbf a}^*(I) & = \nu_{\mathbf a}^*(M) = \max \{\mathbf{1}^m \cdot \mathbf{y} \mid \mathbf{y} \in \mathbb R_{\geq 0}^m, M \cdot \mathbf{y} \leq\mathbf{a} \} \\ \tau_{\mathbf a}(I) & = \tau_{\mathbf a}(M) = \min \{\mathbf{a} \cdot\mathbf{z} \mid\mathbf{ z} \in \mathbb N^n, M^T \cdot\mathbf{z} \geq\mathbf{1}^m \} \\ \tau_{\mathbf a}^*(I) & = \tau_{\mathbf a}^*(M) = \min \{\mathbf{a} \cdot \mathbf{z} \mid\mathbf{z} \in \mathbb R_{\geq 0}^n, M^T \cdot\mathbf{z} \geq\mathbf{1}^m \}. \end{align*} The authors show that these optimal values can be used to gain information about \(I^k, \overline{I^k}\), an…
reviewed by: Susan Marie Cooper
Mathematics Subject Classification ID: 13P10
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 13F55
Mathematics Subject Classification ID: 13C05
Mathematics Subject Classification ID: 13F20
Mathematics Subject Classification ID: 13P25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7075128
zbMATH Keywords: monomial ideal
zbMATH Keywords: ordinary power
zbMATH Keywords: symbolic power
zbMATH Keywords: integral closure of a power
zbMATH Keywords: hypergraph
zbMATH Keywords: matching
zbMATH Keywords: covering
zbMATH Keywords: gap estimate
zbMATH Keywords: edge ideal
zbMATH Keywords: containments between powers of ideals
zbMATH Keywords: generating degree
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2886172963
cites work: A primer on Seshadri constants
cites work: Integer Rounding for Polymatroid and Branching Optimization Problems
cites work: Finite checkability for integer rounding properties in combinatorial programming problems
cites work: The Waldschmidt constant for squarefree monomial ideals
cites work: Comparing powers and symbolic powers of ideals
cites work: Symbolic Powers of Monomial Ideals
cites work: Symbolic powers of ideals
cites work: Asymptotic resurgence via integral closures
cites work: Q4871755
cites work: Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals
cites work: Uniform bounds and symbolic powers on smooth varieties
cites work: Powers of Square-Free Monomial Ideals and Combinatorics
cites work: Maximum degree and fractional matchings in uniform hypergraphs
cites work: On the fractional matching polytope of a hypergraph
cites work: A note on Rees algebras and the MFMC property
cites work: Symbolic powers of monomial ideals and vertex cover algebras
cites work: Standard graded vertex cover algebras, cycles and leaves
cites work: Comparison of symbolic and ordinary powers of ideals.
cites work: Uniform bounds in noetherian rings
cites work: Jacobian ideals and a theorem of Briancon-Skoda
cites work: Pseudo-rational local rings and a theorem of Briancon-Skoda about integral closures of ideals
cites work: Q4180391
cites work: On the ratio of optimal integral and fractional covers
cites work: Perfectoid multiplier/test ideals in regular rings and bounds on symbolic powers
cites work: Twin Vertices in Hypergraphs
cites work: Q4897434
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Integral closures of monomial ideals and Fulkersonian hypergraphs
Wikidata QID: Q128411872
DOI: 10.1007/S40306-018-00325-Y
Recommended article: An elementary approach to containment relations between symbolic and ordinary powers of certain monomial ideals
Recommended article: Symbolic Powers of Monomial Ideals
Recommended article: Comparing powers and symbolic powers of ideals
Recommended article: Powers of Square-Free Monomial Ideals and Combinatorics
Recommended article: Powers of Monomial Ideals and Combinatorics
description: scientific article; zbMATH DE number 7075128