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.
Towards a human proof of Gessel's conjecture.
Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs.
Transitivity and partial order
In this paper we find a one-to-one correspondence between transitive relations and partial orders. On the basis of this correspondence we deduce the recurrence formula for enumeration of their numbers. We also determine the number of all transitive relations on an arbitrary -element set up to .
Transversal and cotransversal matroids via their representations.