Baire classification and infinite perceptrons
Balancing cyclic -ary Gray codes.
Balancing cyclic -ary Gray codes. II.
Bifurcation analysis of a van der Pol-Duffing circuit with parallel resistor.
Boolean functions represented by random formulas
Bounded expansion in web graphs
In this paper we study various models for web graphs with respect to bounded expansion. All the deterministic models even have constant expansion, whereas the copying model has unbounded expansion. The most interesting case turns out to be the preferential attachment model --- which we conjecture to have unbounded expansion, too.
Brève communication. Transformation du problème de partitionnement en un problème d'ensemble stable de poids maximal