Papers
Topics
Authors
Recent
Search
2000 character limit reached

Meet obstructions and saturation for the constant window convolution on graded posets

Published 20 Aug 2026 in math.AT, math.CO, and math.CT | (2608.19904v1)

Abstract: Let P\mathsf{P} be a finite graded poset and Δ<em>a<sup>PΔ<em>a<sup>{\mathsf{P}} the height-aa thickening of its diagonal. We study the \emph{window convolution} Ca=q</em>1(kΔ<em>a<sup>P<sup></sup></sup>Lq2<sup>())C_a=q</em>{1\sharp}(k_{Δ<em>a<sup>{\mathsf{P}}}\otimes<sup>{\mathbf</sup></sup> L}q_2<sup>\ast(-)) on Shv(P;k)\mathrm{Shv}(\mathsf{P};k). An interleaving distance needs the left derived LCa\mathbb{L}C_a to compose as a flow, LCaLCbLC</em>a+b\mathbb{L}C_a\mathbb{L}C_b\simeq\mathbb{L}C</em>{a+b}; the total meet functor ΦΦ gives rise to the canonical comparison. Finality is sufficient, and necessary where the finality defect of ΦΦ is essential; where ΦΦ is total at a minimal apex with unit windows, it is the failure of a length-two interval to have a single interior element. The flow fails at every branching length-two interval, and with it on the face poset of every finite regular cell complex of dimension 2\ge2. It survives on tame posets, where idLCa\mathrm{id}\Rightarrow\mathbb{L}C_a gives a canonical extended interleaving pseudometric on D<sup>b(Shv(P;k))\operatorname{D<sup>{b}}(\mathrm{Shv}(\mathsf{P};k)); in the saturation cases computed here it takes no finite value above the length of P\mathsf{P}, and is finite if and only if the derived colimits agree.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.