The algebra of directed complexes (Q1320333): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import recommendations run Q6534273
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3948322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The combinatorics of n-categorical pasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3986539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebra of oriented simplexes / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: Q3810814 / rank
 
Normal rank
Property / Recommended article: Q3810814 / qualifier
 
Similarity Score: 0.81765234
Amount0.81765234
Unit1
Property / Recommended article: Q3810814 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4361775 / rank
 
Normal rank
Property / Recommended article: Q4361775 / qualifier
 
Similarity Score: 0.7392293
Amount0.7392293
Unit1
Property / Recommended article: Q4361775 / qualifier
 
Property / Recommended article
 
Property / Recommended article: The algebra of oriented simplexes / rank
 
Normal rank
Property / Recommended article: The algebra of oriented simplexes / qualifier
 
Similarity Score: 0.7279137
Amount0.7279137
Unit1
Property / Recommended article: The algebra of oriented simplexes / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q5431525 / rank
 
Normal rank
Property / Recommended article: Q5431525 / qualifier
 
Similarity Score: 0.7211845
Amount0.7211845
Unit1
Property / Recommended article: Q5431525 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Path categories and resolutions / rank
 
Normal rank
Property / Recommended article: Path categories and resolutions / qualifier
 
Similarity Score: 0.71071064
Amount0.71071064
Unit1
Property / Recommended article: Path categories and resolutions / qualifier
 
Property / Recommended article
 
Property / Recommended article: SOME CATEGORICAL ASPECTS OF SIMPLICIAL COMPLEXES / rank
 
Normal rank
Property / Recommended article: SOME CATEGORICAL ASPECTS OF SIMPLICIAL COMPLEXES / qualifier
 
Similarity Score: 0.7097457
Amount0.7097457
Unit1
Property / Recommended article: SOME CATEGORICAL ASPECTS OF SIMPLICIAL COMPLEXES / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3994019 / rank
 
Normal rank
Property / Recommended article: Q3994019 / qualifier
 
Similarity Score: 0.6942743
Amount0.6942743
Unit1
Property / Recommended article: Q3994019 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4540526 / rank
 
Normal rank
Property / Recommended article: Q4540526 / qualifier
 
Similarity Score: 0.6851373
Amount0.6851373
Unit1
Property / Recommended article: Q4540526 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3978986 / rank
 
Normal rank
Property / Recommended article: Q3978986 / qualifier
 
Similarity Score: 0.6833671
Amount0.6833671
Unit1
Property / Recommended article: Q3978986 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q2752243 / rank
 
Normal rank
Property / Recommended article: Q2752243 / qualifier
 
Similarity Score: 0.6812187
Amount0.6812187
Unit1
Property / Recommended article: Q2752243 / qualifier
 

Latest revision as of 20:56, 27 January 2025

scientific article
Language Label Description Also known as
English
The algebra of directed complexes
scientific article

    Statements

    The algebra of directed complexes (English)
    0 references
    16 January 1995
    0 references
    An explicit construction of the \(n\)-category freely generated by the \(n\)- simplex was first given by the reviewer [J. Pure Appl. Algebra 49, 283- 335 (1987; Zbl 0661.18005)]. Three different approaches to abstracting the notion of simplex, in such a way as to allow a generalized free \(n\)- category construction, have been developed by \textit{A. J. Power} [Lect. Notes Math. 1488, 326-358 (1991; Zbl 0736.18004)], \textit{M. Johnson} [J. Pure Appl. Algebra 62, No. 3, 211-225 (1989; Zbl 0694.18007)], and the reviewer [Cah. Topol. Géom. Différ. Catégoriques 32, No. 4, 315-343 (1991; Zbl 0760.18011)]. Some applications are to non-abelian cohomology and higher-order pasting. The present paper provides an elegant fourth approach which incorporates many of the good aspects of the previous works together with ideas of Aitchison, Al-Agl and Steiner, Kapranov and Voevodsky, and Pratt. The author defines a directed precomplex to be a set \(K\), graded over the natural numbers, with functions \(\partial^ -\), \(\partial^ + : K_ n \to P (K_{n - 1})\) (where \(P(X)\) denotes the power set of \(X)\). (This is also the basic structure underlying the reviewer's ``parity complexes''.) One of the author's really clever ideas (not to be reproduced here) is the definition of \(n\)-source and \(n\)-target functions \(\partial_ n^ -\), \(\partial^ +_ n : P(K) \to P (K^{(n)})\) (where \(K^{(n)}\) is the \(n\)-skeleton of \(K)\) defined on all subsets \(x,y\) of \(K\). When \(x \cap y = \partial_ n^ +x = \partial_ n^ - y\), the \(n\)-composite of \(x,y\) is defined to be \(x \cup y\) (as for Johnson). All later constructions are in terms of these, including the notion of directed complex itself. The set \(G(K)\) of globelike subsets of a directed complex \(K\) almost becomes an \(m\)-category with the above source, target and composition operations; as to be expected, the compositions are not generally defined as often as they should be. With some loop freeness restrictions, free \(m\)-categories can be obtained. Directed complexes are shown to be closed under suspension, product and join; the previously mentioned loop freeness does not survive these constructions, but a stronger (and still useful) one does.
    0 references
    parity complex
    0 references
    \(\omega\)-category
    0 references
    \(\infty\)-category
    0 references
    loop free
    0 references
    \(n\)- category
    0 references
    directed complex
    0 references

    Identifiers