The identity of three classes of polynomials.
The initial involution patterns of permutations.
The insertion encoding of permutations.
The integer sequence A002620 and upper antagonistic functions.
The Josephus problem
We give explicit non-recursive formulas to compute the Josephus-numbers and and explicit upper and lower bounds for (where ) which differ by (for the bounds are even better). Furthermore we present a new fast algorithm to calculate which is based upon the mentioned bounds.
The Kazandzidis supercongruences. A simple proof and an application
The kernel method: a collection of examples.
The Lagrange inversion formula and divisibility properties.
The Largest Subdeterminant of a Matrix
The last digit of and .
The lattice of threshold graphs.
The Lotharingian impact on combinatorial mathematics: Myth or reality?
The major counting of nonintersecting lattice paths and generating functions for tableaux. (Summary).
The many formulae for the number of Latin rectangles.
The map asymptotics constant .
The Markov-WZ method.
The maximum number of perfect matchings in graphs with a given degree sequence.
The minimum number of monotone subsequences.
The Möbius function of the consecutive pattern poset.
The moments of partitions, I