2002
DOI: 10.1016/s0022-4049(02)00049-x
|View full text |Cite
|
Sign up to set email alerts
|

Operations in A-theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
23
0

Year Published

2002
2002
2024
2024

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(24 citation statements)
references
References 23 publications
0
23
0
Order By: Relevance
“…Definition 3.11 (Compare 2.1, p.268, [5] and Section 4, [2]). Let Z be a simplicial object in a category D. Define a concatenation operation con : ∆ k → ∆.…”
Section: Defining the Operationsmentioning
confidence: 99%
See 3 more Smart Citations
“…Definition 3.11 (Compare 2.1, p.268, [5] and Section 4, [2]). Let Z be a simplicial object in a category D. Define a concatenation operation con : ∆ k → ∆.…”
Section: Defining the Operationsmentioning
confidence: 99%
“…Under the assumption that the category C satisfy the extension property for cofibrations, which has been verified for R f (X) and R f (X, Σ n , {all}) in lemma 3.16 part 2, one may identify the iterated G • -construction G n • C with Exact(Γ(−) n , C) according to lemma 3.16, part 1. Using the adjointness relation, or diagonals, we have • : F → Cat ∆ op following the recipe in [5]. Thus, on objects x ∈ Ob(F + ) and A ∈ ∆, put G x A C := Exact(Γ(A) x , C).…”
Section: In This Section We Show That the Diagonal Arrow Is Induced Bmentioning
confidence: 99%
See 2 more Smart Citations
“…Grayson enlisted five conditions ((E1), · · · , (E5)), which ⊠ and ✸ k must satisfy so that one can construct the desired operations [31] (see also pages 270-271 of [32]). The author is unable to provide a proof of the following lemma and this makes the rest of the section conjectural.…”
Section: Combinatorial Grayson Operationsmentioning
confidence: 99%