Affine permutations of type .
Affine Weyl groups as infinite permutations.
Airy phenomena and analytic combinatorics of connected graphs.
Algebraic and combinatorial properties of products [Abstract of thesis]
Algebraic categories whose projectives are explicitly free.
Algebraic integers as values of elliptic functions
Algorithmische Kombinatorik mit Kleinrechnern.
Algorithmus für Bell'sche Polynome
All polynomials of binomial type are represented by Abel polynomials
Almost all trees have an even number of independent sets.
Almost product evaluation of Hankel determinants.
Alternating, pattern-avoiding permutations.
An algebraic summation over the set of partitions and some strange evaluations
An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral indentities.
An analogue of covering space theory for ranked posets.
An answer to a question by Wilf on packing distinct patterns in a permutation.
An application of Halls' theorems to matrices
An application of Pólya’s enumeration theorem to partitions of subsets of positive integers
Let be a non-empty subset of positive integers. A partition of a positive integer into is a finite nondecreasing sequence of positive integers in with repetitions allowed such that . Here we apply Pólya’s enumeration theorem to find the number of partitions of into , and the number of distinct partitions of into . We also present recursive formulas for computing and .
An application of Ramsey's theory to partitions in groups - I
An application of Tao's analytic method to restricted sumsets