Approximating the isoperimetric number of strongly regular graphs.
Architectonics of Alain Lascoux's preferred formulas. (Architectonique des formules préférées d'Alain Lascoux.)
Association schemes and MacWilliams dualities for generalized Niederreiter-Rosenbloom-Tsfasman posets [Book]
Association schemes of affine type over finite rings.
Asymptotic spectral distributions of distance k-graphs of large-dimensional hypercubes
We derive the asymptotic spectral distribution of the distance k-graph of N-dimensional hypercube as N → ∞.
Asymptotics for random walks in alcoves of affine Weyl groups.
Asymptotics of the number of -words with an -descent.
Asymptotics of Young diagrams and Hook numbers.
Augmented rook boards and general product formulas.
Automorphisms and enumeration of switching classes of tournaments.
Bergman complexes, Coxeter arrangements, and graph associahedra.
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...
Bijections for hook pair identities.
Bijective proofs for Schur function identities which imply Dodgson's condensation formula and Plücker relations.
Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted.
Binary codes and partial permutation decoding sets from the odd graphs
For k ≥ 1, the odd graph denoted by O(k), is the graph with the vertex-set Ωk, the set of all k-subsets of Ω = 1, 2, …, 2k +1, and any two of its vertices u and v constitute an edge [u, v] if and only if u ∩ v = /0. In this paper the binary code generated by the adjacency matrix of O(k) is studied. The automorphism group of the code is determined, and by identifying a suitable information set, a 2-PD-set of the order of k 4 is determined. Lastly, the relationship between the dual code from O(k)...
Bipartition orders and statistics on words. (Ordres bipartitionnaires et statistiques sur les mots.)
Bitableaux bases for some Garsia-Haiman modules and other related modules.
Boolean differential operators
We consider four combinatorial interpretations for the algebra of Boolean differential operators and construct, for each interpretation, a matrix representation for the algebra of Boolean differential operators.
Bottom Schur functions.