Depths of Powers of the Edge Ideal of a Tree
By Susan Morey. 2009
82 citations recorded by the source corpus.
Lower bounds are given for the depths of R/I t for t ≥ 1 when I is the edge ideal of a tree or forest. The bounds are given in terms of the diameter of the tree, or in case of a forest, the largest diameter of a connected component and the number of connected components. These lower bounds provide a lower bound on the power for which the depths stabilize.
Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/fb3ada164313f8f1d8dded0dab4be6dc256ee7a0
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Algebra and Number Theory
- Tran Nam Trung
- Rafael H. Villarreal
- Susan Morey
- Huy Tài Hà
- S. Beyarslan
- Adam Van Tuyl
- K. Kimura
- Arindam Banerjee
In Computational Theory and Mathematics
- Huy Tài Hà
- Susan Morey
- Rafael H. Villarreal
- Tran Nam Trung
- S. Beyarslan
- Adam Van Tuyl
- K. Kimura
- Jürgen Herzog
In Geometry and Topology
- Tran Nam Trung
- Huy Tài Hà
- Rafael H. Villarreal
- S. Beyarslan
- Susan Morey
- Adam Van Tuyl
- K. Kimura
- Arindam Banerjee
Citations in the corpus
- Regularity of powers of forests and cycles (2014, background): “[5, 16, 21, 22, 29]), we start with the case when G contains no cycles.”
- Edge ideals: algebraic and combinatorial properties (2010, background): “Lower bounds are given in [87] for the depths of R/I(G)t for t ≥ 1 when I(G) is the edge ideal of a tree or forest.”