F-Polynomials and Newton Polytopes

EasyChair Preprint no. 8975

Abstract

We provide an effective algorithmic method for computation of Gross-Keel-Hacking-Kontsevich potential, F-polynomials and Bernstein-Kazhdan decoration function and it's complexity bounds. For simply laced Lie algebras we make conjecture and provide experimental evidence that Newton polytopes for Gross-Keel-Hacking-Kontsevich potential do not contain any interior lattice points.

Keyphrases: Berenstein-Kazhdan potential, F-polynomials, Gross-Hacking-Keel-Kontsevich potential, Newton polytopes, symbolic calculations

@Booklet{EasyChair:8975,
  author = {Gleb Koshevoy and Denis Mironov},
  title = {F-Polynomials and Newton Polytopes},
  howpublished = {EasyChair Preprint no. 8975},

  year = {EasyChair, 2022}}