On matrix and lattice ideals of digraphs
Let $textit{G}$ be a simple, oriented connected graph with $n$ vertices and $m$ edges. Let $I(textbf{B})$ be the binomial ideal associated to the incidence matrix textbf{B} of the graph $G$. Assume that $I_L$ is the lattice ideal associated to the rows of the matrix $textbf{B}$. Also let $t...
Main Authors: | Hamid Damadi, Farhad Rahmati |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Isfahan
2018-06-01
|
Series: | Transactions on Combinatorics |
Subjects: | |
Online Access: | http://toc.ui.ac.ir/article_22320_b7155094bae6e4bfec0b32c67a2295ec.pdf |
Similar Items
-
Smoothness in Binomial Edge Ideals
by: Hamid Damadi, et al.
Published: (2016-06-01) -
On the hilbert series of binomial edge ideals of generalized trees
by: Mahdis Saeedi, et al.
Published: (2017-09-01) -
Binomial vanishing ideals
by: Azucena Tochimani, et al.
Published: (2015-05-01) -
Some properties of 2-absorbing primary ideals in lattices
by: Meenakshi P. Wasadikar, et al.
Published: (2019-04-01) -
ℒ-Fuzzy Ideals of Residuated Lattices
by: Kengne Pierre Carole, et al.
Published: (2019-12-01)