arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.20565math.ACmath.CO
收藏

k-可除与(k-1)-支配理想的极小分解

Minimal Resolutions of $k$-divisible and $(k-1)$-dominant Ideals

Binghamton University(宾汉顿大学);California State University, Chico(奇科加州州立大学)

Patrick Welte, Guillermo Alesandroni

AI总结:

该研究引入k-可除性与d-支配性不变量,证明其与单项式理想投射维数的上下界关系,通过Lyubeznik分解给出d=k-1时的极小分解,证明Alesandroni猜想并刻画可经一次连续消去从Taylor分解得到极小自由分解的单项式理想。

摘要:

我们引入了称为k-可除性和d-支配性的不变量,它们是单项式理想极小生成元上的组合约束。随后证明,k(对应地,d)是k-可除(对应地,d-支配)单项式理想的投射维数的上界(对应地,下界)。这使我们能通过Lyubeznik分解,给出当d=k-1时k-可除、d-支配理想的显式极小分解。该框架让我们得以证明Alesandroni提出的一个猜想。利用这些不变量,我们还刻画了那些极小自由分解可通过对Taylor分解恰好进行一次连续消去得到的单项式理想。此外,我们证明,对于1≤d<k≤q-1范围内的所有q,k,d,都存在具有q个极小生成元的k-可除且d-支配的单项式理想。

英文摘要:

We introduce invariants we call $k$-divisibility and $d$-dominance, which are combinatorial constraints on the minimal generators of monomial ideals. We then prove that $k$ (respectively, $d$) is an upper bound (respectively, lower bound) for the projective dimension of a $k$-divisible (respectively, $d$-dominant) monomial ideal. This leads us to an explicit minimal resolution of $k$-divisible, $d$-dominant ideals when $d=k-1$ via a Lyubeznik resolution. This framework allows us to prove a conjecture made by Alesandroni. Using these invariants, we also provide a characterization of monomial ideals whose minimal free resolution is attainable from the Taylor resolution by performing exactly one consecutive cancellation. We also prove that for all $q,k,d$ in the range $1\leq d<k \leq q-1$, there exist monomial ideals that are $k$-divisible and $d$-dominant with $q$ minimal generators.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