2008
DOI: 10.1090/s0002-9939-08-09764-5
|View full text |Cite
|
Sign up to set email alerts
|

A convexity theorem for the real part of a Borel invariant subvariety

Abstract: Abstract. M. Brion proved a convexity result for the moment map image of an irreducible subvariety of a compact integral Kähler manifold preserved by the complexification of the Hamiltonian group action. V. Guillemin and R. Sjamaar generalized this result to irreducible subvarieties preserved only by a Borel subgroup. In another direction, L. O'Shea and R. Sjamaar proved a convexity result for the moment map image of the submanifold fixed by an antisymplectic involution. Analogous to Guillemin and Sjamaar's ge… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2016
2016

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…Perfect matchings can be efficiently determined using generalized Kasteleyn matrices, which are certain adjacency matrices for the graph [51]. The correspondence between perfect matchings and perfect orientations is very simple [51,52]: when a graph is perfectly oriented, there is one preferred edge at every vertex-the one outgoing (incoming) edge at each black (white) vertex; these preferred edges must connect pairs of vertices (from black to white) in non-overlapping subsets, and therefore define a perfect matching. And the construction of a perfect orientation from a perfect matching is similarly straight-forward.…”
Section: (Canonical) Coordinates Boundary Measurements and Volume Formsmentioning
confidence: 99%
“…Perfect matchings can be efficiently determined using generalized Kasteleyn matrices, which are certain adjacency matrices for the graph [51]. The correspondence between perfect matchings and perfect orientations is very simple [51,52]: when a graph is perfectly oriented, there is one preferred edge at every vertex-the one outgoing (incoming) edge at each black (white) vertex; these preferred edges must connect pairs of vertices (from black to white) in non-overlapping subsets, and therefore define a perfect matching. And the construction of a perfect orientation from a perfect matching is similarly straight-forward.…”
Section: (Canonical) Coordinates Boundary Measurements and Volume Formsmentioning
confidence: 99%
“…Guillemin and Sjamaar [GS06] generalize Duistermaat's convexity result in finite dimensions to the non-abelian regime for singular varieties. Goldberg [Gol09] in turn combined this result with that of [OS00] to derive the same result for singular B-invariant varieties.…”
Section: Duistermaat-type Convexitymentioning
confidence: 80%