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 条
  • [31] 2 COMBINATORIAL PROPERTIES OF A CLASS OF SIMPLICIAL POLYTOPES
    LEE, CW
    ISRAEL JOURNAL OF MATHEMATICS, 1984, 47 (04) : 261 - 269
  • [32] Hirsch polytopes with exponentially long combinatorial segments
    Jean-Philippe Labbé
    Thibault Manneville
    Francisco Santos
    Mathematical Programming, 2017, 165 : 663 - 688
  • [33] Block diagonal polynomials
    Dimant, V
    Gonzalo, R
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2000, 353 (02) : 733 - 747
  • [34] Possibilities determine the combinatorial structure of probability polytopes
    Abramsky, Samson
    Barbosa, Rui Soares
    Kishida, Kohei
    Lal, Raymond
    Mansfield, Shane
    JOURNAL OF MATHEMATICAL PSYCHOLOGY, 2016, 74 : 58 - 65
  • [35] Block Diagonal Matrices
    Pak, Karol
    FORMALIZED MATHEMATICS, 2008, 16 (03): : 259 - 267
  • [36] COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
    Doolittle, Joseph
    Labbe, Jean-Philippe
    Lange, Carsten E. M. C.
    Sinn, Rainer
    Spreer, Jonathan
    Ziegler, Guenter M.
    MATHEMATIKA, 2020, 66 (04) : 927 - 953
  • [37] A COMBINATORIAL MODEL FOR COMPUTING VOLUMES OF FLOW POLYTOPES
    Benedetti, Carolina
    Gonzalez D'Leon, Rafael S.
    Hanusa, Christopher R. H.
    Harris, Pamela E.
    Khare, Apoorva
    Morales, Alejandro H.
    Yip, Martha
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2019, 372 (05) : 3369 - 3404
  • [38] On facet-inducing inequalities for combinatorial polytopes
    Simanchev R.Y.
    Journal of Applied and Industrial Mathematics, 2017, 11 (4) : 564 - 571
  • [39] Hirsch polytopes with exponentially long combinatorial segments
    Labbe, Jean-Philippe
    Manneville, Thibault
    Santos, Francisco
    MATHEMATICAL PROGRAMMING, 2017, 165 (02) : 663 - 688
  • [40] Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
    Arya, Rahul
    Arya, Sunil
    da Fonseca, Guilherme D.
    Mount, David
    ACM TRANSACTIONS ON ALGORITHMS, 2022, 18 (04)