Carla Diane Savage

Lecture hall partitions and the affine hyperoctahedral group

Electronic Journal of Combinatorics, 25(1).

Patterns in inversion sequences II: Inversion sequences avoiding triples of relations

Journal of Integer Sequences, 21(2).

GENERATING FUNCTIONS AND TRIANGULATIONS FOR LECTURE HALL CONES

SIAM JOURNAL ON DISCRETE MATHEMATICS, 30(3), 1470–1479.

The mathematics of lecture hall partitions

JOURNAL OF COMBINATORIAL THEORY SERIES A, 144, 443–475.

Anti-lecture hall compositions and Andrews' generalization of the Watson–Whipple transformation

Journal of Combinatorial Theory, Series A, 134, 188–195.

The s-Eulerian polynomials have only real roots

Transactions of the American Mathematical Society, 367(2), 1441–1466.

s-Lecture hall partitions, self-reciprocal polynomials, and Gorenstein cones

RAMANUJAN JOURNAL, 36(1-2), 123–147.

Hypergeometric Identities Associated with Statistics on Words

In Advances in Combinatorics (pp. 77–100).

Lattice point generating functions and symmetric cones

JOURNAL OF ALGEBRAIC COMBINATORICS, 38(3), 543–566.

Rational lecture hall polytopes and inflated Eulerian polynomials

RAMANUJAN JOURNAL, 31(1-2), 97–114.

Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences

JOURNAL OF COMBINATORIAL THEORY SERIES A, 119(4), 850–870.

Mahonian pairs

JOURNAL OF COMBINATORIAL THEORY SERIES A, 119(3), 526–545.

The 1/k-Eulerian polynomials

Electronic Journal of Combinatorics, 19(1).

On an identity of Gessel and Stanton and the new little Göllnitz identities

Advances in Applied Mathematics, 46(1-4), 563–575.

Symmetrically constrained compositions

RAMANUJAN JOURNAL, 23(1-3), 355–369.

An update on the middle levels problem

Shields, I., Shields, B. J., & Savage, C. D. (2009, September 6). DISCRETE MATHEMATICS, Vol. 309, pp. 5271–5277.

Minimizing transceivers in optical path networks

JOURNAL OF OPTICAL NETWORKING, 8(5), 454–461.

ON q-SERIES IDENTITIES ARISING FROM LECTURE HALL PARTITIONS

INTERNATIONAL JOURNAL OF NUMBER THEORY, 5(2), 327–337.

On the existence of symmetric chain decompositions in a quotient of the Boolean lattice

Jiang, Z., & Savage, C. D. (2009, September 6). DISCRETE MATHEMATICS, Vol. 309, pp. 5278–5283.

Euler's partition theorem and the combinatorics of l-sequences

JOURNAL OF COMBINATORIAL THEORY SERIES A, 115(6), 967–996.

Complexity of path traffic grooming

JOURNAL OF OPTICAL NETWORKING, 6(11), 1270–1281.

The joint distribution of descent and major index over restricted sets of permutations

ANNALS OF COMBINATORICS, 11(3-4), 375–386.

Pattern avoidance in compositions and multiset permutations

ADVANCES IN APPLIED MATHEMATICS, 36(2), 194–201.

Common intervals of trees

INFORMATION PROCESSING LETTERS, 93(2), 69–74.

Antipodal gray codes

DISCRETE MATHEMATICS, 281(1-3), 221–236.

Lecture hall theorems, q-series and truncated objects

JOURNAL OF COMBINATORIAL THEORY SERIES A, 108(2), 217–245.

On the multiplicity of parts in a random composition of a large integer

SIAM JOURNAL ON DISCRETE MATHEMATICS, 18(2), 418–435.

Partitions and compositions defined by inequalities

RAMANUJAN JOURNAL, 8(3), 357–381.

Regularly spaced subsums of integer partitions

ACTA ARITHMETICA, 115(3), 205–216.

Venn diagrams and symmetric chain decompositions in the Boolean lattice

Electronic Journal of Combinatorics, 11(1).

Anti-lecture hall compositions

Discrete Mathematics, 263(1-3), 275–280.

On the existence of Hamiltonian paths in the cover graph of M(n)

DISCRETE MATHEMATICS, 262(1-3), 241–252.

A generating functionology approach to a problem of Wilf

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 142(1), 107–114.

A lattice path approach to counting partitions with minimum rank t

Burstein, A., Corteel, S., Postnikov, A., & Savage, C. D. (2002, April 28). DISCRETE MATHEMATICS, Vol. 249, pp. 31–39.

On the number of graphical forest partitions

Ars Combinatoria, 65(2002 Oct), 33–37.

On multi-color partitions and the generalized Rogers-Ramanujan identities

COMMUNICATIONS IN CONTEMPORARY MATHEMATICS, 3(4), 533–548.

Combinatorial families that are exponentially far from being listable in Gray code sequence

TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 351(1), 379–402.

On the multiplicity of parts in a random partition

RANDOM STRUCTURES & ALGORITHMS, 14(2), 185–197.

A bijection for partitions with all ranks at least t

JOURNAL OF COMBINATORIAL THEORY SERIES A, 83(2), 202–220.

A pentagonal number sieve

JOURNAL OF COMBINATORIAL THEORY SERIES A, 82(2), 186–192.

Basis partitions

DISCRETE MATHEMATICS, 179(1-3), 277–283.

Durfee polynomials

Electronic Journal of Combinatorics, 5(1, Research paper 32), 1–21.

Graphical basis partitions

GRAPHS AND COMBINATORICS, 14(3), 241–261.

The connectivity of acyclic orientation graphs

DISCRETE MATHEMATICS, 184(1-3), 281–287.

A survey of combinational Gray codes

[Review of ]. SIAM REVIEW, 39(4), 605–629.

Efficient generation of graphical partitions

DISCRETE APPLIED MATHEMATICS, 78(1-3), 17–26.

A Note on the complexity of converter placement supporting broadcast in WDM optical networks

Dutta, R., & Savage, C. In 2005 International Conference on Telecommunication Systems, Modeling and Analysis (pp. 23–31).

On the complexity of path traffic grooming.

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