# k-indivisible noncrossing partitions

@article{Muhle2019kindivisibleNP, title={k-indivisible noncrossing partitions}, author={Henri Muhle and Philippe Nadeau and Nathan Williams}, journal={arXiv: Combinatorics}, year={2019} }

For a fixed integer k, we consider the set of noncrossing partitions, where both the block sizes and the difference between adjacent elements in a block is 1 mod k. We show that these k-indivisible noncrossing partitions can be recovered in the setting of subgroups of the symmetric group generated by (k+1)-cycles, and that the poset of k-indivisible noncrossing partitions under refinement order has many beautiful enumerative and structural properties. We encounter k-parking functions and some… Expand

#### 2 Citations

A poset structure on the alternating group generated by 3-cycles

- Mathematics
- Algebraic Combinatorics
- 2019

We investigate the poset structure on the alternating group which arises when the latter is generated by $3$-cycles. We study intervals in this poset and give several enumerative results, as well as… Expand

$k$-Factorizations of the full cycle and generalized Mahonian statistics on $k$-forest

- Mathematics
- 2021

We develop a direct bijections between the set F n of minimal factorizations of the long cycle (0 1 · · · kn) into (k+ 1)-cycle factors and the set Rn of rooted labelled forests on vertices {1, . . .… Expand

#### References

SHOWING 1-10 OF 44 REFERENCES

Parking Functions of Types A and B

- Computer Science, Mathematics
- Electron. J. Comb.
- 2002

The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parking functions. We use… Expand

Noncrossing partitions

- Computer Science, Mathematics
- Discret. Math.
- 2000

In a 1972 paper, Germain Kreweras investigated noncrossing partitions under the re nement order relation. His paper set the stage both for a wealth of further enumerative results, and for new… Expand

Non-crossing partitions

- Mathematics
- Spectral Structures and Topological Methods in Mathematics
- 2019

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… Expand

Some properties of crossings and partitions

- Computer Science, Mathematics
- Discret. Math.
- 1997

Using a group theoretical interpretation of the lattice of non-crossing partitions of a cycle of length m, it is proved that the group of skew-automorphisms of this lattice is isomorphic to the dihedral group D4m. Expand

The combinatorial relationship between trees, cacti and certain connection coefficients for the symmetric group

- Computer Science, Mathematics
- Eur. J. Comb.
- 1992

A combinatorial bijection is given between pairs of permutations in S n the product of which is a given n -cycle and two-coloured plane edge-rooted trees on n edges, when the numbers of cycles in the… Expand

Noncrossing hypertrees

- Mathematics
- 2015

Hypertrees and noncrossing trees are well-established objects in the combinatorics literature, but the hybrid notion of a noncrossing hypertree has received less attention. In this article I… Expand

Euler Characteristic of the Truncated Order Complex of Generalized Noncrossing Partitions

- Mathematics, Computer Science
- Electron. J. Comb.
- 2009

The Euler characteristic of this poset with the maximal and minimal elements deleted is calculated and it is shown that this result extends to generalized noncrossing partitions associated to well-generated complex reflection groups. Expand

Noncrossing Partitions in Surprising Locations

- Mathematics, Computer Science
- Am. Math. Mon.
- 2006

The noncrossing partition lattice is introduced in three of its many guises: as a way to encode parking functions, as a key part of the foundations of noncommutative probability, and as a buildingblock for a contractible space acted on by a braid group. Expand

Cataland: Why the Fuß?

- Mathematics
- 2019

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… Expand

Minimal Factorizations of a Cycle and Central Multiplicative Functions on the Infinite Symmetric Group

- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 1996

We show that the number of factorizations?=?1??rof a cycle of lengthninto a product of cycles of lengthsa1, ?, ar, with ?rj=1(aj?1)=n?1, is equal tonr?1. This generalizes a well known result of J.… Expand