A Course in Enumeration

By M. Aigner. 2007

319 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Ramsey Theory, integer partitions and a new proof of the Erdős–Szekeres Theorem (2012, methodology): “We also recommend Chapter 5 of [1] for an ingenious proof of (3) using the Lindström-Gessel-Viennot Lemma.”
Explicit formulas for p-adic integrals: approach to p-adic distributions and some families of special numbers and polynomials. (2019, unknown): “Zp f (x) dμ−q (x) = [2] d−1 ∑ j=0 (−1)qf(j), (141)”
The optimal unbiased value estimator and its relation to LSTD, TD and MC (2009, unknown): “malization is N = ` s+n−1 n−1 ´ . The derivation can be done in the following way. First, observe that 1 = ` k n 0 ´ . Then, that P s−k 1 ...−k n−2 k n−1=0 ` k n 0 ´ = 1+(s −k1 −2) 1 (e.g. rule 9 in (Aigner, 2006) p. 13). And ﬁnally that P s−k 1...− kn−3 k n−2=0 ` 1+(s − 1... n−2) 1 ´ = P s−k 1...− ”