Related papers: Enumerative properties of Grid-Associahedra
We initiate the study of model structures on (categories induced by) lattice posets, a subject we dub homotopical combinatorics. In the case of a finite total order $[n]$, we enumerate all model structures, exhibiting a rich combinatorial…
We present a simple criterion for solvability of lattice spin systems on the basis of the graph theory and the simplicial homology. The lattice systems satisfy algebras with graphical representations. It is shown that the null spaces of…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…
The Catalan triangle, as well as a Fuss-Catalan triangle, enter a problem of counting particular tied arc diagrams. This setting allows us to prove some combinatorial properties of these triangles.
We interpret the support $\tau$-tilting complex of any gentle bound quiver as the non-kissing complex of walks on its blossoming quiver. Particularly relevant examples were previously studied for quivers defined by a subset of the grid or…
It is well known that the number of distinct non-crossing matchings of $n$ half-circles in the half-plane with endpoints on the x-axis equals the $n^{th}$ Catalan number $C_n$. This paper generalizes that notion of linear non-crossing…
A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…
We situate the noncrossing partitions associated to a finite Coxeter group within the context of the representation theory of quivers. We describe Reading's bijection between noncrossing partitions and clusters in this context, and show…
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
Non-crossing partitions have been a staple in combinatorics for quite some time. More recently, they have surfaced (sometimes unexpectedly) in various other contexts from free probability to classifying spaces of braid groups. Also,…
This paper studies graphical analogs of symmetric products and unordered configuration spaces in topology. We do so from the perspective of the discrete homotopy theory introduced by Barcelo et al. Our first result is a combinatorial…
When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…
We outline the main features of the definitions and applications of crossed complexes and cubical $\omega$-groupoids with connections. These give forms of higher homotopy groupoids, and new views of basic algebraic topology and the…
In this article we study combinatorial non-positive curvature aspects of various simplicial complexes with natural $\widetilde A_n$ shaped simplicies, including Euclidean buildings of type $\widetilde A_n$ and Cayley graphs of Garside…
If g is a quasitriangular Lie bialgebra, one can asks what is the geometrical meaning of its r-matrix. A first answer was given in a paper by Weinstein and Xu, using purely geometrical means: roughly, one has that the formal Poisson group…
We describe a series of complexes that relate to the braid groups as the matching complexes relate to the symmetric groups. A modified construction applies as well to other complexes based on edge sets in graphs. We show that our…
In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…
For a pair $(G,\mathcal{P})$ consisting of a group and finite collection of subgroups, we introduce a simplicial $G$-complex $\mathcal{K}(G,\mathcal{P})$ called the coset intersection complex. We prove that the quasi-isometry type and the…
The main invariant to study the combinatorics of a simplicial complex $K$ is the associated face ring or Stanley-Reisner algebra. Reisner respectively Stanley explained in which sense Cohen-Macaulay and Gorenstein properties of the face…