SearcharxivSearch

arXiv · 2507.00283

Continuous Noncrossing Partitions and Weighted Circular Factorizations

Abstract

This article examines noncrossing partitions of the unit circle in the complex plane; we call these continuous noncrossing partitions. More precisely, we focus on the degree-$d$ continuous noncrossing partitions where unit complex numbers in the same block have identical $d$-th powers. We prove that the degree-$d$ continuous noncrossing partitions form a topological poset whose uncountable set of elements can be indexed by equivalence classes of objects we call weighted linear factorizations of factors of a $d$-cycle. Moreover, the maximal elements in this poset form a subspace homeomorphic to the dual Garside classifying space for the $d$-strand braid group. The degree-$d$ continuous noncrossing partitions of the unit circle are a special case of a more general construction. For every choice of Coxeter element $c$ in any Coxeter group $W$ we define a topological poset of equivalence classes of weighted linear factorizations of factors of $c$ in $W$ whose elements we call continuous $c$-noncrossing partitions. The maximal elements in this poset form a subspace homeomorphic to the one-vertex complex whose fundamental group is the corresponding dual Artin group.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Dougherty, Jon McCammond. 2025-06-30. Continuous Noncrossing Partitions and Weighted Circular Factorizations. https://arxiv.org/abs/2507.00283

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR