Searcharxiv⌕ Search

arXiv subjects

Christian Stump

Publications and source records attributed to Christian Stump.

At least 37 records · Page 2Linked to original sources

Freeness of multi-reflection arrangements via primitive vector fields

In 2002, Terao showed that every reflection multi-arrangement of a real reflection group with constant multiplicity is free by providing a basis of the module of derivations. We first generalize Terao's result to multi-arrangements stemming from well-generated unitary reflection groups, where the multiplicity of a hyperplane depends on the order of its stabilizer. Here the exponents depend on the exponents of the dual reflection representation. We then extend our results further to all imprimitive irreducible unitary reflection groups. In this case the exponents turn out to depend on the exponents of a certain Galois twist of the dual reflection representation that comes from a Beynon-Lusztig type semi-palindromicity of the fake degrees.

math.GR↗

Cataland: Why the Fuss?

The three main objects in noncrossing Catalan combinatorics associated to a finite Coxeter system are noncrossing partitions, clusters, and sortable elements. The first two of these have known Fuss-Catalan generalizations. We provide new viewpoints for both and introduce the missing generalization of sortable elements by lifting the theory from the Coxeter system to the associated positive Artin monoid. We show how this new perspective ties together all three generalizations, providing a uniform framework for noncrossing Fuss-Catalan combinatorics. Having developed the combinatorial theory, we provide an interpretation of our generalizations in the language of the representation theory of hereditary Artin algebras.

math.CO↗

The EKR property for flag pure simplicial complexes without boundary

We prove that the family of facets of a pure simplicial complex of dimension up to three satisfies the Erdős-Ko-Rado property whenever it is flag and has no boundary ridges. We conjecture the same to be true in arbitrary dimension and give evidence for this conjecture. Our motivation is that complexes with these two properties include flag pseudo-manifolds and cluster complexes.

math.CO↗

Double deficiencies of Dyck paths via the Billey-Jockusch-Stanley bijection

We prove a recent conjecture by René Marczinzik involving certain statistics on Dyck paths that originate in the representation theory of Nakayama algebras of a linearly oriented quiver. We do so by analysing the effect of the Billey-Jockusch-Stanley bijection between Dyck paths and 321-avoiding permutations on these statistics, which was suggested by the result of a query issued to the online database FindStat.

math.CO↗

Lipschitz polytopes of posets and permutation statistics

We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that generalize descents and big ascents. For ranked posets, Lipschitz polytopes are centrally-symmetric and Gorenstein, which implies symmetry and unimodality of the statistics. Finally, we define $(P,k)$-hypersimplices as generalizations of classical hypersimplices and give combinatorial interpretations of their volumes and $h^*$-vectors.

math.CO↗

Towards a uniform subword complex description of acyclic finite type cluster algebras

It has been established in recent years how to approach acyclic cluster algebras of finite type using subword complexes. In this paper, we continue this study by describing the c- and g-vectors, and by providing a conjectured description of the Newton polytopes of the F-polynomials. In particular, we show that this conjectured description would imply that finite type cluster complexes are realized by the duals of the Minkowski sums of the Newton polytopes of either the F-polynomials, or of the cluster variables, respectively.

math.CO↗

Brick polytopes of spherical subword complexes and generalized associahedra

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 associahedra, thus opening new perspectives on these constructions. This new approach yields in particular the vertex description of generalized associahedra, a Minkowski sum decomposition into Coxeter matroid polytopes, and a combinatorial description of the exchange matrix of any cluster in a finite type cluster algebra.

math.CO↗

On non-conjugate Coxeter elements in well-generated reflection groups

Given an irreducible well-generated complex reflection group W with Coxeter number h, we call a Coxeter element any regular element (in the sense of Springer) of order h in W; this is a slight extension of the most common notion of Coxeter element. We show that the class of these Coxeter elements forms a single orbit in W under the action of reflection automorphisms. For Coxeter and Shephard groups, this implies that an element c is a Coxeter element if and only if there exists a simple system S of reflections such that c is the product of the generators in S. We moreover deduce multiple further implications of this property. In particular, we obtain that all noncrossing partition lattices of W associated to different Coxeter elements are isomorphic. We also prove that there is a simply transitive action of the Galois group of the field of definition of W on the set of conjugacy classes of Coxeter elements. Finally, we extend several of these properties to Springer's regular elements of arbitrary order.

math.CO↗

Counting factorizations of Coxeter elements into products of reflections

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 factorizations, which is expressed uniformly in terms of natural parameters of the group. In the case of factorizations of minimal length, we recover a formula due to P. Deligne, J. Tits and D. Zagier in the real case and to D. Bessis in the complex case. For the symmetric group, our formula specializes to a formula of D. M. Jackson.

math.CO↗

Noncrossing sets and a Graßmann associahedron

We study a natural generalization of the noncrossing relation between pairs of elements in [n] to k-tuples in [n] that was first considered by Petersen, Pylyavskyy, Speyer (2010). We give an alternative approach to their result that the flag simplicial complex on $\binom{[n]}{k}$ induced by this relation is a regular, unimodular and flag triangulation of the order polytope of the poset given by the product $[k]\times[n-k]$ of two chains (also called Gelfand-Tsetlin polytope), and that it is the join of a simplex and a sphere (that is, it is a Gorenstein triangulation). We then observe that this already implies the existence of a flag simplicial polytope generalizing the dual associahedron, whose Stanley-Reisner ideal is an initial ideal of the Graßmann-Plücker ideal, while previous constructions of such a polytope did not guarantee flagness nor reduced to the dual associahedron for k=2. On our way we provide general results about order polytopes and their triangulations. We call the simplicial complex the noncrossing complex, and the polytope derived from it the dual Graßmann associahedron. We extend results of Petersen, Pylyavskyy, Speyer (2010) showing that the non-crossing complex and the Graßmann associahedron naturally reflect the relations between Graßmannians with different parameters, in particular the isomorphism $G_{k,n} \cong G_{n-k,n}$. Moreover, our approach allows us to show that the adjacency graph of the noncrossing complex admits a natural acyclic orientation that allows us to define a Graßmann-Tamari order on maximal noncrossing families. Finally, we look at the precise relation of the noncrossing complex and the weak separability complex of Leclerc, Zelevinsky (1998) and show that the weak separability complex is the cyclically invariant part of the noncrossibg complex.

math.CO↗

On a new collection of words in the Catalan family

In this note, we provide a bijection between a new collection of words on nonnegative integers of length n and Dyck paths of length 2n-2, thus proving that this collection belongs to the Catalan family. The surprising key step in this bijection is the zeta map which is an important map in the study of q,t-Catalan numbers. Finally we discuss an alternative approach to this new collection of words using two statistics on planted trees that turn out to be closely related to the Tutte polynomial on the Catalan matroid.

math.CO↗

A note on the transitive Hurwitz action on decompositions of parabolic Coxeter elements

In this note, we provide a short and self-contained proof that the braid group on n strands acts transitively on the set of reduced factorizations of a Coxeter element in a Coxeter group of finite rank n into products of reflections. We moreover use the same argument to also show that all factorizations of an element in a parabolic subgroup of W lie as well in this parabolic subgroup.

math.GR↗

FindStat - the combinatorial statistics database

The FindStat project at www.FindStat.org provides an online platform for mathematicians, particularly for combinatorialists, to gather information about combinatorial statistics and their relations. This outline provides an overview over the project.

math.CO↗

More bijective Catalan combinatorics on permutations and on signed permutations

In this paper, we construct bijections between Dyck paths, noncrossing partitions, and 231-avoiding permutations, which send the area statistic on Dyck paths to the inversion number on noncrossing partitions and on 231-avoiding permutations. This bijection has the additional property that it simultaneously sends the major index on Dyck paths to the sum of the major index and the inverse major index on noncrossing partitions and on 231-avoiding permutations, respectively. Moreover, we provide generalizations of these constructions to the group of signed permutations.

math.CO↗

Subword complexes, cluster complexes, and generalized multi-associahedra

In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called multi-cluster complex. For k=1, we show that this subword complex is isomorphic to the cluster complex of the given type. We show that multi-cluster complexes of types A and B coincide with known simplicial complexes, namely with the simplicial complexes of multi-triangulations and centrally symmetric multi-triangulations respectively. Furthermore, we show that the multi-cluster complex is universal in the sense that every spherical subword complex can be realized as a link of a face of the multi-cluster complex.

math.CO↗

EL-labelings and canonical spanning trees for subword complexes

We describe edge labelings of the increasing flip graph of a subword complex on a finite Coxeter group, and study applications thereof. On the one hand, we show that they provide canonical spanning trees of the facet-ridge graph of the subword complex, describe inductively these trees, and present their close relations to greedy facets. Searching these trees yields an efficient algorithm to generate all facets of the subword complex, which extends the greedy flip algorithm for pointed pseudotriangulations. On the other hand, when the increasing flip graph is a Hasse diagram, we show that the edge labeling is indeed an EL-labeling and derive further combinatorial properties of paths in the increasing flip graph. These results apply in particular to Cambrian lattices, in which case a similar EL-labeling was recently studied by M. Kallipoliti and H. Mühle.

math.CO↗

On root posets for noncrystallographic root systems

We discuss properties of root posets for finite crystallographic root systems, and show that these properties uniquely determine root posets for the noncrystallographic dihedral types and type $H_3$, while proving that there does not exist a poset satisfying all of the properties in type $H_4$. We do this by exhaustive computer searches for posets having these properties. We further give a realization of the poset of type $H_3$ as restricted roots of type $D_6$, and conjecture a Hilbert polynomial for the $q,t$-Catalan numbers for type $H_4$.

math.CO↗