pith. sign in

arxiv: 1507.01745 · v3 · pith:DA35YNBLnew · submitted 2015-07-07 · 🧮 math.CT · math.AT· math.CO

On Mitchell's embedding theorem for a quasi-schemoid

classification 🧮 math.CT math.ATmath.CO
keywords categoryschemoidcomplexembeddingmitchellmoritaquasi-schemoidscheme
0
0 comments X
read the original abstract

A quasi-schemoid is a small category whose morphisms are colored with appropriate combinatorial data. In this note, Mitchell's embedding theorem for a tame schemoid is established. The result allows us to give a cofibrantly generated model category structure to the category of chain complexes over a functor category with a schemoid as the domain. Moreover, a notion of Morita equivalence for schemoids is introduced and discussed. In particular, we show that every Hamming scheme of binary codes is Morita equivalent to the association scheme arising from the cyclic group of order two. In an appendix, we construct a new schemoid from an abstract simplicial complex, whose Bose-Mesner algebra is closely related to the Stanley-Reisner ring of the given complex.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.