Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.12633

The first homology of square-section braid groups

Minh Pham·Nicholas Wawrykow·Jacob Zweiback
View original source ↗Read source document ↗Export metadata ↓

Abstract

We compute the first homology of the unordered configuration space of $n$ open unit-squares in the $w$ by $h$ rectangle for all positive integers $n$, $w$, and $h$. Letting $w$ and $h$ vary, these square configuration spaces form a bi-filtration of the unordered configuration space of $n$ points in the plane, so their fundamental groups approximate the $n$-strand braid group. Using a pair of spectral sequences, we prove that these square and point configuration spaces have naturally isomorphic first homology groups if $w,h\ge 3$ and $n\le wh-3$. In the $h=2$ case, we show that the first homology groups of these square configuration spaces are free of rank $n-1$ for $n\le 2w-2$, whereas they are free of rank $w-1$ for $n=2w-1$.

Explore related subjects

math.AT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Minh Pham, Nicholas Wawrykow, Jacob Zweiback. 2026-10-08. The first homology of square-section braid groups. https://arxiv.org/abs/2610.12633

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

KEEP EXPLORING

Related papers

arXiv2026

The Becker-Gottlieb transfer is not functorial: An example using $C_\infty$-algebras

We prove that the Becker-Gottlieb transfer is not functorial, even on rational cohomology. More precisely, for any even $n \ge 4$, we construct a fibration $f \colon X \to S^{n+1}$ with fiber $S^2 \vee S^n$, and an oriented $S^1$-bundle $g \colon Y \to X$ such that the transfer of $f \circ g$ is non-trivial on rational cohomology. Since the transfer of an oriented $S^1$-bundle vanishes, this implies that the transfer of $f \circ g$ and the composite of the transfers of $f$ and $g$ induce different maps on rational cohomology and are thus not homotopic. The proof that the transfer of $f \circ g$ is non-trivial uses the rational models for the Becker--Gottlieb and THH transfers obtained in previous work of the authors. In the appendix, we provide a second, more involved proof that relies on constructing explicit $C_\infty$-algebra models for odd spherical fibrations (including circle bundles), which might be of independent interest. Concurrently, another counterexample (of a very different flavor) was found by Georg Lehner, Cary Malkiewich, and the first author.

math.AT↗
arXiv2026

Infinity operad pairs, higher distributivity and spectral Tambara functors

We introduce an $\infty$-categorical model of operad pairs and their associated bimonoidal categories. We study the related concepts such as cocartesian-cartesian operad pairs, algebra pairs and the Day convolution. Using the Day convolution for operad pairs, we can define distributive functors between a symmetric bimonoidal category and a cartesian closed monoidal category. As an application, we show that for a finite group $G$, the operadic distributive functors from $\mathrm{Span}(\mathsf{Fin}_G)$ to any cartesian closed monoidal category coincides with the distributive functors defined by the distributive diagram. Therefore, we show that the connective $G$-equivariant $\mathbb{E}_{\infty}$-ring spectra are equivalently the spectral $G$-Tambara functors.

math.AT↗
arXiv2026

Analysing Multiscale Clusterings with Persistent Homology

In data clustering, it is often desirable to find not just a single partition into clusters but a sequence of partitions that describes the data at different scales (or levels of coarseness). A natural problem then is to analyse and compare, as a whole, the (not necessarily hierarchical) sequences of partitions that underpin such multiscale descriptions. Using tools from topological data analysis, we introduce here the Multiscale Clustering Filtration (MCF), a filtration of abstract simplicial complexes that encodes arbitrary cluster assignments in a sequence of partitions across scales of increasing coarseness. We prove the stability of the MCF with respect to small changes in the sequence of partitions, and establish that its persistence diagram (PD) provides an interpretable representation of the multiscale clustering: at dimension 0, it captures violations of the refinement order, and at higher dimensions, it tracks the emergence and resolution of higher-order inconsistencies between cluster assignments. We also introduce an equivalent construction of the MCF via a nerve complex filtration, and show that this nerve-based MCF has computational advantages in certain settings, aiding scalability. Further, we show that in the hierarchical case, the MCF reduces to a Vietoris-Rips filtration of an ultrametric space, and we establish that pairwise measures, such as conditional entropy or zigzag persistence, are fully determined by a graph representation of the Sankey diagram and thus fail to describe the higher-order inconsistencies across scales that MCF captures. Using synthetic and real-world data from stochastic block models, single-cell transcriptomics and temporal social interactions, we illustrate how the MCF PD serves to characterise and compare multiscale clusterings beyond pairwise or hierarchical baseline methods.

math.AT↗