References
- Andrews, G. E. (1976). The Theory of Partitions (Encyclopedia of Mathematics and Its Applications, Vol. 2). Reading, MA: Addison-Wesley.
- Anonymous (joriki), Number of partitions of 2n with no element greater than n. Stackexchange, mathematics. Available at: https://math.stackexchange.com/questions/96085/number-of-partitions-of-2n-with-no-element-greater-than-n.
- Breuer, F., Eichhorn, D., Kronholm, B. (2017). Polyhedral geometry, supercranks, and combinatorial witnesses of congruences for partitions into three parts. Eur. J. Combinat. 65: 230–252.
- Carathéodory, C. (1911). Über den Variabilitätsbereich der Fourier’schen Konstanten von positiven harmonischen Funktionen. Rendiconti del Circolo Matematico di Palermo 32: 193–217. doi:10.1007/BF03014795
- Ehrenborg, R., Readdy, M. A. (2007). The Möbius function of partitions with restricted block sizes. Adv. Appl. Math. 39: 283–292. doi:10.1016/j.aam.2006.08.006
- Engel, K., Radzik, T., Schlage-Puchta, J.-C. (2014). Optimal integer partitions. Eur. J. Combinat. 36: 425–436. doi:10.1016/j.ejc.2013.09.004
- Gomory, R. E. (1969). Some polyhedra related to combinatorial problems. Linear Algebra Appl. 2: 451–558. doi:10.1016/0024-3795(69)90017-2
- Gomory, R. E. (2007). The atoms of integer programming. Ann. Oper. Res. 149: 99–102. doi:10.1007/s10479-006-0110-z
- Konvalinka, M., Pak, I. (2014). Cayley compositions, partitions, polytopes, and geometric bijections. J. Combinat. Theory. Ser. A. 123: 86–91.
- Mano, S. (2017). Partition structure and the A-hypergeometric distribution associated with the rational normal curve. Electron. J. Stat. 11: 4452–4487.
- Metropolis, N., Stein, P. R. (1970). An elementary solution to a problem in restricted partitions. J. Combinat. Theory 9: 365–376. doi:10.1016/S0021-9800(70)80091-6
- Olsen, MC. (2019). Polyhedral geometry for lecture hall partitions. In: Hibi, T., Tsuchiya A., eds. Algebraic and Geometric Combinatorics on Lattice Polytopes. Proceedings of the Summer Workshop on Lattice Polytopes. Singapore: World Scientific, pp. 330–353.
- Onn, S., Shlyk, V. A. (2015). Some efficiently solvable problems over integer partition polytopes. Discret. Appl. Math. 180: 135–140. doi:10.1016/j.dam.2014.08.015
- Reznik, B. (1986). Lattice point simplices. Discret. Math. 60: 219–242.
- Savage, C. D. (2016). The mathematics of lecture hall partitions. J. Combinat. Theory. Ser. A 144: 443–475. doi:10.1016/j.jcta.2016.06.006
- Shlyk, V. A. (2005). Polytopes of partitions of numbers. Eur. J. Combinat. 26: 1139–1153. doi:10.1016/j.ejc.2004.08.004
- Shlyk, V. A. (2008). On the vertices of the polytopes of partitions of numbers. Doklady Natsional’noi Akademii Nauk Belarusi 52: 5–10 (in Russian).
- Shlyk, V. A. (2013). Integer partitions from the polyhedral point of view. Electron. Notes Discret. Math. 43: 319–327. doi:10.1016/j.endm.2013.07.050
- Shlyk, V. A. (2013). Master corner polyhedron: Vertices. Eur. J. Oper. Res. 226: 203–210. doi:10.1016/j.ejor.2012.11.011
- Shlyk, V. A. (2014). Polyhedral approach to integer partitions. J. Combinat. Math. Combinat. Comput. 89: 113–128.
- Vroublevski, A. S., Shlyk, V. A. (2015). Computing vertices of integer partition polytopes. Informatics 4: 34–48 (in Russian).
- Weisstein, E. W. Partition. From MathWorld – A Wolfram Web Resource. Available at: http://mathworld.wolfram.com/Partition.html.
- Yang, D. (2018). University of California, Los Angeles. Personal communication.