Cycle-Decorated Ribbon Complexes: Cut Coproducts and Alternating-Fence Positivity
Pyuyi Chufeng Huang
Abstract
Let α 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 Sn-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 H1. For the zigzag compositions δn, Zδn(t,-1) is the order polynomial of the alternating fence. We prove \[ n!Zδn(t,-u)∈ N[t,u] \] using coefficientwise nonnegative recurrences derived from a Riccati equation. The same cut data define a nonnegative factorization defect d= n/2-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.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato