Related papers: Algebraic invariants of weighted oriented graphs
We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let $G$ be a weighted graph with $n$ vertices. In the most general setting, the $n$ vertices are known and no other information about $G$…
Set $ A := Q/({\bf z}) $, where $ Q $ is a polynomial ring over a field, and $ {\bf z} = z_1,\ldots,z_c $ is a homogeneous $ Q $-regular sequence. Let $ M $ and $ N $ be finitely generated graded $ A $-modules, and $ I $ be a homogeneous…
Ideals in infinite-dimensional polynomial rings that are invariant under the action of the monoid of increasing functions have been extensively studied recently. Of particular interest is the asymptotic behavior of truncations of such an…
We study the topology of the lcm-lattice of edge ideals and derive upper bounds on the Castelnuovo-Mumford regularity of the ideals. In this context it is natural to restrict to the family of graphs with no induced 4-cycle in their…
Let $G$ be a graph and let $I = I(G)$ be its edge ideal. When $G$ is unicyclic, we give a decomposition of symbolic powers of $I$ in terms of its ordinary powers. This allows us to explicitly compute the Waldschmidt constant and the…
Firstly, for a general graph, we find a recursion formula on the number of Hamiltonian cycles and one on cycles. By this result, we give some new polynomial invariants. Secondly, we give a condition to tell whether a polynomial defined by…
Let S be a polynomial algebra over a field. If I is the edge ideal of a perfect semiregular tree, then we give precise formulas for values of depth, Stanley depth, projective dimension, regularity and Krull dimension of S/I.
In this paper we study ideals of points lying on rational normal curves defined in projective plane and projective $ 3 $-space. We give an explicit formula for the value of Castelnuovo-Mumford regularity for their ordinary powers. Moreover,…
In this work, we classify the circuit binomials of any weighted oriented graph $D$ and we explicitly compute the circuit binomials of $D$ in terms of the minors of the incidence matrix of $D$. We show that the circuit binomials of any…
Let $X\subseteq \mathbb{P}^N$ be a non-degenerate normal projective variety of codimension $e$ and degree $d$ with isolated $\mathbb{Q}$-Gorenstein singularities. We prove that the Castelnuovo-Mumford regularity…
Let $I\subseteq R=\kk[x_1,...,x_n]$ be a homogeneous equigenerated ideal of degree $r$. We show here that the shapes of the Betti tables of the ideals $I^d$ stabilize, in the sense that there exists some $D$ such that for all $d\geq D$,…
In this paper, we introduce and generalize some combinatorial invariants of graphs such as matching number and induced matching number to hypergraphs. Then we compare them together and present some upper bounds for the regularity of…
We consider Stanley--Reisner rings $k[x_1,...,x_n]/I(\mc{H})$ where $I(\mc{H})$ is the edge ideal associated to some particular classes of hypergraphs. For instance, we consider hypergraphs that are natural generalizations of graphs that…
Let $D$ be a weighted oriented graph, whose underlying graph is $G$, and let $I(D)$ be its edge ideal. If $G$ has no $3$-, $5$-, or $7$-cycles, or $G$ is K\"{o}nig, we characterize when $I(D)$ is unmixed. If $G$ has no $3$- or $5$-cycles,…
Some recent investigations indicate that for the classification of Cohen-Macaulay binomial edge ideals, it suffices to consider biconnected graphs with some whiskers attached (in short, `block with whiskers'). This paper provides explicit…
Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…
Let $G_\omega$ be an edge-weighted simple graph. In this paper, we give a complete characterization of the graph $G_\omega$ whose edge ideal $I(G_\omega)$ is integrally closed. We also show that if $G_\omega$ is an edge-weighted star graph,…
Let $D$ be a weighted oriented graph and $I(D)$ be its edge ideal. We provide one method to find all the minimal generators of $ I_{\subseteq C} $, where $ C $ is a maximal strong vertex cover of $D$ and $ I_{\subseteq C} $ is the…
Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which…
The unraveled ball of radius $r$ centered at a vertex $v$ in a weighted graph $G$ is the ball of radius $r$ centered at $v$ in the universal cover of $G$. We present a general bound on the maximum spectral radius of unraveled balls of fixed…