中文
相关论文

相关论文: Algebraic properties of product of graphs

200 篇论文

We prove that the projective dimension of any (hyper)graph can be bounded from above by the (Castelnuovo-Mumford) regularity of its Levi graph (or incidence bipartite graph). This in particular brings the use of regularity's upper bounds on…

组合数学 · 数学 2016-05-11 Türker Bıyıkoğlu , Yusuf Civan

Let $G$ be a simple graph on $n$ vertices, and let $J_G$ denotes the corresponding binomial edge ideal in $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$, where $\mathbb{K}$ is a field. We show that if a vertex satisfies a certain degree…

交换代数 · 数学 2025-12-03 Kanoy Kumar Das , Rajiv Kumar , Paramhans Kushwaha

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…

交换代数 · 数学 2024-12-16 Joseph Brennan , Susan Morey

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…

交换代数 · 数学 2020-03-17 Giuseppe Favacchio , Graham Keiper , Adam Van Tuyl

Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal…

交换代数 · 数学 2016-05-24 Jennifer Biermann , Augustine O'Keefe , Adam Van Tuyl

We prove that for every integer $k\geq 1$, there exists a connected graph $H_k$ such that $v(H_k)=reg(H_k)+k$, where $v(G)$ and $reg(G)$ denote the $v$-number and the (Castelnuovo-Mumford) regularity of a graph $G$ respectively.

组合数学 · 数学 2022-04-22 Yusuf Civan

Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R = K[x_1,\ldots,x_n]$. We initiate a study of…

组合数学 · 数学 2020-03-18 Takayuki Hibi , Kyouko Kimura , Kazunori Matsuda , Adam Van Tuyl

Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…

代数拓扑 · 数学 2012-06-13 Peter Bubenik , Leah H. Gold

Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…

交换代数 · 数学 2020-08-04 Arvind Kumar , Rajiv Kumar , Rajib Sarkar

The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…

交换代数 · 数学 2025-06-10 Somayeh Moradi , Fahimeh Khosh-Ahang Ghasr

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

交换代数 · 数学 2024-08-26 Jennifer Biermann , Selvi Kara , Augustine O'Keefe , Joseph Skelton , Gabriel Sosa

We compute the Castelnuovo-Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs. A feature of our approach is to combine bounds on the regularity, the projective dimension, and…

交换代数 · 数学 2019-07-24 Miguel Eduardo Uribe-Paczka , Adam Van Tuyl

We describe a parallel polynomial time algorithm for computing the topological Betti numbers of a smooth complex projective variety $X$. It is the first single exponential time algorithm for computing the Betti numbers of a significant…

代数几何 · 数学 2011-12-13 Peter Scheiblechner

We study the Betti numbers of binomial edge ideal associated to some classes of graphs with large Castelnuovo-Mumford regularity. As an application we give several lower bounds of the Castelnuovo-Mumford regularity of arbitrary graphs…

交换代数 · 数学 2013-10-16 Zohaib Zahid , Sohail Zafar

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…

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

组合数学 · 数学 2024-06-17 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin , David R. Wood

Let $G$ be a finite simple graph and let $NI(G)$ denote the closed neighborhood ideal of $G$ in a polynomial ring $R$. We show that if $G$ is a forest, then the Castelnuovo-Mumford regularity of $R/NI(G)$ is the same as the matching number…

交换代数 · 数学 2025-10-06 Shiny Chakraborty , Ajay P. Joseph , Amit Roy , Anurag Singh

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of $I(G)^q$ in terms of certain combinatorial invariants associated with $G$. We…

交换代数 · 数学 2021-02-02 A. V. Jayanthan , S. Selvaraja

Let $\rho_C$ be the regularity of the Hilbert function of a projective curve $C$ in $\mathbb P^n_K$ over an algebraically closed field $K$ and $\alpha_1,...,\alpha_{n-1}$ be minimal degrees for which there exists a complete intersection of…

代数几何 · 数学 2007-05-23 Francesca Cioffi , Maria Grazia Marinari , Luciana Ramella

Let $G$ be a finite simple graph on $n$ vertices. Let $J_G \subset K[x_1, \ldots, x_n]$ be the cover ideal of $G$. In this article, we obtain syzygies, Betti numbers and Castelnuovo-Mumford regularity of $J_G^s$ for all $s \geq 1$ for…

交换代数 · 数学 2019-10-21 A V Jayanthan , Neeraj Kumar
‹ 上一页 1 2 3 10 下一页 ›