arXiv subjects

Philippe Gimenez

Publications and source records attributed to Philippe Gimenez.

23 records · Page 2Linked to original sources

arXiv2012

Regularity 3 in edge ideals associated to bipartite graphs

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 graded free resolution where there exists a minimal generator of degree $>i+3$, show that at this step the highest degree of a minimal generator is $i+4$, and determine the value of the corresponding graded Betti number $β_{i,i+4}$ in terms of the combinatorics of the associated bipartite graph. The results can then be easily extended to the non-squarefree case through polarization. We also study a family of ideals of regularity 4 that play an important role in our main result and whose graded Betti numbers can be completely described through closed combinatorial formulas.

math.AC↗

arXiv2011

Minimal Graded Free Resolutions for Monomial Curves Defined by Arithmetic Sequences

Let $\mm=(m_0,...,m_n)$ be an arithmetic sequence, i.e., a sequence of integers $m_0<...<m_n$ with no common factor that minimally generate the numerical semigroup $\sum_{i=0}^{n}m_i\N$ and such that $m_i-m_{i-1}=m_{i+1}-m_i$ for all $i\in\{1,...,n-1\}$. The homogeneous coordinate ring $Γ_\mm$ of the affine monomial curve parametrically defined by $X_0=t^{m_0},...,X_n=t^{m_n}$ is a graded $R$-module where $R$ is the polynomial ring $k[X_0,...,X_n]$ with the grading obtained by setting $°{X_i}:=m_i$. In this paper, we construct an explicit minimal graded free resolution for $Γ_\mm$ and show that its Betti numbers depend only on the value of $m_0$ modulo $n$. As a consequence, we prove a conjecture of Herzog and Srinivasan on the eventual periodicity of the Betti numbers of semigroup rings under translation for the monomial curves defined by an arithmetic sequence.

math.AC↗

arXiv2010

Minimal free resolutions for certain affine monomial curve

Given an arbitrary field k and an arithmetic sequence of positive integers m_0<...<m_n, we consider the affine monomial curve parameterized by X_0=t^{m_0},...,X_n=t^{m_n}. In this paper, we conjecture that the Betti numbers of its coordinate ring are completely determined by n and the value of m_0 modulo n. We first show that the defining ideal of the monomial curve can be written as a sum of two determinantal ideals. Using this fact, we describe the minimal free resolution of the coordinate ring in the following three cases: when m_0 is 1 modulo n (determinantal), when m_0 is n modulo n (almost determinantal), and when m_0 is 2 modulo n and n=4 (Gorenstein of codimension 4).

math.AC↗

arXiv2008

First Nonlinear Syzygies of Ideals Associated to Graphs

Consider an ideal $I\subset K[x_1,..., x_n]$, with $K$ an arbitrary field, generated by monomials of degree two. Assuming that $I$ does not have a linear resolution, we determine the step $s$ of the minimal graded free resolution of $I$ where nonlinear syzygies first appear, we show that at this step of the resolution nonlinear syzygies are concentrated in degree $s+3$, and we compute the corresponding graded Betti number $β_{s,s+3}$. The multidegrees of these nonlinear syzygies are also determined and the corresponding multigraded Betti numbers are shown to be all equal to 1.

math.AC↗

arXiv2008

Polar syzygies in characteristic zero: the monomial case

Given a set of forms f={f_1,...,f_m} in R=k[x_1,...,x_n], where k is a field of characteristic zero, we focus on the first syzygy module Z of the transposed Jacobian module D(f), whose elements are called differential syzygies of f. There is a distinct submodule P of Z coming from the polynomial relations of f through its transposed Jacobian matrix, the elements of which are called polar syzygies of f. We say that f is polarizable if equality P=Z holds. This paper is concerned with the situation where f are monomials of degree 2, in which case one can naturally associate to them a graph G(f) with loops and translate the problem into a combinatorial one. A main result is a complete combinatorial characterization of polarizability in terms of special configurations in this graph. As a consequence, we show that polarizability implies normality of the subalgebra k[f] of R and that the converse holds provided the graph G(f) is free of certain degenerate configurations. One main combinatorial class of polarizability is the class of polymatroidal sets. We also prove that if the edge graph of G(f) has diameter at most 2 then f is polarizable. We establish a curious connection with birationality of rational maps defined by monomial quadrics.

math.AC↗