Waldschmidt constant of monomial ideals and Simis ideals
Bijender, Ajay Kumar
TL;DR
The work investigates lower bounds for the Waldschmidt constant of monomial ideals and the Simis conjecture in a combinatorial setting. By leveraging standard linear weightings and polarization, it reduces questions to squarefree cases and preserves key invariants such as $\rho$ and $\rho_a$, enabling a proof of $\hat{\alpha}(I) \ge \dfrac{\alpha(I) + h - 1}{h}$ for broad classes (Theorem Th-Waldschmidt). It further verifies the Mendez–Pinto–Villarreal conjecture $C_2$ for several classes of monomial ideals via explicit combinatorial criteria, including a height-2 condition and a general whisker-based configuration, establishing equivalences with Simis-ness under certain weightings. The results extend known squarefree cases, providing concrete criteria for identifying Simis ideals and connecting symbolic-power behavior to hypergraph structure.
Abstract
In 2017, Cooper et al. proposed a conjecture providing a lower bound for the Waldschmidt constant of monomial ideals. We confirm this conjecture for some classes of monomial ideals. Recently, Méndez, Pinto, and Villarreal formulated a conjecture stating that if $I$ is a monomial ideal without embedded associated primes, whose irreducible decomposition is minimal and which is a Simis ideal, then there exist a Simis squarefree monomial ideal $J$ and a standard linear weighting $w$ such that $I = J_{w}.$ In this work, we verify this conjecture for some classes of monomial ideals.
