The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks.
The umbral transfer-matrix method. V: The Goulden-Jackson cluster method for infinitely many mistakes.
The visibility parameter for words and permutations
We investigate the visibility parameter, i.e., the number of visible pairs, first for words over a finite alphabet, then for permutations of the finite set {1, 2, …, n}, and finally for words over an infinite alphabet whose letters occur with geometric probabilities. The results obtained for permutations correct the formula for the expectation obtained in a recent paper by Gutin et al. [Gutin G., Mansour T., Severini S., A characterization of horizontal visibility graphs and combinatorics on words,...
The weighted hook length formula. III: Shifted tableaux.
Théorie des permutations et des arrangements circulaires complets
There are no Golay complementary sequences of length 2.9t.
Three aspects of partitions.
Three generalizations of Weyl's denominator formula.
Three Notes on Permutations.
Three recitations on holonomic systems and hypergeometric series.
Three restricted product-sum partition functions
Three-letter-pattern avoiding permutations and functional equations.
Tiling a -board with squares and dominoes.
Tilings by translation: enumeration by a rational language approach.
Tolerante Catalanzahlen
Topological degree and Sperner's lemma
Topological multidimensional van der Waerden theorem
Totally greedy coin sets and greedy obstructions.
Touchard polynomials, partial Bell polynomials and polynomials of binomial type.
Tournament sequences and Meeussen sequences.