Search arXiv⌕ Search

arXiv · 2305.06938

A layout algorithm for higher-dimensional string diagrams

Abstract

The algebraic zigzag construction has recently been introduced as a combinatorial foundation for a higher dimensional notion of string diagram. For use in a proof assistant, a layout algorithm is required to determine the optimal rendering coordinates, across multiple projection schemes including 2D, 3D, and 4D. For construction of these layouts, a key requirement is to determine the linear constraints which the geometrical elements must satisfy in each dimension. Here we introduce a new categorical tool called injectification, which lifts a functorial factorization system on a category to diagrams over that category, and we show that implementing this recursively in the category of finite posets allows us to systematically generate the necessary constraints. These ideas have been implemented as the layout engine of the proof assistant homotopy.io, enabling attractive and practical visualisations of complex higher categorical objects.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Calin Tataru, Jamie Vicary. 2024-02-20. A layout algorithm for higher-dimensional string diagrams. https://arxiv.org/abs/2305.06938

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

KEEP EXPLORING

Related papers

Commutation of Smyth and Hoare Power Constructions in Well-filtered Dcpos

Prior work [11] established a commutativity result for the Hoare power construction and a modified version of the Smyth power construction consisting of strongly compact sets, which is defined for Us-admitting dcpos, where Us-admissability is well-filteredness with compact sets replaced by strongly compact sets. In this paper, we consider the Hoare power construction H and the Smyth power construction Q on the category WF of well-filtered dcpos with Scott-continuous maps. Actually, the functors H and Q can be extended to monads. We prove that H and Q commute, that is, HQ(L) is isomorphic to QH(L) for a well-filtered dcpo L, if and only if L satisfies a property similar to consonance that we call (KC) and the Scott topology coincides with the upper Vietoris topology on Q(L). We also investigate the Eilenberg-Moore category of the monad composed by H and Q under a distributive law on WF and characterize it to be a subcategory of the category Frm, which is composed of all frames and all frame homomorphisms.

math.CT↗

Groupoidal polygraphic homology

We show that for a 1-category C, the (ω, k)-polygraphic homology of C for any k {\geq} 1, that is taken with cofibrant resolutions in strict (ω, k)- categories, does not depend on k and is canonically isomorphic to the homology of the classifying space of C. When C is a groupoid, we also show this for k = 0. In particular, this means that the classical homology of groups can be obtained by taking cofibrant resolutions in strict ω-groupoids. In order to show these results, we develop the theory of discrete Conduché fibrations in the category of strict (ω, k)-categories, building on previous work by the first-named author.

math.CT↗