On donnera une formule pour l’op´erateur Hqt 2 avec la propri´et´e que Hqt 2 H(2a1b)[X; q, t] = H(2a+11b)[X; q, t] avec les fonctions sym´etriques Hµ[X; q, t] = λ Kλµ(q,...
A basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h cycles of the basis. The basis number b(G) of G is the least integer h such that C(G) ...
An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The e...
Ladner [18] showed that there are no minimal recursive sets under polynomial-time reductions. Given any recursive set A, Ladner constructs a set B such that B strictly reduces to ...