Search Results - (classificacio OR classification) ams::05 combinatorics::05a enumerative combinatorics

Bijections for Baxter families and related objects by Felsner, Stefan, Fusy, Éric, Noy, Marc, Orden, David

“…The Baxter number B n can be written as B n = ∑ k = 0 n Θ k , n − k − 1 with Θ k , ℓ = 2 ( k + 1 ) 2 ( k + 2 ) ( k + ℓ k ) ( k + ℓ + 1 k ) ( k + ℓ + 2 k ) …”
Get full text

Root Polytopes and Growth Series of Root Lattices by Ardila, Federico, Beck, Matthias, Hoşten, Serkan, Pfeifle, Julian, Seashore, Kim

“…The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the…”
Get full text

Extreme Weights in Steinhaus Triangles by Brunat, Josep M., Maureso, Montserrat

“…Let {0=w0<w1<w2<…<wm} be the set of weights of binary Steinhaus triangles of size n, and let Wi be the set of sequences in F2n that generate triangles of…”
Get full text