Christian Stump

Learn More
We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster complexes of finite types. For the latter, the brick polytopes turn out to coincide with the known realizations of generalized(More)
We exhibit a canonical connection between maximal (0, 1)-fillings of a moon polyomino avoiding northeast chains of a given length and reduced pipe dreams of a certain permutation. Following this approach we show that the simplicial complex of such maximal fillings is a vertex-decomposable, and thus shellable, sphere. In particular, this implies a positivity(More)
We study bijections { Set partitions of type X } ˜ −→ { Set partitions of type X } • either the number of crossings and of nestings, • or the cardinalities of a maximal crossing and of a maximal nesting. In type D, the results are obtained only in the case of non-crossing and non-nesting set partitions. In all types, we show in particular that non-crossing(More)
In this paper, we count factorizations of Coxeter elements in well-generated complex reflection groups into products of reflections. We obtain a simple product formula for the exponential generating function of such factor-izations, which is expressed uniformly in terms of natural parameters of the group. In the case of factorizations of minimal length, we(More)
The FindStat project provides an online platform for mathematicians, particularly for combinatorialists, to gather information about combinatorial statistics and their relations. As of January 2014, the FindStat database contains 173 statistics on 17 combinatorial collections. Combinatorial statistics arise naturally all over mathematics. Before we give the(More)