Carla Savage

Hanusa, C. R. H., & Savage, C. D. (2018). Lecture hall partitions and the affine hyperoctahedral group. Electronic Journal of Combinatorics, 25(1).

Martinez, M., & Savage, C. (2018). Patterns in inversion sequences II: Inversion sequences avoiding triples of relations. Journal of Integer Sequences, 21(2).

Beck, M., Braun, B., Koppe, M., Savage, C. D., & Zafeirakopoulos, Z. (2016). GENERATING FUNCTIONS AND TRIANGULATIONS FOR LECTURE HALL CONES. SIAM JOURNAL ON DISCRETE MATHEMATICS, 30(3), 1470–1479. https://doi.org/10.1137/15m1036907

Savage, C. D. (2016). The mathematics of lecture hall partitions. JOURNAL OF COMBINATORIAL THEORY SERIES A, 144, 443–475. https://doi.org/10.1016/j.jcta.2016.06.006

Corteel, S., Lovejoy, J., & Savage, C. (2015). Anti-lecture hall compositions and Andrews' generalization of the Watson–Whipple transformation. Journal of Combinatorial Theory, Series A, 134, 188–195. https://doi.org/10.1016/J.JCTA.2015.03.002

Savage, C., & Visontai, M. (2015). The s-Eulerian polynomials have only real roots. Transactions of the American Mathematical Society, 367(2), 1441–1466. https://doi.org/10.1090/s0002-9947-2014-06256-9

Beck, M., Braun, B., Koeppe, M., Savage, C. D., & Zafeirakopoulos, Z. (2015). s-Lecture hall partitions, self-reciprocal polynomials, and Gorenstein cones. RAMANUJAN JOURNAL, 36(1-2), 123–147. https://doi.org/10.1007/s11139-013-9538-3

Andrews, G. E., Savage, C. D., & Wilf, H. S. (2013). Hypergeometric Identities Associated with Statistics on Words. In Advances in Combinatorics (pp. 77–100). https://doi.org/10.1007/978-3-642-30979-3_4

Beck, M., Bliem, T., Braun, B., & Savage, C. D. (2013). Lattice point generating functions and symmetric cones. JOURNAL OF ALGEBRAIC COMBINATORICS, 38(3), 543–566. https://doi.org/10.1007/s10801-012-0414-9

Pensyl, T. W., & Savage, C. D. (2013). Rational lecture hall polytopes and inflated Eulerian polynomials. RAMANUJAN JOURNAL, 31(1-2), 97–114. https://doi.org/10.1007/s11139-012-9393-7

Savage, C. D., & Schuster, M. J. (2012). Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences. JOURNAL OF COMBINATORIAL THEORY SERIES A, 119(4), 850–870. https://doi.org/10.1016/j.jcta.2011.12.005

Sagan, B. E., & Savage, C. D. (2012). Mahonian pairs. JOURNAL OF COMBINATORIAL THEORY SERIES A, 119(3), 526–545. https://doi.org/10.1016/j.jcta.2011.11.003

Savage, C. D., & Viswanathan, G. (2012). The 1/k-Eulerian polynomials. Electronic Journal of Combinatorics, 19(1).

Savage, C. D., & Sills, A. V. (2011). On an identity of Gessel and Stanton and the new little Göllnitz identities. Advances in Applied Mathematics, 46(1-4), 563–575. https://doi.org/10.1016/j.aam.2009.12.009

Beck, M., Gessel, I. M., Lee, S., & Savage, C. D. (2010). Symmetrically constrained compositions. RAMANUJAN JOURNAL, 23(1-3), 355–369. https://doi.org/10.1007/s11139-010-9232-7

Shields, I., Shields, B. J., & Savage, C. D. (2009, September 6). An update on the middle levels problem. DISCRETE MATHEMATICS, Vol. 309, pp. 5271–5277. https://doi.org/10.1016/j.disc.2007.11.010

Iyer, P., Dutta, R., & Savage, C. D. (2009). Minimizing transceivers in optical path networks. JOURNAL OF OPTICAL NETWORKING, 8(5), 454–461. https://doi.org/10.1364/JON.8.000454

Andrews, G. E., Corteel, S., & Savage, C. D. (2009). ON q-SERIES IDENTITIES ARISING FROM LECTURE HALL PARTITIONS. INTERNATIONAL JOURNAL OF NUMBER THEORY, 5(2), 327–337. https://doi.org/10.1142/S1793042109002134

Jiang, Z., & Savage, C. D. (2009, September 6). On the existence of symmetric chain decompositions in a quotient of the Boolean lattice. DISCRETE MATHEMATICS, Vol. 309, pp. 5278–5283. https://doi.org/10.1016/j.disc.2007.11.036

Savage, C. D., & Yee, A. J. (2008). Euler's partition theorem and the combinatorics of l-sequences. JOURNAL OF COMBINATORIAL THEORY SERIES A, 115(6), 967–996. https://doi.org/10.1016/j.jcta.2007.11.006

Iyer, P., Dutta, R., & Savage, C. D. (2007). Complexity of path traffic grooming. JOURNAL OF OPTICAL NETWORKING, 6(11), 1270–1281. https://doi.org/10.1364/JON.6.001270

Corteel, S., Gessel, I. M., Savage, C. D., & Wiif, H. S. (2007). The joint distribution of descent and major index over restricted sets of permutations. ANNALS OF COMBINATORICS, 11(3-4), 375–386. https://doi.org/10.1007/s00026-007-0325-y

Savage, C. D., & Wilf, H. S. (2006). Pattern avoidance in compositions and multiset permutations. ADVANCES IN APPLIED MATHEMATICS, 36(2), 194–201. https://doi.org/10.1016/j.aam.2005.06.003

