Binary multiples of combinatorial geometries - II
Binary -words without the subword 1010. . . 10.
Binary Polyhedral Groups and Euclidean Diagrams.
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 residues
A binomial residue is a rational function defined by a hypergeometric integral whose kernel is singular along binomial divisors. Binomial residues provide an integral representation for rational solutions of -hypergeometric systems of Lawrence type. The space of binomial residues of a given degree, modulo those which are polynomial in some variable, has dimension equal to the Euler characteristic of the matroid associated with .
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.
Bioctic Gauss sums and sixteenth power residue difference sets
Bipartite coverings and the chromatic number.
Bipartite diametrical graphs of diameter 4 and extreme orders.
Bipartite graphs that are not circle graphs
The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in .At the end of this short note I briefly recall the work of François Jaeger on circle graphs.
Bipartite intersection graphs
Bipartite knots
We give a solution to a part of Problem 1.60 in Kirby's list of open problems in topology, thus answering in the positive the question raised in 1987 by J. Przytycki.
Bipartite toughness and -factors in bipartite graphs.
Bipartite-uniform hypermaps on the sphere.
Bipartition orders and statistics on words. (Ordres bipartitionnaires et statistiques sur les mots.)
Bipartition Polynomials, the Ising Model, and Domination in Graphs
This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition polynomial, permits a variety of interesting representations, for instance as a sum ranging over all spanning forests. As a consequence, the bipartition polynomial is a powerful tool for proving properties of other graph polynomials and graph invariants....