Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.32009

Transfer systems on trees and opposite posets

Andrew Fargo·Christy Hazel·Deven Platt
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study transfer systems on partially ordered sets whose Hasse diagrams are rooted trees. We prove there is a bijection between transfer systems on a tree and order-preserving functions to the natural numbers that are bounded by the rank function. We then develop a recurrence for the set of functions and use this to enumerate transfer systems on some families of trees. In addition to our study of trees, we prove for any finite poset $\mathcal{P}$, the lattice of transfer systems on the opposite poset $\mathcal{P}^{op}$ is isomorphic to the opposite lattice of transfer systems on $\mathcal{P}$. We show this by establishing a bijection between weak factorization systems and transfer systems, which builds on the results for lattices shown in previous work of Franchere, Ormsby, Osorno, Qin, and Waugh.

Explore related subjects

math.AT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew Fargo, Christy Hazel, Deven Platt. 2026-09-25. Transfer systems on trees and opposite posets. https://arxiv.org/abs/2609.32009

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

KEEP EXPLORING

Related papers

arXiv2026

On Poincaré Surgery

We exhibit a homotopy theoretic proof of the Fundamental Theorem of Poincaré surgery in the simply connected case. We also deduce the Poincaré transversality exact sequence.

math.AT↗
arXiv2026

Borsuk-Ulam type theorem for Stiefel manifolds and orthogonal mass partitions

We prove a Borsuk--Ulam-type zero theorem for the Stiefel manifold $V_{n,k}$ with the free action of the hyperoctahedral group $B_k=(\mathbb{Z}/2)^k\rtimes S_k$. The theorem gives a nonvanishing criterion for explicit polynomials in ${R}_{n,k}=\mathbb{F}_2[a_1,\ldots,a_k]/(a_1^n,a_2^{n-1},\ldots,a_k^{n-k+1})$. We apply this criterion to equipartitions by mutually orthogonal hyperplanes. If $(P_{k,n})^m\ne0$ in ${R}_{d,k}=\mathbb{F}_2[a_1,\ldots,a_k]/(a_1^{d+1},a_2^d,\ldots,a_k^{d-k+2})$, then any $m$ finite Borel measures in $\mathbb{R}^d$ that vanish on affine hyperplanes admit $k$ mutually orthogonal hyperplanes such that every $n$-element subfamily divides each measure into $2^n$ equal parts. For the least possible dimension $Δ^*(m,k,n)$, we obtain general lower bounds and prove upper bounds in several cases. These give exact values, including $Δ^*(2^j-1,k,2)=2^{j-1}(k+1)-1$ for all $j\ge1$ and $k\ge2$. In the case $n=k$, the upper bound of Mani-Levitska, Vrećica, and Zivaljević [18], originally obtained without an orthogonality requirement, remains valid under the stronger requirement that all $k$ hyperplanes be mutually orthogonal.

math.AT↗
arXiv2026

Algebraically and geometrically minimal DG-models of diagrams of spaces

We extend Sullivan's rational homotopy theory by constructing geometrically and algebraically minimal models for diagrams of simply connected spaces over a class of finite indexing categories. Both classes classify rational diagram homotopy types, but their minimality conditions can differ. We also show that, in contrast to classical rational homotopy theory, H-diagrams need not split into products of Eilenberg--MacLane diagrams, and characterize the indexing categories for which every H-diagram admits such a splitting. Also we apply this to computation of automorphism groups of rational homotopy types of certain diagrams of spaces.

math.AT↗