English
Related papers

Related papers: Intersection Graph of Graded ideals

200 papers

In this article, we introduce a generalization of the concept of graded $r$-ideals in graded commutative rings with nonzero unity. Let $G$ be a group, $R$ be a $G$-graded commutative ring with nonzero unity and $GI(R)$ be the set of all…

Commutative Algebra · Mathematics 2021-04-13 Rashid Abu-Dawwas , Malik Bataineh , Ghida'a Al-Qura'an

We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.

Commutative Algebra · Mathematics 2007-05-23 Margherita Barile

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…

Group Theory · Mathematics 2025-09-22 C S Preenu , R S Indu , Sijo George

A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…

Group Theory · Mathematics 2026-04-15 Jordi Delgado , Marco Linton , Jone Lopez de Gamiz Zearra , Mallika Roy , Pascal Weil

In this paper, we consider graded near-rings over a monoid $G$ as a generalizations of graded rings over groups. We introduce certain innovative graded prime ideals and study some of its basic properties over graded near-rings.

General Mathematics · Mathematics 2022-04-15 Malik Bataineh , Tamem Al-Shorman , Eman Al-Kilany

Let $E$ be an arbitrary directed graph and let $L$ be the Leavitt path algebra of the graph $E$ over a field $K$. It is shown that every ideal of $L$ is an intersection of primitive/prime ideals in $L$ if and only if the graph $E$ satisfies…

Rings and Algebras · Mathematics 2020-12-29 Songül Esin , Müge Kanuni , K. M. Rangaswamy

Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…

Commutative Algebra · Mathematics 2023-01-18 Akihiro Higashitani , Akane Kanno , Ryota Ueji

An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: L, \Gamma, LE{} and \eeG. A $k$-bend path is a simple path in the plane, whose direction changes $k$ times from horizontal…

Combinatorics · Mathematics 2016-01-08 Stefan Felsner , Kolja Knauer , George B. Mertzios , Torsten Ueckerdt

Let I = (F_1,...,F_r) be a homogeneous ideal of R = k[x_0,...,x_n] generated by a regular sequence of type (d_1,...,d_r). We give an elementary proof for an explicit description of the graded Betti numbers of I^s for any s \geq 1. These…

Commutative Algebra · Mathematics 2007-05-23 Elena Guardo , Adam Van Tuyl

We show that, for an arbitrary graph, a regular ideal of the associated Leavitt path algebra is also graded. As a consequence, for a row-finite graph, we obtain that the quotient of the associated Leavitt path by a regular ideal is again a…

Rings and Algebras · Mathematics 2021-07-22 Daniel Gonçalves , Danilo Royer

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…

Commutative Algebra · Mathematics 2024-05-14 Jacob Cooper , Ethan Leventhal

For a set of non-negative integers $L$, the $L$-intersection number of a graph is the smallest number $l$ for which there is an assignment on the vertices to subsets $A_v \subseteq \{1,\dots, l\}$, such that every two vertices $u,v$ are…

Combinatorics · Mathematics 2013-08-22 Zeinab Maleki , Behnaz Omoomi

We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…

Combinatorics · Mathematics 2014-03-13 Svante Janson , Andrew J. Uzzell

We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is…

Commutative Algebra · Mathematics 2016-05-03 Arindam Banerjee , Luis Núñez-Betancourt

This paper investigates the relationship between multiplicities and the degree sequence of ideals in graded algebras, gives multiplicity equations of graded rings via the degree sequence of ideals, and characterizes mixed multiplicities and…

Commutative Algebra · Mathematics 2015-05-06 Duong Quoc Viet

A directed graph $G=(V,E)$ is {\it strongly pseudo transitive} if there is a partition $\{A,E-A\}$ of $E$ so that graphs $G_1=(V,A)$ and $G_2=(V,E-A)$ are transitive, and additionally, if $ab\in A$ and $bc\in E $ implies that $ac\in E$. A…

Combinatorics · Mathematics 2018-06-06 Farhad Shahrokhi

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,…

Commutative Algebra · Mathematics 2023-08-14 Shiya Duan , Guangjun Zhu , Yijun Cui , Jiaxin Li

For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…

Commutative Algebra · Mathematics 2024-02-07 Hiram H. Lopez , Rafael H. Villarreal

Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…

Commutative Algebra · Mathematics 2021-01-21 Charlie Miller , Branden Stone

Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_{1}, \ldots, x_{n}\}$ and match$(G)$, min-match$(G)$ and ind-match$(G)$ the matching number, minimum matching number and induced matching number of $G$, respectively. Let…

Commutative Algebra · Mathematics 2020-01-30 Ayana Hirano , Kazunori Matsuda