Search arXivSearch

arXiv · 2601.13324

Ribbon complexes for the 0-Hecke algebra

Abstract

We construct explicit tableau-level maps between indecomposable projective modules for the type A 0-Hecke algebra that assemble into canonical split short exact sequences lifting the basic ribbon product rule in NSym via concatenation and near-concatenation. Iterating these maps yields cochain complexes indexed by generalized ribbons; we prove these complexes are acyclic in positive degrees and that their zeroth cohomology is the projective module indexed by full concatenation. We apply these complexes, together with VandeBogert's ribbon Schur module criterion, to prove Koszulness for a naturally defined internally graded algebra object built from the 0-Hecke tower. Finally, we define skew projective modules whose noncommutative Frobenius characteristics realize skewing by fundamental quasisymmetric functions on NSym.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ayah Almousa, Bryan Lu. 2026-01-19. Ribbon complexes for the 0-Hecke algebra. https://arxiv.org/abs/2601.13324

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO