English
Related papers

Related papers: Sortable Freiman ideals

200 papers

Given a set $F$ of oriented graphs, a graph $G$ is an $F$-graph if it admits an $F$-free orientation. Building on previous work by Bang-Jensen and Urrutia, we propose a master algorithm that determines if a graph admits an $F$-free…

Combinatorics · Mathematics 2023-01-16 Santiago Guzmán-Pro , César Hernández-Cruz

We find formulas for the graded core of certain m-primary ideals in a graded ring. In particular, if S is the section ring of an ample line bundle on a Cohen-Macaulay complex projective variety, we show that under suitable hypothesis, the…

Commutative Algebra · Mathematics 2007-05-23 Eero Hyry , Karen E. Smith

In this paper we deal with a subclass of chordal graphs, which are simultaneously strictly chordal and interval, the strictly interval graphs. We present a new characterization of the class that leads to a simple linear recognition…

Discrete Mathematics · Computer Science 2026-05-19 Claudia Justel , Lilian Markenzon

We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…

Commutative Algebra · Mathematics 2015-01-14 Viviana Ene , Jürgen Herzog , Takayuki Hibi , Ayesha Asloob Qureshi

In this paper we describe three different variations of prime ideals: strongly irreducible ideals, strongly prime ideals and insulated prime ideals in the context of Leavitt path algebras. We give necessary and sufficient conditions under…

Rings and Algebras · Mathematics 2021-01-26 Sarah Aljojani , Katherin Radler , K. M. Rangaswamy , Ashish K. Srivastava

We prove that a planar graph is Gorenstein if and only if its independence complex is Eulerian.

Commutative Algebra · Mathematics 2016-03-03 Tran Nam Trung

Let $E$ be an arbitrary directed graph and let $L$ be the Leavitt path algebra of the graph $E$ over a field $K$. The necessary and sufficient con- ditions are given to assure the existence of a maximal ideal in $L$ and also the necessary…

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

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…

Commutative Algebra · Mathematics 2020-11-17 Peter Phelan

Chordal graphs are the graphs in which every cycle of length at least four has a chord. A set $S$ is a vertex separator for vertices $a$ and $b$ if the removal of $S$ of the graph separates $a$ and $b$ into distinct connected components. A…

Discrete Mathematics · Computer Science 2018-03-22 Sérgio H. Nogueira , Vinicius F. dos Santos

We classify all unmixed monomial ideals I of codimension 2 which are generically a complete intersection and which have the property that the symbolic power algebra A(I) is standard graded. We give a lower bound for the highest degree of a…

Commutative Algebra · Mathematics 2016-11-04 Adnan Aslam

Let E be an arbitrary graph and K be any field. For every non-graded ideal I of the Leavitt path algebra L_{K}(E), we give an explicit description of the generators of I. Using this, we show that every finitely generated ideal of L_{K}(E)…

Rings and Algebras · Mathematics 2012-07-17 Kulumani M. Rangaswamy

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

Logic · Mathematics 2025-08-13 Andrew Apps

In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the…

Commutative Algebra · Mathematics 2018-10-09 M. Rouzbahani Malayeri , S. Saeedi Madani , D. Kiani

Parity binomial edge ideals of simple undirected graphs are introduced. Unlike binomial edge ideals, they do not have square-free Gr\"obner bases and are radical if only if the graph is bipartite or the characteristic of the ground field is…

Commutative Algebra · Mathematics 2017-02-15 Thomas Kahle , Camilo Sarmiento , Tobias Windisch

We study Borel ideals $I$ on $\mathbb{N}$ with the Fr\'echet property such its orthogonal $I^\perp$ is also Borel (where $A\in I^\perp$ iff $A\cap B$ is finite for all $B\in I$ and $I$ is Fr\'echet if $I=I^{\perp\perp}$). Let $\mathcal{B}$…

Logic · Mathematics 2017-02-10 Francisco Guevara , Carlos Uzcategui

In this paper we introduce the class of graded Poisson color algebras as the natural generalization of graded Poisson algebras and graded Poisson superalgebras. For $\Lambda$ an arbitrary abelian group, we show that any of such…

Mathematical Physics · Physics 2023-04-25 Valiollah Khalili

Let P = k[x_1, ..., x_n] be the polynomial ring in n variables. A homogeneous ideal I of P generated in degree d is called Gotzmann if it has the smallest possible Hilbert function out of all homogeneous ideals with the same dimension in…

Commutative Algebra · Mathematics 2009-08-14 Andrew H. Hoefel

Given a monomial $m$ in a polynomial ring and a subset $L$ of the variables of the polynomial ring, the principal $L$-Borel ideal generated by $m$ is the ideal generated by all monomials which can be obtained from $m$ by successively…

Commutative Algebra · Mathematics 2020-08-24 Michael DiPasquale , Babak Jabbar Nezhad

By definition, an $\m$-primary ideal $I$ in a 2-dimensional regular local ring $(R, \m)$ is contracted if $I=R \cap IR[\m/x]$ for some $x \in \m \setminus \m^2$. Contracted ideals have been introduced by Zariski and used for proving the…

Commutative Algebra · Mathematics 2007-05-23 Aldo Conca , Emanuela De Negri , A. V. Jayanthan , Maria Evelina Rossi

We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form a common generalization of chordal graphs and circular arc…

Combinatorics · Mathematics 2016-03-08 Tatiana Romina Hartinger , Martin Milanič