Binary search trees (BSTs) are a class of simple data structures used to store and access keys from an ordered set. They have been around for about half a century. Despite their ubiquitous use in practical programs, ...

Let G be a connected reductive algebraic group over an algebraically closed field of characteristic p, g the Lie algebra of G and g* the dual vector space of g. This thesis is concerned with nilpotent orbits in g and g* ...

Let A be an Ax ring spectrum. We give an explicit construction of topological Hochschild homology and cohomology of A using the Stasheff associahedra and another family of polyhedra called cyclohedra. Using this construction ...

The noncommutative symmetric functions Sym of Gelfand et al. give not only a lifting of the well-developed commutative theory of symmetric functions to the non-commutative level, but also relate the descent algebras of ...