Combinatorial mutations and block diagonal polytopes

被引:5
|
作者
Clarke, Oliver [1 ]
Higashitani, Akihiro [2 ]
Mohammadi, Fatemeh [3 ,4 ]
机构
[1] Univ Bristol, Sch Math, Bristol BS8 1TW, Avon, England
[2] Osaka Univ, Dept Pure & Appl Math, Suita, Osaka 5650871, Japan
[3] Univ Ghent, Dept Math Algebra & Geometry, B-9000 Ghent, Belgium
[4] Arctic Univ Norway, Dept Math & Stat, N-9037 Tromso, Norway
基金
英国工程与自然科学研究理事会;
关键词
TORIC DEGENERATIONS; SCHUBERT VARIETIES;
D O I
10.1007/s13348-021-00321-w
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Matching fields were introduced by Sturmfels and Zelevinsky to study certain Newton polytopes, and more recently have been shown to give rise to toric degenerations of various families of varieties. Whenever a matching field gives rise to a toric degeneration, the associated polytope of the toric variety coincides with the matching field polytope. We study combinatorial mutations, which are analogues of cluster mutations for polytopes, of matching field polytopes and show that the property of giving rise to a toric degeneration of the Grassmannians, is preserved by mutation. Moreover, the polytopes arising through mutations are Newton-Okounkov bodies for the Grassmannians with respect to certain full-rank valuations. We produce a large family of such polytopes, extending the family of so-called block diagonal matching fields.
引用
收藏
页码:305 / 335
页数:31
相关论文
共 50 条
  • [21] A combinatorial study of partial order polytopes
    Fiorini, S
    EUROPEAN JOURNAL OF COMBINATORICS, 2003, 24 (02) : 149 - 159
  • [22] ON THE CIRCUIT DIAMETER OF SOME COMBINATORIAL POLYTOPES
    Kafer, Sean
    Pashkovich, Kanstantsin
    Sanita, Laura
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (01) : 1 - 25
  • [23] A combinatorial study of multiplexes and ordinary polytopes
    Bayer, MM
    Bruening, AM
    Stewart, JD
    DISCRETE & COMPUTATIONAL GEOMETRY, 2002, 27 (01) : 49 - 63
  • [24] A Combinatorial Study of Multiplexes and Ordinary Polytopes
    M. M. Bayer
    A. M. Bruening
    J. D. Stewart
    Discrete & Computational Geometry, 2002, 27 : 49 - 63
  • [25] COMBINATORIAL FACE ENUMERATION IN CONVEX POLYTOPES
    FUKUDA, K
    ROSTA, V
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1994, 4 (04): : 191 - 198
  • [26] Combinatorial coefficients and the mixed volume of polytopes
    Gelfond, OA
    FUNCTIONAL ANALYSIS AND ITS APPLICATIONS, 1996, 30 (03) : 207 - 208
  • [27] BLOCK DIAGONAL FORM AND BLOCK DIAGONAL CONTROLLER OF NONLINEAR SYSTEMS
    Zhao Guorong
    Zhang Fuen(Dept. of Automatic Control
    Chinese Journal of Aeronautics , 1997, (01) : 51 - 57
  • [28] Hypergraphic polytopes: combinatorial properties and antipode
    Benedetti, Carolina
    Bergeron, Nantel
    Machacek, John
    JOURNAL OF COMBINATORICS, 2019, 10 (03) : 515 - 544
  • [29] Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
    Arya, Rahul
    Arya, Sunil
    da Fonseca, Guilherme D.
    Mount, David M.
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 786 - 805
  • [30] Exponential Lower Bounds for Polytopes in Combinatorial Optimization
    Fiorini, Samuel
    Massar, Serge
    Pokutta, Sebastian
    Tiwary, Hans Raj
    De Wolf, Ronald
    JOURNAL OF THE ACM, 2015, 62 (02)