Heber, S., & Savage, C. D. (2005). Common intervals of trees. INFORMATION PROCESSING LETTERS, 93(2), 69–74. https://doi.org/10.1016/j.ipl.2004.09.016

Killian, C. E., & Savage, C. D. (2004). Antipodal gray codes. DISCRETE MATHEMATICS, 281(1-3), 221–236. https://doi.org/10.1016/j.disc.2003.07.012

Corteel, S., & Savage, C. D. (2004). Lecture hall theorems, q-series and truncated objects. JOURNAL OF COMBINATORIAL THEORY SERIES A, 108(2), 217–245. https://doi.org/10.1016/j.jcta.2004.05.006

Hitczenko, P. L., & Savage, C. D. (2004). On the multiplicity of parts in a random composition of a large integer. SIAM JOURNAL ON DISCRETE MATHEMATICS, 18(2), 418–435. https://doi.org/10.1137/s0895480199363155

Corteel, S., & Savage, C. D. (2004). Partitions and compositions defined by inequalities. RAMANUJAN JOURNAL, 8(3), 357–381. https://doi.org/10.1007/s11139-004-0144-2

Canfield, E. R., Savage, C. D., & Wilf, H. S. (2004). Regularly spaced subsums of integer partitions. ACTA ARITHMETICA, 115(3), 205–216. https://doi.org/10.4064/aa115-3-1

Griggs, J., Killian, C. E., & Savage, C. D. (2004). Venn diagrams and symmetric chain decompositions in the Boolean lattice. Electronic Journal of Combinatorics, 11(1).

Corteel, S., & Savage, C. (2003). Anti-lecture hall compositions. Discrete Mathematics, 263(1-3), 275–280. https://doi.org/10.1016/S0012-365X(02)00768-9

Savage, C. D., Shields, I., & West, D. B. (2003). On the existence of Hamiltonian paths in the cover graph of M(n). DISCRETE MATHEMATICS, 262(1-3), 241–252. https://doi.org/10.1016/S0012-365X(02)00503-4

Hitczenko, P., Rousseau, C., & Savage, C. D. (2002). A generating functionology approach to a problem of Wilf. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 142(1), 107–114. https://doi.org/10.1016/S0377-0427(01)00462-9

Burstein, A., Corteel, S., Postnikov, A., & Savage, C. D. (2002, April 28). A lattice path approach to counting partitions with minimum rank t. DISCRETE MATHEMATICS, Vol. 249, pp. 31–39. https://doi.org/10.1016/S0012-365X(01)00225-4

Frank, D. A., Savage, C. D., & Sellers, J. A. (2002). On the number of graphical forest partitions. Ars Combinatoria, 65(2002 Oct), 33–37.

Jing, N. H., Misra, K. C., & Savage, C. D. (2001). On multi-color partitions and the generalized Rogers-Ramanujan identities. COMMUNICATIONS IN CONTEMPORARY MATHEMATICS, 3(4), 533–548. https://doi.org/10.1142/S0219199701000482

Chinburg, T., Savage, C. D., & Wilf, H. S. (1999). Combinatorial families that are exponentially far from being listable in Gray code sequence. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 351(1), 379–402. https://doi.org/10.1090/S0002-9947-99-02229-1

Corteel, S., Pittel, B., Savage, C. D., & Wilf, H. S. (1999). On the multiplicity of parts in a random partition. RANDOM STRUCTURES & ALGORITHMS, 14(2), 185–197. https://doi.org/10.1002/(SICI)1098-2418(199903)14:2<185::AID-RSA4>3.0.CO;2-F

Corteel, S., Savage, C. D., & Venkatraman, R. (1998). A bijection for partitions with all ranks at least t. JOURNAL OF COMBINATORIAL THEORY SERIES A, 83(2), 202–220. https://doi.org/10.1006/jcta.1998.2873

Corteel, S., Savage, C. D., Wilf, H. S., & Zeilberger, D. (1998). A pentagonal number sieve. JOURNAL OF COMBINATORIAL THEORY SERIES A, 82(2), 186–192. https://doi.org/10.1006/jcta.1997.2846

Nolan, J. M., Savage, C. D., & Wilf, H. S. (1998). Basis partitions. DISCRETE MATHEMATICS, 179(1-3), 277–283. https://doi.org/10.1016/S0012-365X(97)00101-5

Canfield, E. R., Corteel, S., & Savage, C. D. (1998). Durfee polynomials. Electronic Journal of Combinatorics, 5(1, Research paper 32), 1–21.

Nolan, J. M., Sivaraman, V., Savage, C. D., & Tiwari, P. K. (1998). Graphical basis partitions. GRAPHS AND COMBINATORICS, 14(3), 241–261. https://doi.org/10.1007/s003730050029

Savage, C. D., & Zhang, C. Q. (1998). The connectivity of acyclic orientation graphs. DISCRETE MATHEMATICS, 184(1-3), 281–287. https://doi.org/10.1016/S0012-365X(97)00201-X

Savage, C. (1997). [Review of A survey of combinational Gray codes]. SIAM REVIEW, 39(4), 605–629. https://doi.org/10.1137/S0036144595295272

Barnes, T. M., & Savage, C. D. (1997). Efficient generation of graphical partitions. DISCRETE APPLIED MATHEMATICS, 78(1-3), 17–26. https://doi.org/10.1016/s0166-218x(97)00022-x

Dutta, R., & Savage, C. A Note on the complexity of converter placement supporting broadcast in WDM optical networks. In 2005 International Conference on Telecommunication Systems, Modeling and Analysis (pp. 23–31).

Iyer, P., Dutta, R., & Savage, C. D. On the complexity of path traffic grooming. In Proceedings of the Second International IEEE/Create-net workshop on traffic grooming (pp. 295–301). Los Alamitos, CA: IEEE Computer Society.