Counting vertices in Gelfand–Zetlin polytopes

Pavel Gusev; Valentina Kiritchenko; Vladlen Timorin

doi:10.1016/j.jcta.2013.02.003

ScienceGate Book Chapters

JOURNAL ARTICLE

Counting vertices in Gelfand–Zetlin polytopes

Pavel Gusev Valentina Kiritchenko Vladlen Timorin

Year: 2013 Journal: Journal of Combinatorial Theory Series A Vol: 120 (4)Pages: 960-969 Publisher: Elsevier BV

DOI: 10.1016/j.jcta.2013.02.003

Get Full-Text PDF Get Analytical Report

Keywords:

Polytope Mathematics Combinatorics Generating function Exponential function Constant (computer programming) Function (biology) Mathematical analysis Computer science

Metrics

Cited By

0.55

FWCI (Field Weighted Citation Impact)

Refs

0.64

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Combinatorial Mathematics

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Random Matrices and Applications

Physical Sciences → Mathematics → Statistics and Probability

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Counting vertices in Gelfand–Zetlin polytopes

Metrics

Citation History

Topics

Related Documents

Gelfand-Zetlin Polytopes and Flag Varieties

Schubert calculus and Gelfand-Zetlin polytopes

Vertices of Gelfand--Tsetlin Polytopes

Lascoux Polynomials and Subdivisions of Gelfand–Zetlin Polytopes

Counting $d$-Polytopes with $d+3$ Vertices