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 ; © 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 particular, it yields a new, simple characterization of matroids in terms of the minimal generators of . This is the first characterization of matroids in terms of , and it complements a celebrated theorem by Minh-Trung, Varbaro, and Terai-Trung which requires the investigation of homological properties of for some .

生成讲解博客的中文版本

生成AI智能校验的中文版本