Compatibility conjecture for structured decompositions of persistent narratives

From papers

Let T\textup{\textsf{T}} be a finite discrete time category, let (C,G,Ω)(\mathcal{C},\mathcal{G},\Omega) be a spined sd-category with the additional structure required for persistent narratives, and write D(C)\mathfrak{D}(\mathcal{C}) for the category of structured decompositions in C\mathcal{C}. Let D(Pe(T,C))\mathfrak{D}(\textup{\textsf{Pe}}(\textup{\textsf{T}},\mathcal{C})) denote the category of structured decompositions of persistent narratives and Pe(T,D(C))\textup{\textsf{Pe}}(\textup{\textsf{T}},\mathfrak{D}(\mathcal{C})) the category of persistent narratives of structured decompositions. Compatibility conjecture. Under appropriate assumptions, there exists a fully faithful functor, injective on objects,

D(Pe(T,C))Pe(T,D(C)).\mathfrak{D}(\textup{\textsf{Pe}}(\textup{\textsf{T}},\mathcal{C})) \hookrightarrow \textup{\textsf{Pe}}(\textup{\textsf{T}},\mathfrak{D}(\mathcal{C})).

Such an embedding would formalize the compatibility between forming structured decompositions and forming persistent narratives, allowing concepts and results for one construction to be transferred to the other. The source leaves the appropriate assumptions and the existence of this functor as an open question.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Benjamin Merlin Bumpus and Jana K. Nickel, “Decomposing time-varying data into simple pieces: structured decompositions of narratives”, arXiv:2607.10442 (2026).

Solutions 0

No solutions have been posted yet.