2003
DOI: 10.1016/s0001-8708(02)00057-9
|View full text |Cite
|
Sign up to set email alerts
|

The existence of generating families for the cohomology ring of a graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
34
0

Year Published

2008
2008
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 31 publications
(34 citation statements)
references
References 7 publications
0
34
0
Order By: Relevance
“…To have a structure which determines the equivariant cohomology or Chow groups, we should label each multiedge with the topological type of the corresponding family. Guillemin and Zara [2001;2002;2003] have explored the combinatorial properties of moment graphs.…”
Section: T -Invariant Curvesmentioning
confidence: 99%
“…To have a structure which determines the equivariant cohomology or Chow groups, we should label each multiedge with the topological type of the corresponding family. Guillemin and Zara [2001;2002;2003] have explored the combinatorial properties of moment graphs.…”
Section: T -Invariant Curvesmentioning
confidence: 99%
“…§6.3, Remark 6.11). In recent years, combinatorially defined algebras of the type we are considering have been studied by Guillemin and Zara [GZ99,GZ01,GZ03] following the work of GoreskyKottwitz-MacPherson on equivariant cohomology [GKM98], but their focus is different, since they are interested in cases where the algebra in question is actually free over the underlying polynomial ring.…”
Section: Introductionmentioning
confidence: 99%
“…In a series of papers [4][5][6], Guillemin and Zara formulated the notion of a 1-skeleton as described above, and showed that many topological techniques and theorems regarding GKM manifolds have combinatorial analogues on 1-skeleta. In particular, Guillemin and Zara described combinatorial analogues for symplectic blow-up and symplectic reduction, and developed a combinatorial analogue of Morse theory for 1-skeleta.…”
Section: Introductionmentioning
confidence: 99%