2009
DOI: 10.1112/blms/bdn120
|View full text |Cite
|
Sign up to set email alerts
|

Regular lattice polytopes and root systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 2 publications
(4 reference statements)
0
2
0
Order By: Relevance
“…Using [15], we know that the fixed polytope is an n-simplex. Moreover, the n + 1 weights on the vertices are given by (n + 1)ω 1 and (n + 1)(ω 1 − α), where α ∈ Comp(eP 1 , P n , H).…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation
“…Using [15], we know that the fixed polytope is an n-simplex. Moreover, the n + 1 weights on the vertices are given by (n + 1)ω 1 and (n + 1)(ω 1 − α), where α ∈ Comp(eP 1 , P n , H).…”
Section: 2mentioning
confidence: 99%
“…It seems natural that the projection which provides the minimal bandwidth has to be linked, in some sense, to the simmetries of the polytope ∆(X). In the case of RH varieties, ∆(X) is given by the Coxeter polytope associated to the marked Dynkin diagram (see [15] for an introduction to the topic) and the symmetries of this polytope are given by some hyperplanes h i orthogonal to certain elements α i (called simple roots) of the root system Φ(G, H). Then we can restate the problem in terms of convex geometry.…”
Section: Introductionmentioning
confidence: 99%