Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 47 tok/s
Gemini 2.5 Pro 37 tok/s Pro
GPT-5 Medium 15 tok/s Pro
GPT-5 High 11 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 195 tok/s Pro
GPT OSS 120B 465 tok/s Pro
Claude Sonnet 4 30 tok/s Pro
2000 character limit reached

A combinatorial-topological shape category for polygraphs (1806.10353v2)

Published 27 Jun 2018 in math.CT, math.AT, and math.CO

Abstract: We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common classes of higher-categorical cell shapes, including globes, cubes, oriented simplices, and a large sub-class of opetopes, and are closed under lax Gray products and joins. We define constructible polygraphs to be presheaves on a category of atoms and inclusions, and extend the monoidal structures. We show that constructible directed complexes are a well-behaved subclass of Steiner's directed complexes, which we use to define a realisation functor from constructible polygraphs to omega-categories. We prove that the realisation of a constructible polygraph is a polygraph in restricted cases, and in all cases conditionally to a conjecture. Finally, we define the geometric realisation of a constructible polygraph, and prove that it is a CW complex with one cell for each of its elements.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

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

Authors (1)