Search arXivSearch

arXiv · 2608.07599

Cycle-Decorated Ribbon Complexes: Cut Coproducts and Alternating-Fence Positivity

Abstract

Let $α\models n$. We define a two-variable specialization $Z_α(t,q)$ of the ribbon basis of noncommutative symmetric functions from cycle enumerators of an ordinary permutation and a rooted permutation, with $q$ recording reflection length. We realize $n!Z_α(t,q)$ as the shifted bigraded Euler characteristic of an $\mathfrak S_n$-equivariant ordered-set-partition complex. When $α$ has at most one odd part, each total decoration determines a set of simultaneous factorization cuts, and its fiber is the classical ribbon complex indexed by that cut set. This gives explicit nonnegative ribbon expansions for every bigraded homology representation. Organizing the complexes on labelled finite sets yields a counital differential graded comonoid in the Cauchy monoidal category of species, whose cut coproduct is compatible with the fiber decomposition. At a factorization cut, the induced map on top homology is injective; its cokernel has the near-concatenation ribbon character, and the kernel of the aggregate reduced cut coproduct on homology is $H_1$. For the zigzag compositions $δ_n$, $Z_{δ_n}(t,-1)$ is the order polynomial of the alternating fence. We prove \[ n!Z_{δ_n}(t,-u)\in\mathbb N[t,u] \] using coefficientwise nonnegative recurrences derived from a Riccati equation. The same cut data define a nonnegative factorization defect $d=\lceil n/2\rceil-k-j$, which controls the homological support and makes the Euler sign constant on each defect layer. We also determine the full defect-zero edge by explicit Frobenius-character formulas.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pyuyi Chufeng Huang. 2026-08-15. Cycle-Decorated Ribbon Complexes: Cut Coproducts and Alternating-Fence Positivity. https://arxiv.org/abs/2608.07599

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO