Results 11 to 20 of about 1,194,320 (236)

Binomial edge ideals of bipartite graphs [PDF]

open access: yesEuropean Journal of Combinatorics, 2018
We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the converse of a well-known result due to Hartshorne, showing that the Cohen-Macaulayness of these ideals is equivalent ...
Davide Bolognini   +2 more
core   +7 more sources

Generalized binomial edge ideals [PDF]

open access: yesAdvances in Applied Mathematics, 2013
6 pages.
Rauh, Johannes, Johannes Rauh
openaire   +3 more sources

On the binomial edge ideals of block graphs

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity.
Chaudhry Faryal   +2 more
doaj   +2 more sources

Binomial Edge Ideals of Weakly Closed Graphs

open access: yesInternational Mathematics Research Notices, 2022
Abstract Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gröbner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely weakly closed graphs (or co-comparability graphs).
Seccia, Lisa
openaire   +4 more sources

Binomial edge ideals and conditional independence statements [PDF]

open access: yesAdvances in Applied Mathematics, 2010
We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gröbner basis in a lexicographic order induced by a vertex labeling. Such graphs are chordal and claw-free. We give a reduced squarefree Gröbner basis for general $G$.
Jürgen Herzog   +4 more
openaire   +3 more sources

On the symbolic F-splitness of binomial edge ideals [PDF]

open access: yesJournal of Pure and Applied Algebra
We study the symbolic $F$-splitness of families of binomial edge ideals. We also study the strong $F$-regularity of the symbolic blowup algebras of families of binomial edge ideals. We make use of Fedder-like criteria and combinatorial properties of the graphs associated to the binomial edge ideals in order to approach the aforementioned scenarios.
Ramírez-Moreno, Pedro
core   +5 more sources

Multidegrees of binomial edge ideals [PDF]

open access: yesCommunications in Algebra
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 vertices whose prime ideals have minimum codimension.
Cooper, Jacob, Leventhal, Ethan
core   +4 more sources

Interpretability and Representability of Commutative Algebra, Algebraic Topology, and Topological Spectral Theory for Real-World Data. [PDF]

open access: yesAdv Intell Discov
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Ren Y, Wei GW.
europepmc   +2 more sources

Binomial edge ideals of unicyclic graphs [PDF]

open access: yesInternational Journal of Algebra and Computation, 2021
Let [Formula: see text] be a connected graph on the vertex set [Formula: see text]. Then [Formula: see text]. In this paper, we prove that if [Formula: see text] is a unicyclic graph, then the depth of [Formula: see text] is bounded below by [Formula: see text]. Also, we characterize [Formula: see text] with [Formula: see text] and [Formula: see text].
openaire   +3 more sources

On the hilbert series of binomial edge ideals of generalized trees [PDF]

open access: yesTransactions on Combinatorics, 2017
In this paper we introduce the concept of generalized trees and compute the Hilbert series of their binomial edge ideals‎.
Mahdis Saeedi, Farhad Rahmati
doaj   +1 more source

Home - About - Disclaimer - Privacy