Related papers: Rees algebra and special fiber ring of binomial ed…

Let $(R,\mathfrak{m})$ be a two-dimensional regular local ring with infinite residue class field. Then the Rees algebra $\mathcal{R} (I)= \bigoplus_{n \ge 0}I^n$ of $I$ is an almost Gorenstein graded ring in the sense of…

In this paper we show that the Rees algebra can be made into a functor on modules over a ring in a way that extends its classical definition for ideals. The Rees algebra of a module M may be computed in terms of a "maximal" map f from M to…

We focus in this paper on edge ideals associated to bipartite graphs and give a combinatorial characterization of those having regularity 3. When the regularity is strictly bigger than 3, we determine the first step $i$ in the minimal…

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…

We introduce and study monomial ideals with regular quotients, which can be seen as an extension of monomial ideals with linear quotients. Based on these investigations, we are able to calculate the Betti numbers of toric ideals belonging…

In this article, we characterize the class of complementary edge ideals which satisfy the licci property in terms of the underlying graph. Using this characterization, we associate the licci property of a complementary edge ideal to its…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper we prove that if $G$ is a unicyclic graph then for all $s \geq 1$ the regularity of $I(G)^s$ is exactly $2s+\text{reg}(I(G))-2$. We also…

The authors introduced the notion of $p_g$-ideals for two-dimensional excellent normal local domain over an algebraicaly closed field in terms of resolution of singularities. In this note, we give several ring-theoretic characterization of…

We study the symbolic $F$-splitness of families of binomial edge ideals. We also study the strong $F$-regularity of the symbolic blowup algebras of families of binomial edge ideals. We make use of Fedder-like criteria and combinatorial…

We determine the arithmetical rank of every edge ideal of a Ferrers graph.

We give formulas and effective sharp bounds for the degree of multi-graded rational maps and provide some effective and computable criteria for birationality in terms of their algebraic and geometric properties. We also extend the Jacobian…

Let G be a graph and let I = I(G) be its edge ideal. In this paper, when G is a forest or a cycle, we explicitly compute the regularity of I^s for all s > 0. In particular, for these classes of graphs, we provide the asymptotic linear…

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…

Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…

We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.

The regularity of an edge ideal of a finite simple graph $G$ is at least the induced matching number of $G$ and is at most the minimum matching number of $G$. If $G$ possesses a dominating inuduced matching, i.e., an induced matching which…

We consider a rational map $\phi: \mathbb{P}_k^{m} \dashrightarrow \mathbb{P}_k^n$ that is a parameterization of an $m$-dimensional variety. Our main goal is to study the $(m-1)$-dimensional fibers of $\phi$ in relation to the $m$-th local…

A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…

Let $G$ be a finite graph on $[n]:=\{1, \ldots, n\}$ and $\kappa(G)$ its vertex connectivity. Let $S=K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G^c)$ the edge ideal of the complementary graph…