Related papers: F-Purity of Binomial Edge Ideals

Petersen's seminal work in 1891 asserts that the edge-set of a cubic graph can be covered by distinct perfect matchings if and only if it is bridgeless. Actually, it is known that for a very large fraction of bridgeless cubic graphs, every…

This paper presents three results on F-singularities. First, we give a new proof of Eisenstein's restriction theorem for adjoint ideal sheaves, using the theory of F-singularities. Second, we show that a conjecture of Musta\c{t}\u{a} and…

Let $\mathbb{K}$ be a field and $R = \mathbb{K}[x_1, \ldots, x_n]$. We obtain an improved upper bound for asymptotic resurgence of squarefree monomial ideals in $R$. We study the effect on the resurgence when sum, product and intersection…

For a normal F-finite variety $X$ and a boundary divisor $\Delta$ we give a uniform description of an ideal which in characteristic zero yields the multiplier ideal, and in positive characteristic the test ideal of the pair $(X,\Delta)$.…

A graph property is said to be elusive ( evasive) if every algorithm testing this property by asking questions of the form "is there an edge between vertices x and y" requires, in the worst case, to ask about all pairs of vertices. The…

In this paper we introduce the concept of clique disjoint edge sets in graphs. Then, for a graph $G$, we define the invariant $\eta(G)$ as the maximum size of a clique disjoint edge set in $G$. We show that the regularity of the binomial…

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

We study powers of binomial edge ideals associated with closed and block graphs.

The F-thresholds are characteristic p analogs of the jumping coefficients for multiplier ideals in characteristic zero. In this article we give an alternative description of the F-thresholds of an ideal in a regular and F--finite ring $R$.…

Introduced by Takagi and Watanabe, the F-pure threshold is an invariant defined in terms of the Frobenius homomorphism. While it finds applications in various settings, it is primarily used as a local invariant. The purpose of this note is…

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

Let $ir(G)$ and $\gamma(G)$ be the irredundance number and the domination number of a graph $G$, respectively. A graph $G$ is called irredundance perfect if $ir(H)=\gamma(H)$ for every induced subgraph $H$ of $G$. The subclass of $P_6$-free…

Let $I(G)$ be the edge ideal of a simple graph $G$. We prove that $I(G)^2$ has a linear free resolution if and only if $G$ is gap-free and reg$I(G) \le 3$. Similarly, we show that $I(G)^3$ has a linear free resolution if and only if $G$ is…

We introduce a new class of algebras arising from graphs, called binomial edge rings. Given a graph $G$ on $d$ vertices with $n$ edges, the binomial edge ring of $G$ is defined to be the subalgebra of the polynomial ring with $2d$ variables…

A simple graph G is said to be well-f-covered, whenever any two maximal induced forest in G be of the same order. In this note, well-f-coveredness of lexicographic product of two graphs in case where the first component is empty, is…

We study the extremal problem that relates the spectral radius $\lambda (G)$ of an $F$-free graph $G$ with its number of edges. Firstly, we prove that for any graph $F$ with chromatic number $\chi (F)=r+1\ge 3$, if $G$ is an $F$-free graph…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph $F \in \mathcal{F}$. Many graph isomorphism relaxations such as (quantum) isomorphism…

We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…

In this paper, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals. Moreover, we prove that this special…

Some recent investigations indicate that for the classification of Cohen-Macaulay binomial edge ideals, it suffices to consider biconnected graphs with some whiskers attached (in short, `block with whiskers'). This paper provides explicit…