Diagonal F-threshold of binomial edge ideals
Giancarlo Rinaldo, Francesco Romeo
Abstract
We compute the diagonal F-threshold of binomial edge ideals associated to graphs in the case of cycles, cycles with whiskers, bipartite graphs, and block graphs. Moreover, we provide general bounds for any graph.
Create a lesson
Related papers
Thresholds of singularities in characteristic zero
Sandra Rodríguez-Villalobos, Karl Schwede
Truncations of the ring of number-theoretic functions, revisited
Jan Snellman
The arithmetic rank of nullcones of classical invariant rings
Manav Batavia, Aryaman Maithani, Kesavan Mohana Sundaram
Weakly Newton-nondegenerate binomial ideals
Takayuki Hibi, Vinh Anh Pham
Homological dimensions of derived Hom complexes
Lars Winther Christensen, Andrew J. Soto Levins
On the existence of the maximal ideal in the set of associated primes of monomial ideals
M. Cimpoeaş, M. Nasernejad, A. A. Qureshi