Related papers: Divisors on graphs, Connected flags, and Syzygies
Well ordered covers of square-free monomial ideals are subsets of the minimal generating set ordered in a certain way that give rise to a Lyubeznik resolution for the ideal, and have guaranteed nonvanishing Betti numbers in certain degrees.…
In this paper, we study the basic problem of counting independent sets in a graph and, in particular, the problem of counting antichains in a finite poset, from an algebraic perspective. We show that neither independence polynomials of…
For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…
We study the ideals of the partition, Brauer, and Jones monoid, establishing various combinatorial results on generating sets and idempotent generating sets via an analysis of their Graham--Houghton graphs. We show that each proper ideal of…
This work examines the problem of graph learning over a diffusion network when data can be collected from a limited portion of the network (partial observability). The main question is to establish technical guarantees of consistent…
The main results of this paper are accessible with only basic linear algebra. Given an increasing sequence of dimensions, a flag in a vector space is an increasing sequence of subspaces with those dimensions. The set of all such flags (the…
We find strong relationships between the zero-divisor graphs of apparently disparate kinds of nilpotent-free semigroups by introducing the notion of an \emph{Armendariz map} between such semigroups, which preserves many graph-theoretic…
Let $I \subseteq R = \mathbb{K}[x_1,\ldots,x_n]$ be a toric ideal, i.e., a binomial prime ideal. We investigate when the ideal $I$ can be "split" into the sum of two smaller toric ideals. For a general toric ideal $I$, we give a sufficient…
A major line of research is discovering Ramsey-type theorems, which are results of the following form: given a graph parameter $\rho$, every graph $G$ with sufficiently large $\rho(G)$ contains a `well-structured' induced subgraph $H$ with…
Characterisations of interval graphs, comparability graphs, co-comparability graphs, permutation graphs, and split graphs in terms of linear orderings of the vertex set are presented. As an application, it is proved that interval graphs,…
A determinantal facet ideal (DFI) is an ideal $J_\Delta$ generated by maximal minors of a generic matrix parametrized by an associated simplicial complex $\Delta$. In this paper, we construct an explicit linear strand for the initial ideal…
Let $J_G$ denote the binomial edge ideal of a connected undirected graph on $n$ vertices. This is the ideal generated by the binomials $x_iy_j - x_jy_i, 1\leq i < j \leq n,$ in the polynomial ring $S= K[x_1,...,x_n,y_1,...,y_n]$ where…
Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…
Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…
The distance ideals of graphs are algebraic invariants that generalize the Smith normal form (SNF) and the spectrum of several distance matrices associated with a graph. In general, distance ideals are not monotone under taking induced…
Let P = k[x_1, ..., x_n] be the polynomial ring in n variables. A homogeneous ideal I of P generated in degree d is called Gotzmann if it has the smallest possible Hilbert function out of all homogeneous ideals with the same dimension in…
We study algebraic and homological properties of the ideal of submaximal minors of a sparse generic symmetric matrix. This ideal is generated by all $(n-1)$-minors of a symmetric $n \times n$ matrix whose entries in the upper triangle are…
We compute the graded Betti numbers for the toric ideal of a family of graphs constructed by adjoining a cycle to a complete bipartite graph. The key observation is that this family admits an initial ideal which has linear quotients. As a…
Divisorial gonality and stable divisorial gonality are graph parameters, which have an origin in algebraic geometry. Divisorial gonality of a connected graph $G$ can be defined with help of a chip firing game on $G$. The stable divisorial…
The problem of determining the maximum number of maximal independent sets in certain graph classes dates back to a paper of Miller and Muller and a question of Erd\H{o}s and Moser from the 1960s. The minimum was always considered to be less…