The Structure of Symbolic Powers of Matroids
Paolo Mantero, Vinh Nguyen

TL;DR
This paper characterizes the structure of symbolic powers of matroid ideals, introduces a new algorithm for computing large symbolic powers, and offers novel algebraic characterizations of matroids based on minimal generators.
Contribution
It provides a minimal generating set for symbolic powers of matroid ideals, describes their symbolic Rees algebra, and introduces a new matroid characterization via minimal generators of the second symbolic power.
Findings
A structure theorem for symbolic powers of matroid ideals.
An explicit formula for the maximal degree of algebra generators.
A new characterization of matroids using minimal generators of I^{(2)}.
Abstract
We describe the structure of the symbolic powers of the Stanley-Reisner ideals, and cover ideals, , of matroids. We (a) prove a structure theorem describing a minimal generating set for every ; (b) describe the (non--standard graded) symbolic Rees algebra of and show its minimal algebra generators have degree at most ht ; (c) provide an explicit, simple formula to compute the largest degree of a minimal algebra generator of ; (d) provide algebraic applications, including formulas for the symbolic defects of , the initial degree of , and the Waldschmidt constant of ; (e) provide a new algorithm allowing fast computations of very large symbolic powers of . One of the by-products is a new characterization of matroids in terms of minimal generators of for some . In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic
