Binary -words without the subword 1010. . . 10.
Binary relations on the power set of an -element set.
Binary segmentation and Bonferroni-type bounds
We introduce the function , where and are the pdf and cdf of , respectively. We derive two recurrence formulas for the effective computation of its values. We show that with an algorithm for this function, we can efficiently compute the second-order terms of Bonferroni-type inequalities yielding the upper and lower bounds for the distribution of a max-type binary segmentation statistic in the case of small samples (where asymptotic results do not work), and in general for max-type random variables...
Binary strings without zigzags.
Binary words containing infinitely many overlaps.
Binomial coefficients.
Binomial sums via Bailey's cubic transformation
By employing one of the cubic transformations (due to W. N. Bailey (1928)) for the -series, we examine a class of -series. Several closed formulae are established by means of differentiation, integration and contiguous relations. As applications, some remarkable binomial sums are explicitly evaluated, including one proposed recently as an open problem.
Bipartition orders and statistics on words. (Ordres bipartitionnaires et statistiques sur les mots.)
Blocks for symmetric groups and their covering groups and quadratic forms.
Bonferroni-Galambos inequalities for partition lattices.
Boole's formula as a consequence of Lagrange's interpolating polynomial theorem.
Bounds for the eventual positivity of difference functions of partitions into prime powers.
Bounds on the number of integer valued monotone functions of k integer arguments
Brève communication. Transformation du problème de partitionnement en un problème d'ensemble stable de poids maximal
Broken Circuits in Matroids-Dohmen’s Inductive Proof
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids