Bases of certain finite groups
Bases of classes of trees closed under subdivisions
Bases of web Configurations
Basic calculus of signed permutations. II: Finite analogues of Bessel functions. (Calcul basique des permutations signées. II: Analogues finis des fonctions de Bessel.)
Basic hypergeometric identities: An introductory revisiting through the Carlitz inversions.
Basic polyhedra in knot theory
Bass and Serre theory and Nielsen transformations (free and free product case)
Baxter permutations and plane bipolar orientations.
Baxter permutations. (Permutations de Baxter.)
Bell and Stirling numbers for graphs.
Bell polynomials and degenerate stirling numbers
Bender's generalized q-binominal Vandermonde convolution.
Bent Hamilton cycles in -dimensional grid graphs.
Bergman complexes, Coxeter arrangements, and graph associahedra.
Best simultaneous diophantine approximations of some cubic algebraic numbers
Let be a real algebraic number of degree over whose conjugates are not real. There exists an unit of the ring of integer of for which it is possible to describe the set of all best approximation vectors of .’
Bethe Ansatz and the geography of rigged strings
We demonstrate the way in which composition of two famous combinatorial bijections, of Robinson-Schensted and Kerov-Kirillov-Reshetikhin, applied to the Heisenberg model of magnetic ring with spin 1/2, defines the geography of rigged strings (which label exact eigenfunctions of the Bethe Ansatz) on the classical configuration space (the set of all positions of the system of r reversed spins). We point out that each l-string originates, in the language of this bijection, from an island of l consecutive...
Betti numbers of monomial ideals and shifted skew shapes.
Betti numbers of some circulant graphs
Let be the greatest odd integer less than or equal to . In this paper we provide explicit formulae to compute -graded Betti numbers of the circulant graphs . We do this by showing that this graph is the product (or join) of the cycle by itself, and computing Betti numbers of . We also discuss whether such a graph (more generally, ) is well-covered, Cohen-Macaulay, sequentially Cohen-Macaulay, Buchsbaum, or .
Betweenness spaces and tree algebras
BG-ranks and 2-cores.