Computing left Kan extensions. (Q1426132): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Michael R. Bush / rank | |||
Property / author | |||
Property / author: Robert F. C. Walters / rank | |||
Property / reviewed by | |||
Property / reviewed by: Q688985 / rank | |||
Property / author | |||
Property / author: Michael R. Bush / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Robert F. C. Walters / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Václav Koubek / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: UNITY / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3978969 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692502 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3241233 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5727698 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4843624 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4285784 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A practical method for enumerating cosets of a finite abstract group / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Categories and Computer Science / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0747-7171(02)00102-5 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2021500173 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computing left Kan extensions. |
scientific article |
Statements
Computing left Kan extensions. (English)
0 references
14 March 2004
0 references
The paper by \textit{S.~Carmody} and \textit{R.~F.~C.~Walters} [in: Category theory, Proc. Int. Conf., Como/Italy 1990, Lect. Notes Math. 1488, 63--78 (1991; Zbl 0737.18001)] generalized the Todd-Coxeter algorithm for enumerating cosets of finite groups to a computation of left Kan extensions. This paper simplifies this version of algorithm and the proof of its correctness. This algorithm for finitely presented functors \(X:{\mathcal A}\to {\mathcal S}et\) and \(F:{\mathcal A}\to{\mathcal B}\) computes a finitely presented functor \(P:{\mathcal B}\to{\mathcal S}et\) and a natural transformation from \( X\) into \(P\circ F\).
0 references
coset
0 references
Todd-Coxeter algorithm
0 references
left Kan extension
0 references