Related papers: A special case of Postnikov-Shapiro conjecture

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

Let $G$ be a finite simple graph on the vertex set $[n] = \{ 1, \ldots, n \}$ and $K[X, Y] = K[x_1, \ldots, x_n, y_1, \ldots, y_n]$ the polynomial ring in $2n$ variables over a field $K$ with each $\mathrm{deg} x_i = \mathrm{deg} y_j = 1$.…

Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).

Let $H = \langle n_1, n_2, n_3\rangle$ be a numerical semigroup. Let $\tilde H$ be the interval completion of $H$, namely the semigroup generated by the interval $\langle n_1, n_1+1, \ldots, n_3\rangle$. Let $K$ be a field and $K[H]$ the…

In this note, we study Betti splittings of cover ideals of bipartite graphs. We prove that if $J \subset \Bbbk [x_1,\dots,x_n]$ is the cover ideal of a bipartite graph then the $x_i$-partition of $J$ is a Betti splitting for any $i$. We…

In this paper, we show that general homogeneous manifolds $G/P$ satisfy Conjecture $\mathcal{O}$ of Galkin, Golyshev and Iritani which `underlies' Gamma conjectures I and II of them. Our main tools are the quantum Chevalley formula for…

A combinatorial property that characterizes Cohen-Macaulay binomial edge ideals has long been elusive. A recent conjecture ties the Cohen-Macaulayness of a binomial edge ideal $J_G$ to special disconnecting sets of vertices of its…

Bollob\'as and Nikiforov conjectured that for any graph $G \neq K_n$ with $m$ edges \[ \lambda_1^2+\lambda_2^2\le \bigg( 1-\frac{1}{\omega(G)}\bigg)2m\] where $\lambda_1$ and $\lambda_2$ denote the two largest eigenvalues of the adjacency…

Given a finite simple graph one can associate the edge ideal. In this paper we prove that a graded Betti number of the edge ideal does not vanish if the original graph contains a set of complete bipartite subgraphs with some conditions.…

Let $K$ be a field of characteristic zero, let $I \subset S = K[x_1,\dots,x_n]$ be a homogeneous ideal, and let $\partial(I)$ be its gradient ideal. We study the relationship between $\mathrm{reg}\,I$ and $\mathrm{reg}\,\partial(I)$. While…

Let $G$ be a finite simple graph and let $I_G$ denote its associated toric ideal in the polynomial ring $R$. For each integer $n\geq 2$, we completely determine all the possible values for the tuple $({\rm reg}(R/I_G), {\rm…

When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild…

In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…

Let $G$ be a simple graph with binomial edge ideal $J_G$. We prove how to calculate the multidegree of $J_G$ based on combinatorial properties of $G$. In particular, we study the set $S_{\min}(G)$ defined as the collection of subsets of…

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…

The emergence of Boij-S\"oderberg theory has given rise to new connections between combinatorics and commutative algebra. Herzog, Sharifan, and Varbaro recently showed that every Betti diagram of an ideal with a k-linear minimal resolution…

Let $G$ be a simple graph on $d$ vertices. We define a monomial ideal $K$ in the Stanley-Reisner ring $A$ of the order complex of the Boolean algebra on $d$ atoms. The monomials in $K$ are in one-to-one correspondence with the proper…

We prove two conjectures in spectral extremal graph theory involving the linear combinations of graph eigenvalues. Let $\lambda_1(G)$ be the largest eigenvalue of the adjacency matrix of a graph $G$, and $\bar{G}$ be the complement of $G$.…

Let $G$ be a finite simple connected graph on $[n]$ and $R = K[x_1, \ldots, x_n]$ the polynomial ring in $n$ variables over a field $K$. The edge ideal of $G$ is the ideal $I(G)$ of $R$ which is generated by those monomials $x_ix_j$ for…

Let $X=(x_{ij})$ and $Y=(y_{ij})$ be generic $n$ by $n$ matrices and $Z=XY-YX$. Let $S=k[x_{11},...,x_{nn},y_{11},...,y_{nn}]$, where $k$ is a field, let $I$ be the ideal generated by the entries of $Z$ and let $R=S/I$. We give a conjecture…