Related papers: First Nonlinear Syzygies of Ideals Associated to G…

Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…

We compute the multigraded Betti numbers of edge ideals for weighted oriented crown graphs using a novel approach. This approach, which we still call the \emph{induced subgraph approach}, originates from our prior work on computing Betti…

Let $\mathbb{K}$ be a field and $I$ be a square-free monomial ideal in the polynomial ring $\mathbb{K}[x_1, \ldots, x_n]$. The Green-Lazarsfeld index, $\mathrm{index}(I)$, counts the number of steps to reach to a syzygy minimally generated…

We study the asymptotic non-vanishing of syzygies for products of projective spaces. Generalizing the monomial methods of Ein, Erman, and Lazarsfeld \cite{einErmanLazarsfeld16} we give an explicit range in which the graded Betti numbers of…

In this thesis we give a complete description of the syzygies of irreducible, nonsingular, canoncial curves $C$ of genus 9. This includes a collection of all possible Betti tables for $C$. Moreover a direct correspondence between these…

Constructions are given of Noetherian maximal orders that are finitely presented algebras over a field K, defined by monomial relations. In order to do this, it is shown that the underlying homogeneous information determines the algebraic…

We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…

We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…

In this note we provide a counter-example to a conjecture of K. Pardue [Thesis, Brandeis University, 1994.], which asserts that if a monomial ideal is $p$-Borel-fixed, then its $\naturals$-graded Betti table, after passing to any field does…

Herzog and Srinivasan have conjectured that for any homogeneous k-algebra, the degree is bounded above by a function of the maximal degrees of the syzygies. Combining the syzygy quadrangle decomposition of Peeva and Sturmfels and a delicate…

We compute one of the distinguished extremal Betti number of the binomial edge ideal of a block graph, and classify all block graphs admitting precisely one extremal Betti number.

We compute the Betti numbers of the resolution of a special class of square-free monomial ideals, the ideals of mixed products. Moreover when these ideals are Cohen-Macaulay we calculate their type.

Let $I$ be an ideal generated by quadrics in a standard graded polynomial ring $S$ over a field. A question of Avramov, Conca, and Iyengar asks whether the Betti numbers of $R = S/I$ over $S$ can be bounded above by binomial coefficients on…

Let $k$ be a field of odd characteristic $p$. Fix an even number $d<p+1$ and a power $q\geq d+3$ of $p$. For most choices of degree $d$ standard graded hypersurfaces $R=k[x,y,z]/(f)$ with homogeneous maximal ideal $\mathfrak{m}$, we can…

Let $X_1,X_2,...$ be an infinite sequence of i.i.d. random vectors distributed exponentially with parameter $\lam .$ For each $y$ and $n\geq 1,$ form a graph $G_n(y)$ with vertex set $V_n = \{X_1,...,X_n\},$ two vertices are connected if…

In random graph models, the degree distribution of an individual node should be distinguished from the (empirical) degree distribution of the graph that records the fractions of nodes with given degree. We introduce a general framework to…

The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We present a polynomial-time solution in a subclass of subcubic graphs generalizing several previously known…

In this article bipartite planar graphs St_r are investigated, r the number of their plane regions. Bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to such graphs are discussed. We prove that…

Let $G$ be a chordal graph and $I(G)$ its edge ideal. Let $\beta (I(G)) = (\beta_0, \beta_1, ..., \beta_p)$ denote the Betti sequence of $I(G)$, where $\beta_i$ stands for the $i$th total Betti number of $I(G)$ and where $p$ is the…

We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…