Combinatorial analysis of quicksort algorithm
The existence and uniqueness (up to equivalence defined below) of code loops was first established by R. Griess in [3]. Nevertheless, the explicit construction of code loops remained open until T. Hsu introduced the notion of symplectic cubic spaces and their Frattini extensions, and pointed out how the construction of code loops followed from the (purely combinatorial) result of O. Chein and E. Goodaire contained in [2]. Within this paper, we focus on their combinatorial construction and prove...
We construct bases of standard (i.e. integrable highest weight) modules L(Λ) for affine Lie algebra of type B 2(1) consisting of semi-infinite monomials. The main technical ingredient is a construction of monomial bases for Feigin-Stoyanovsky type subspaces W(Λ) of L(Λ) by using simple currents and intertwining operators in vertex operator algebra theory. By coincidence W(kΛ0) for B 2(1) and the integrable highest weight module L(kΛ0) for A 1(1) have the same parametrization of combinatorial bases...
We provide combinatorial interpretations for three new classes of partitions, the so-called chromatic partitions. Using only combinatorial arguments, we show that these partition identities resemble well-know ordinary partition identities.