Related papers: Restricted Chip-Firing: Toric Toppling Ideals, Pic…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

In this paper we study some variants of Dirac-type problems in hypergraphs. First, we show that for $k\ge 3$, if $H$ is a $k$-graph on $n\in k\mathbb N$ vertices with independence number at most $n/p$ and minimum codegree at least…

We explicitly describe cellular minimal free resolutions of certain classes of edge ideals of weighted complete bipartite graphs based on a construction of Visscher. Specifically, we show that Visscher's construction minimally resolves all…

Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…

The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. In this article we provide a set of minimal forbidden graphs for the set of graphs with at most three trivial critical…

The toric ring together with the toric ideal arising from a nested configuration is studied, with particular attention given to the algebraic study of normality of the toric ring as well as the Gr\"obner bases of the toric ideal. One of the…

We study a family of monomial ideals, called block diagonal matching field ideals, which arise as monomial Gr\"obner degenerations of determinantal ideals. Our focus is on the minimal free resolutions of these ideals and all of their…

Let $R$ be a finite commutative ring with identity, and let $P$ be a proper prime ideal of $R$. The prime ideal graph $\Gamma_P(R)$ has vertex set of $R\setminus\{0\}$, where two distinct vertices $x$ and $y$ are adjacent if and only if…

In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…

We study rank-three matroids, known as point-line configurations, and their associated matroid varieties, defined as the Zariski closures of their realization spaces. Our focus is on determining finite generating sets of defining equations…

In this article, we provide three formulas allowing to compute the minimum amount of initial chips leading to an infinite Chip-firing game. These formulas hold for strongly connected directed loop-free multigraphs and generalize what was…

We further develop the theory of $W\!$-graph ideals, first introduced by the authors in reference [6]. We discuss $W\!$-graph subideals, and induction and restriction of $W\!$-graph ideals for parabolic subgroups. We introduce $W\!$-graph…

The Total Coloring Conjecture (TCC) for planar graphs with a maximum degree of six remains open. Previous studies suggest that TCC is valid for such graphs if they do not contain any subgraph isomorphic to a 4-fan. In this paper, we present…

With a simple graph $G$ on $[n]$, we associate a binomial ideal $P_G$ generated by diagonal minors of an $n \times n$ matrix $X=(x_{ij})$ of variables. We show that for any graph $G$, $P_G$ is a prime complete intersection ideal and…

Let $X$ be a complete simplicial toric variety over a finite field $\mathbb{F}_q$ with homogeneous coordinate ring $S=\mathbb{F}_q[x_1,\dots,x_r]$ and split torus $T_X\cong (\mathbb{F}^*_q)^n$. We prove that vanishing ideal of a subset $Y$…

Let $G$ be a connected graph and let $I(G)$ denote its edge ideal. We classify when $I(G)^n$, for $n \ge 1$, admits a minimal Lyubeznik resolution. We also give a characterization for when $I(G)^n$ is bridge-friendly, which, in turn,…

The cop throttling number $th_c(G)$ of a graph $G$ for the game of Cops and Robbers is the minimum of $k + capt_k(G)$, where $k$ is the number of cops and $capt_k(G)$ is the minimum number of rounds needed for $k$ cops to capture the robber…

Given a family $F$ of subsets of a group $G$ we describe the structure of its thin-completion $\tau^*(F)$, which is the smallest thin-complete family that contains $I$. A family $F$ of subsets of $G$ is called thin-complete if each $F$-thin…

We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…

We investigate the ideal structures of the C^*-algebras arising from topological graphs. We give the complete description of ideals of such C^*-algebras which are invariant under the so-called gauge action, and give the condition on…