Related papers: Castelnuovo-Mumford regularity of graphs
We study three invariants of geometrically vertex decomposable ideals: the Castelnuovo-Mumford regularity, the multiplicity, and the $a$-invariant. We show that these invariants can be computed recursively using the ideals that appear in…
We give a bound on the Castelnuovo-Mumford regularity of a homogeneous ideals I, in a polynomial ring A, in terms of number of variables and the degrees of generators, when the dimension of A/I is at most two. This bound improves the one…
Substantial changes in many parts of the paper. In particular, significantly expanded treatment of monomial ideals and of Castelnuovo-Mumford regularity. Also relation between delta-regularity and Noether normalisation now treated.
We introduce a new class of monomial ideals, called strong Borel type ideals, and we compute the Mumford-Castelnouvo regularity for principal strong Borel type ideals. Also, we describe the d-fixed ideals generated by powers of variables…
Let $R(G)$ be the graph obtained from $G$ by adding a new vertex corresponding to each edge of $G$ and by joining each new vertex to the end vertices of the corresponding edge. Let $RT(G)$ be the graph obtained from $R(G)$ by adding a new…
We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…
We define a new way to evaluate MOY graphs. We prove that this new evaluation coincides with the classical evaluation by checking some skein relations. As a consequence, we prove a formula which relates the $\mathfrak{sl}_N$ and…
This is a short expository account of the regularity lemma for stable graphs proved by the authors, with some comments on the model theoretic context, written for a general logical audience.
We define the Eulerian ideal of a $k$-uniform hypergraph and study its degree and Castelnuovo--Mumford regularity. The main tool is a Gr\"obner basis of the ideal obtained combinatorially from the hypergraph. We define the notion of parity…
A new complete invariant for acyclic graphs is presented
The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
We combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…
Castelnuovo-Mumford regularity is an important invariant of projective algebraic varieties. A well known conjecture due to Eisenbud and Goto gives a bound for regularity in terms of the codimension and degree,i.e., Castelnuovo-Mumford…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
We study the Castelnuovo-Mumford regularity of powers of edge ideals. We prove that if G is a bipartite graph, then reg(I(G)^s) \leq 2s + reg I(G) - 2 for all s \geq 2, which is the best possible upper bound for any s. Suspension plays a…
In this paper we study and relate several invariants connected to the solving degree of a polynomial system. This provides a rigorous framework for estimating the complexity of solving a system of polynomial equations via Groebner bases…
When M is a finitely generated graded module over a standard graded algebra S and I is an ideal of S, it is known from work of Cutkosky, Herzog, Kodiyalam, R\"omer, Trung and Wang that the Castelnuovo-Mumford regularity of I^mM has the form…
We give a brief survey of some known results on intrinsically linked or knotted graphs.
By using an approach of the invariant theory we obtain a new formula for the ordinary generating function of the numbers of the simple graphs with $n$ nodes.