Related papers: Ideals of graphs: finding a set of generators

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…

Let S=K[x_1,...,x_n] be a polynomial ring over a field K and I a homogeneous ideal in S generated by a regular sequence f_1,f_2,...,f_k of homogeneous forms of degree d. We study a generalization of a result of Conca, Herzog, Trung, and…

Say that a graph G has property $\mathcal{K}$ if the size of its maximum matching is equal to the order of a minimal vertex cover. We study the following process. Set $N:= \binom{n}{2}$ and let $e_1, e_2, \dots e_{N}$ be a uniformly random…

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…

The purpose of this paper is to develop a homotopical algebra for graphs, relevant to zeta series and spectra of finite graphs. More precisely, we define a Quillen model structure in a category of graphs (directed and possibly infinite,…

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 $S$ be the power series ring or the polynomial ring over a field $K$ in the variables $x_1,\ldots,x_n$, and let $R=S/I$, where $I$ is proper ideal which we assume to be graded if $S$ is the polynomial ring. We give an explicit…

The principal left ideal graph of a semigroup is a simple graph whose vertices are the non-zero elements of the semigroup, and two vertices are adjacent if their principal left ideals intersect non-trivially. In this paper, we study the…

In a polynomial ring $R$ with $n$ variables, for every homogeneous ideal $I$ and for every $p\leq n$ we consider the Koszul homology $H_i(p,R/I)$ with respect to a sequence of $p$ of generic linear forms and define the Koszul-Betti number…

The generating graph $\Gamma(G)$ of a finite group $G$ has vertex set the non-identity elements of $G$, with two elements connected exactly when they generate $G$. A coclique in a graph is an empty induced subgraph, so a coclique in…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…

Let $G$ be a finite simple graph, and let $I(G)$ denote its edge ideal. In this paper, we investigate the asymptotic behavior of the syzygies of powers of edge ideals through the lens of homological shift ideals $\text{HS}_i(I(G)^k)$. We…

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

Let $\Gamma$ be a graph with diameter at least two. Then $\Gamma$ is said to be $1$-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices $x$ and $y$ in $\Gamma$, the distance partition of the vertex set of…

Let $\Gamma$ be a dense countable subgroup of $\mathbb{R}$. Then, consider $IE(\Gamma)$; the group of piecewise linear bijections of $[0,1]$ with finitely many angles, all in $\Gamma$. We introduce and systematically study a family of…

We say that an ideal I is homogeneous, if its restriction to any I-positive subset is isomorphic to I. The paper investigates basic properties of this notion -- we give examples of homogeneous ideals and present some applications to…

For distinct vertices $u,v$ in a graph $G$, let $\kappa_G(u,v)$ denote the maximum number of internally disjoint $u$-$v$ paths in $G$. Then, $\kappa_G(u,v) \leq \min\{ \mbox{deg}_G(u), \mbox{deg}_G(v) \}$. If equality is attained for every…

We consider the isomorphism problem for hypergraphs taking as input two hypergraphs over the same set of vertices $V$ and a permutation group $\Gamma$ over domain $V$, and asking whether there is a permutation $\gamma \in \Gamma$ that…