1. P. Alexandersson, Polynomials defined by tableaux and linear recurrences, Electron. J. Combin. 23 (2016), no. 1, Paper 1.47, 24.
2. F. Ardila, T. Bliem, D. Salazar, Gelfand–Tsetlin polytopes and Feigin–Fourier–Littelmann–Vinberg polytopes as marked poset polytopes, J. Combin. Theory Ser. A 118 (2011), no. 8, 2454–2462.
3. I. Assem, C. Reutenauer, D. Smith, Friezes, Adv. Math. 225 (2010), no. 6, 3134–3165.
4. A. Barvinok, J. E. Pommersheim, An algorithmic theory of lattice points in polyhedra, in: New Perspectives in Algebraic Combinatorics (Berkeley, CA, 1996–97), Math. Sci. Res. Inst. Publ., Vol. 38, Cambridge Univ. Press, Cambridge, 1999, pp. 91–147.
5. M. Beck, S. Robins, Computing the Continuous Discretely, 2nd ed., Undergraduate Texts in Mathematics, Springer, New York, 2015.