On the depth of binomial edge ideals of graphs

被引:0
|
作者
M. Rouzbahani Malayeri
S. Saeedi Madani
D. Kiani
机构
[1] Amirkabir University of Technology (Tehran Polytechnic),Department of Mathematics and Computer Science
[2] Institute for Research in Fundamental Sciences (IPM),School of Mathematics
来源
关键词
Binomial edge ideals; Depth; Diameter of a graph; Hochster-type formula; Meet-contractible; 13C15; 05E40; 13C70; 13C05;
D O I
暂无
中图分类号
学科分类号
摘要
Let G be a graph on the vertex set [n] and JG\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_G$$\end{document} the associated binomial edge ideal in the polynomial ring S=K[x1,…,xn,y1,…,yn]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S=\mathbb {K}[x_1,\ldots ,x_n,y_1,\ldots ,y_n]$$\end{document}. In this paper, we investigate the depth of binomial edge ideals. More precisely, we first establish a combinatorial lower bound for the depth of S/JG\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S/J_G$$\end{document} based on some graphical invariants of G. Next, we combinatorially characterize all binomial edge ideals JG\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$J_G$$\end{document} with depthS/JG=5\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {depth} S/J_G=5$$\end{document}. To achieve this goal, we associate a new poset MG\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathscr {M}_G$$\end{document} with the binomial edge ideal of G and then elaborate some topological properties of certain subposets of MG\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathscr {M}_G$$\end{document} in order to compute some local cohomology modules of S/JG\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$S/J_G$$\end{document}.
引用
收藏
页码:827 / 846
页数:19
相关论文
共 50 条
  • [1] On the depth of binomial edge ideals of graphs
    Malayeri, M. Rouzbahani
    Madani, S. Saeedi
    Kiani, D.
    [J]. JOURNAL OF ALGEBRAIC COMBINATORICS, 2022, 55 (03) : 827 - 846
  • [2] Depth of powers of binomial edge ideals of complete bipartite graphs
    Wang, Hong
    Tang, Zhongming
    [J]. COMMUNICATIONS IN ALGEBRA, 2023, 51 (06) : 2472 - 2483
  • [3] Binomial edge ideals of graphs
    Madani, Sara Saeedi
    Kiani, Dariush
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2012, 19 (02):
  • [4] Binomial edge ideals of unicyclic graphs
    Sarkar, Rajib
    [J]. INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, 2021, 31 (07) : 1293 - 1318
  • [5] On the binomial edge ideals of block graphs
    Chaudhry, Faryal
    Dokuyucu, Ahmet
    Irfan, Rida
    [J]. ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2016, 24 (02): : 149 - 158
  • [6] Binomial edge ideals of bipartite graphs
    Bolognini, Davide
    Macchia, Antonio
    Strazzanti, Francesco
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2018, 70 : 1 - 25
  • [7] On the Depth of Generalized Binomial Edge Ideals
    Anuvinda, J.
    Mehta, Ranjana
    Saha, Kamalesh
    [J]. MEDITERRANEAN JOURNAL OF MATHEMATICS, 2024, 21 (05)
  • [8] Binomial edge ideals of small depth
    Malayeri, Mohammad Rouzbahani
    Madani, Sara Saeedi
    Kiani, Dariush
    [J]. JOURNAL OF ALGEBRA, 2021, 572 : 231 - 244
  • [9] Regularity of binomial edge ideals of chordal graphs
    Rouzbahani Malayeri, Mohammad
    Saeedi Madani, Sara
    Kiani, Dariush
    [J]. COLLECTANEA MATHEMATICA, 2021, 72 (02) : 411 - 422
  • [10] Binomial Edge Ideals of Weakly Closed Graphs
    Seccia, Lisa
    [J]. INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2023, 2023 (24) : 22045 - 22068