pith. sign in

arxiv: 1909.07175 · v1 · pith:Q7MUY3ELnew · submitted 2019-09-16 · 🧮 math.AC

On quasi-equigenerated and Freiman cover ideals of graphs

classification 🧮 math.AC
keywords freimanidealscovergeneratorsgraphsidealminimalnumber
0
0 comments X
read the original abstract

A quasi-equigenerated monomial ideal $I$ in the polynomial ring $R= k[x_1, \ldots, x_n]$ is a Freiman ideal if $\mu(I^2) = l(I)\mu(I)- \binom{l(I)}{2}$ where $l(I)$ is the analytic spread of $I$ and $\mu(I)$ is the number of minimal generators of $I$. Freiman ideals are special since there exists an exact formula computing the minimal number of generators of any of their powers. In this work we address the question of characterizing which cover ideals of simple graphs are Freiman.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.