Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Depth and Stanley depth of the path ideal associated to an $n$-cyclic graph

From MaRDI portal
Publication:4633358
Jump to:navigation, search

DOI10.3906/mat-1603-114zbMath1424.13018arXiv1612.08177OpenAlexW2963562495MaRDI QIDQ4633358

Guangjun Zhu

Publication date: 2 May 2019

Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.08177


zbMATH Keywords

Stanley depthcyclic graphpath idealStanley inequality


Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Dimension theory, depth, related commutative rings (catenary, etc.) (13C15)




Cites Work

  • Interval partitions and Stanley depth
  • Linear Diophantine equations and local cohomology
  • A non-partitionable Cohen-Macaulay simplicial complex
  • How to compute the Stanley depth of a monomial ideal
  • Stanley Decompositions, Pretty Clean Filtrations and Reductions Modulo Regular Elements
  • A Survey on Stanley Depth
  • On the Stanley depth of edge ideals of line and cyclic graphs
  • Depth and Stanley Depth of Multigraded Modules
  • Depths of Powers of the Edge Ideal of a Tree
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Depth and Stanley depth of the path ideal associated to an $n$-cyclic graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4633358&oldid=18815549"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 15:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki