DOI: 10.2969/aspm/01710289
|View full text |Cite
|
Sign up to set email alerts
|

Arrangements of Hyperplanes, Higher Braid Groups and Higher Bruhat Orders

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
158
0
8

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 98 publications
(166 citation statements)
references
References 5 publications
0
158
0
8
Order By: Relevance
“…In this paper we examine the structure of the first higher Stasheff-Tamari order y x (n, d) on the set of all triangulations of the cyclic polytope C(n, d) (definitions below), introduced by Edelman and Reiner [7]. It turns out that it is similarly structured as the higher Bruhat order i -2, d-1) of Manin and Schechtman [15]; in particular it is bounded.Given a triangulation of the convex hull of a finite point configuration in Euclidean (/-space that is not satisfying a certain quality measure, can one find a better, or even the best triangulation (with respect to this measure) by performing a finite sequence of (computationally cheap) local transformations? A necessary condition for the latter case is that any possible triangulation is accessible by this kind of transformation.…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper we examine the structure of the first higher Stasheff-Tamari order y x (n, d) on the set of all triangulations of the cyclic polytope C(n, d) (definitions below), introduced by Edelman and Reiner [7]. It turns out that it is similarly structured as the higher Bruhat order i -2, d-1) of Manin and Schechtman [15]; in particular it is bounded.Given a triangulation of the convex hull of a finite point configuration in Euclidean (/-space that is not satisfying a certain quality measure, can one find a better, or even the best triangulation (with respect to this measure) by performing a finite sequence of (computationally cheap) local transformations? A necessary condition for the latter case is that any possible triangulation is accessible by this kind of transformation.…”
mentioning
confidence: 99%
“…In this paper we examine the structure of the first higher Stasheff-Tamari order y x (n, d) on the set of all triangulations of the cyclic polytope C(n, d) (definitions below), introduced by Edelman and Reiner [7]. It turns out that it is similarly structured as the higher Bruhat order i -2, d-1) of Manin and Schechtman [15]; in particular it is bounded.…”
mentioning
confidence: 99%
“…The Manin-Schechtman configuration space U (k + 2, k) has a simple geometric structure [10]. It is the complement in C n to the union of (k + 2) hyperplanes D J , |J| = k + 1, J ⊂ K, |K| = k + 2, which contains the only plane D K , |K| = k + 2, of codimension 2.…”
Section: Lemmamentioning
confidence: 99%
“…gives a description of generators of homology groups H 2 (U (n, k), Z) and generating relations of the higher braid groups B n (k) [3,6,10].…”
mentioning
confidence: 99%
See 1 more Smart Citation