|
|
|
|
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
EBOOKCENTRAL_ocn891396696 |
| 003 |
OCoLC |
| 005 |
20240329122006.0 |
| 006 |
m o d |
| 007 |
cr cn||||||||| |
| 008 |
140909t19851985riu ob 000 0 eng d |
| 040 |
|
|
|a E7B
|b eng
|e rda
|e pn
|c E7B
|d OCLCO
|d EBLCP
|d OCLCQ
|d OCLCF
|d OCLCQ
|d OCLCO
|d OCLCQ
|d QGK
|d K6U
|d OCLCO
|d OCLCQ
|d OCLCO
|
| 019 |
|
|
|a 1259125100
|
| 020 |
|
|
|a 9781470407506
|q (e-book)
|
| 020 |
|
|
|a 1470407507
|q (e-book)
|
| 020 |
|
|
|z 9780821823385
|
| 035 |
|
|
|a (OCoLC)891396696
|z (OCoLC)1259125100
|
| 050 |
|
4 |
|a QA612.8
|b .T364 1985eb
|
| 082 |
0 |
4 |
|a 514
|2 19
|
| 049 |
|
|
|a UAMI
|
| 100 |
1 |
|
|a Tangora, Martin C.,
|e author.
|
| 245 |
1 |
0 |
|a Computing the homology of the lambda algebra /
|c Martin C. Tangora.
|
| 264 |
|
1 |
|a Providence, Rhode Island :
|b American Mathematical Society,
|c 1985.
|
| 264 |
|
4 |
|c ©1985
|
| 300 |
|
|
|a 1 online resource (174 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Memoirs of the American Mathematical Society,
|x 0065-9266 ;
|v Number 337
|
| 500 |
|
|
|a "November 1985, Volume 58, Number 337 (third of four numbers)."
|
| 504 |
|
|
|a Includes bibliographical references.
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|a ""Table of Contents""; ""Chapter 1: Introduction""; ""Chapter 2: The lambda algebra""; ""2.1. The defining structure of the lambda algebra""; ""2.2. Generating tables of relations and differentials""; ""2.3. Digression: the Adem relations in the Steenrod algebra""; ""2.4. Ordering""; ""2.5. Corollaries to the structure formulas""; ""2.6. Tri-grading when p is odd""; ""2.7. The endomorphism Î?""; ""2.8. Cutting the work in half: odd endings""; ""2.9. Remarks on the image of J and vanishing lines""; ""2.10. The ""unstable"" algebras and the EHP sequence""
|
| 505 |
8 |
|
|a 2.11. Some comments on the search for differentials2.12. The size of the lambda algebra -- Table 2.1: Actual counts, p=2, odd-ending monomials -- 2.13. Euler characteristic check -- Chapter 3: The algorithms and the Curtis table -- 3.1. Terminology -- 3.2. The tables do not include certain towers -- 3.3. Preliminary algorithm -- 3.4. Obvious tags and invisible listings -- 3.5. The LTO (leading-term-only) algorithm -- 3.6. Some perverse examples -- 3.7. Finiteness -- 3.8. Correctness -- 3.9. Shortcuts -- 3 9 1. No small target -- 3 9.2. Truncation
|
| 505 |
8 |
|
|a ""3 9.3. Cycle initials""""3 9.4. Visible products ""; ""3.9.5. A certain pattern for p=2""; ""3.9.6. A useful pattern for p=2 or p=3""; ""3.9.7. Verticals, p=2""; ""3.9.8. Some patterns for p=3""; ""3.9.9. Verticals, p=3""; ""3.9.10. Product with λl, p=3""; ""3.10 Using extraneous information""; ""Chapter 4: Implementation and experience""; ""4.1. The SNOBOL language""; ""4.2. Stop and restart; output""; ""4.3. Choice of algorithm""; ""4.4. Time and storage constraints""; ""4.5. Data representation""; ""4.6. The sample program""; ""4.7. Execution profiles""
|
| 505 |
8 |
|
|a 4.8. Growth rate of the calculationTable 4.1. CPU time for each t, p=2 -- Table 4.2. CPU time for each t, p=3 -- 4.9. Bad cases -- 4.10. Recent developments -- Figure 4.1: Snobol program, p=2 -- Chapter 5: Related programs -- 5.1. The lambda algebra -- 5.2. Table-processing programs -- 5.3. Various programs for Curtis tables -- 5.4. Execution profiles -- 5.5. Product structure -- Chapter 6: The tables -- 6.1. Tables 1 and 2: Curtis tables for p=2 -- 6.2. Tables 3 and 4: Curtis tables for p=3 -- 6.3. Tables 5 and 6: Curtis tables for p=3, lambdas only
|
| 505 |
8 |
|
|a Table 1: p=2, stableTable 2: p=2, Curtis table -- Table 3: p=3, stable -- Table 4: p=3, Curtis table -- Table 5: p=3 lambdas only, stable -- Table 6: p=3 lambdas only, Curtis table -- Bibliography
|
| 546 |
|
|
|a English.
|
| 590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
| 650 |
|
0 |
|a Lambda algebra
|x Data processing.
|
| 650 |
|
0 |
|a Adams spectral sequences
|x Data processing.
|
| 650 |
|
0 |
|a Homotopy groups
|x Data processing.
|
| 650 |
|
6 |
|a Lambda-algèbre
|x Informatique.
|
| 650 |
|
6 |
|a Suites spectrales d'Adams
|x Informatique.
|
| 650 |
|
6 |
|a Groupes d'homotopie
|x Informatique.
|
| 650 |
|
7 |
|a Adams spectral sequences
|x Data processing
|2 fast
|
| 650 |
|
7 |
|a Homotopy groups
|x Data processing
|2 fast
|
| 650 |
|
7 |
|a Lambda algebra
|x Data processing
|2 fast
|
| 776 |
0 |
8 |
|i Print version:
|a Tangora, Martin C.
|t Computing the homology of the lambda algebra.
|d Providence, Rhode Island : American Mathematical Society, ©1985
|h v, 163 pages
|k Memoirs of the American Mathematical Society ; Number 337
|x 0065-9266
|z 9780821823385
|
| 830 |
|
0 |
|a Memoirs of the American Mathematical Society ;
|v no. 337.
|
| 856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3113964
|z Texto completo
|
| 936 |
|
|
|a BATCHLOAD
|
| 938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL3113964
|
| 938 |
|
|
|a ebrary
|b EBRY
|n ebr10918917
|
| 994 |
|
|
|a 92
|b IZTAP
|
