Number of vertices in Gelfand-Zetlin polytopes
classification
🧮 math.CO
keywords
gelfand-zetlinpolytopesverticesnumberclassescoefficientsconstantcounting
read the original abstract
We discuss the problem of counting vertices in Gelfand-Zetlin polytopes. Namely, we deduce a partial differential equation with constant coefficients on the exponential generating function for these numbers. For some particular classes of Gelfand-Zetlin polytopes, the number of vertices can be given by explicit formulas.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.