Related papers: Betti diagrams from graphs

In this paper firstly, we generalize the concept of codismantlable graphs to hypergraphs and show that some special vertex decomposable hypergraphs are codismantlable. Then we generalize the concept of bouquet in graphs to hypergraphs to…

In this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty…

Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…

In this paper, we study a class $\mathcal{C}$ of squarefree monomial ideals $I\subseteq R=\mathbb{K}[x_1,\dots,x_n]$ over a field $\mathbb{K}$, defined by the condition that $\dim R/I$ equals the maximum degree of the minimal generators of…

This paper concerns the study of a class of clutters called simplicial subclutters. Given a clutter $\mathcal{C}$ and its simplicial subclutter $\mathcal{D}$, we compare some algebraic properties and invariants of the ideals $I, J$…

We introduce and survey a Betti form of the geometric Langlands conjecture, parallel to the de Rham form developed by Beilinson-Drinfeld and Arinkin-Gaitsgory, and the Dolbeault form of Donagi-Pantev, and inspired by the work of…

The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…

Inspired by recent work in the theory of central projections onto hypersurfaces, we characterize self-linked perfect ideals of grade 2 as those with a Hilbert--Burch matrix that has a maximal symmetric subblock. We also prove that every…

Each partition $\lambda = (\lambda_1, \lambda_2, ..., \lambda_n)$ determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed Ferrers ideal, is a squarefree monomial ideal that is generated by…

In this paper we study some algebraic properties of hypergraphs, in particula their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge, are not previously considered in the literature.…

We prove a duality theorem for simplicial complexes arising from a combinatorial construction we define, which applies to the squarefree monomial complexes for Veronese ideals of projective spaces and weighted projective spaces. Our theorem…

Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…

In this short note we give an elementary description of the linear part of the minimal free resolution of a Stanley-Reisner ring of a simplicial complex $\Delta$. Indeed, the differentials in the linear part are simply a compilation of…

We prove that the complement of any affine 2-arrangement in R^d is minimal, that is, it is homotopy equivalent to a cell complex with as many i-cells as its i-th rational Betti number. For the proof, we provide a Lefschetz-type hyperplane…

For a module-finite algebra over a commutative noetherian ring, we give a complete description of flat cotorsion modules in terms of prime ideals of the algebra, as a generalization of Enochs' result for a commutative noetherian ring. As a…

Let $\operatorname{pd}(I(G))$ and $\operatorname{reg}(I(G))$ respectively denote the projective dimension and the regularity of the edge ideal $I(G)$ of a graph $G$. For any positive integer $n$, we determine all pairs…

Let $S_n$ be a polynomial ring with $n$ variables over a field and $\{I_n\}_{n \geq 1}$ a chain of ideals such that each $I_n$ is a monomial ideal of $S_n$ fixed by permutations of the variables. In this paper, we present a way to determine…

Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $I$ be a monomial ideal of $R$. In this paper, we present an explicit formula for the Betti numbers of almost complete intersection monomial ideals,…

We introduce polytopal cell complexes associated with partial acyclic orientations of a simple graph, which generalize acyclic orientations. Using the theory of cellular resolutions, two of these polytopal cell complexes are observed to…

We explore some connections between association schemes and the analyses of the semidefinite programming (SDP) based convex relaxations of combinatorial optimization problems in the Lov\'{a}sz--Schrijver lift-and-project hierarchy. Our…