Can one classify finite Postnikov pieces?

Can one classify finite Postnikov pieces?

The classical approach of constructing finite Postnikov systems by k-invariants is compared with the global approach of Dwyer, Kan, and Smith. We concentrate on the case of 3-stage Postnikov pieces and provide examples where a classification is feasible. In general though, the computational difficul...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:The Bulletin of the London Mathematical Society 2010-08, Vol.42 (4), p.661-672
Hauptverfasser: Møller, Jesper M., Scherer, Jérôme
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 672
container_issue 4
container_start_page 661
container_title The Bulletin of the London Mathematical Society
container_volume 42
creator Møller, Jesper M.
Scherer, Jérôme
description The classical approach of constructing finite Postnikov systems by k-invariants is compared with the global approach of Dwyer, Kan, and Smith. We concentrate on the case of 3-stage Postnikov pieces and provide examples where a classification is feasible. In general though, the computational difficulty of the global approach is equivalent to that of the classical one. …all mathematics leads, doesn’t it, sooner or later, to some kind of human suffering. ‘Against the Day’, Thomas Pynchon
doi_str_mv 10.1112/blms/bdq027
format Article
fullrecord <record><control><sourceid>istex_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1112_blms_bdq027</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>ark_67375_HXZ_HF4SLFHF_6</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3501-fdd222963f4ff70418a14bf7fa995f20e620e6f09d27b550650da6dfe35d0bb3</originalsourceid><addsrcrecordid>eNp9j0FLxDAQRoMoWFdP_oFeRerOJE1iT6KLtUJFYfcgXkLaJBC3267Novbfu6Xi0cMwl_c-eIScI1whIp1XzSbMK_MBVB6QCFORJRQpHJIIgKaJgIwdk5MQ3gGQgcSIXCx0G3etjetGh-DdEDvf-p2NX7qwa_26-4y33tY23JySI6ebYM9-_4ys8vvVokjK54fHxW2Z1IwDJs4YSmkmmEudk5Ditca0ctLpLOOOghXjOcgMlRXnIDgYLYyzjBuoKjYjl9Ns3Xch9Napbe83uh8Ughoj1Rippsg9jRP95Rs7_Iequ_JpCULg3kkmx4ed_f5zdL9WQjLJVfH6poo8XZZ5kSvBfgBogWSj</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Can one classify finite Postnikov pieces?</title><source>Wiley Online Library All Journals</source><source>Alma/SFX Local Collection</source><creator>Møller, Jesper M. ; Scherer, Jérôme</creator><creatorcontrib>Møller, Jesper M. ; Scherer, Jérôme</creatorcontrib><description>The classical approach of constructing finite Postnikov systems by k-invariants is compared with the global approach of Dwyer, Kan, and Smith. We concentrate on the case of 3-stage Postnikov pieces and provide examples where a classification is feasible. In general though, the computational difficulty of the global approach is equivalent to that of the classical one. …all mathematics leads, doesn’t it, sooner or later, to some kind of human suffering. ‘Against the Day’, Thomas Pynchon</description><identifier>ISSN: 0024-6093</identifier><identifier>EISSN: 1469-2120</identifier><identifier>DOI: 10.1112/blms/bdq027</identifier><language>eng</language><publisher>Oxford University Press</publisher><ispartof>The Bulletin of the London Mathematical Society, 2010-08, Vol.42 (4), p.661-672</ispartof><rights>2010 London Mathematical Society</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3501-fdd222963f4ff70418a14bf7fa995f20e620e6f09d27b550650da6dfe35d0bb3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1112%2Fblms%2Fbdq027$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1112%2Fblms%2Fbdq027$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27923,27924,45573,45574</link.rule.ids></links><search><creatorcontrib>Møller, Jesper M.</creatorcontrib><creatorcontrib>Scherer, Jérôme</creatorcontrib><title>Can one classify finite Postnikov pieces?</title><title>The Bulletin of the London Mathematical Society</title><description>The classical approach of constructing finite Postnikov systems by k-invariants is compared with the global approach of Dwyer, Kan, and Smith. We concentrate on the case of 3-stage Postnikov pieces and provide examples where a classification is feasible. In general though, the computational difficulty of the global approach is equivalent to that of the classical one. …all mathematics leads, doesn’t it, sooner or later, to some kind of human suffering. ‘Against the Day’, Thomas Pynchon</description><issn>0024-6093</issn><issn>1469-2120</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNp9j0FLxDAQRoMoWFdP_oFeRerOJE1iT6KLtUJFYfcgXkLaJBC3267Novbfu6Xi0cMwl_c-eIScI1whIp1XzSbMK_MBVB6QCFORJRQpHJIIgKaJgIwdk5MQ3gGQgcSIXCx0G3etjetGh-DdEDvf-p2NX7qwa_26-4y33tY23JySI6ebYM9-_4ys8vvVokjK54fHxW2Z1IwDJs4YSmkmmEudk5Ditca0ctLpLOOOghXjOcgMlRXnIDgYLYyzjBuoKjYjl9Ns3Xch9Napbe83uh8Ughoj1Rippsg9jRP95Rs7_Iequ_JpCULg3kkmx4ed_f5zdL9WQjLJVfH6poo8XZZ5kSvBfgBogWSj</recordid><startdate>201008</startdate><enddate>201008</enddate><creator>Møller, Jesper M.</creator><creator>Scherer, Jérôme</creator><general>Oxford University Press</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>201008</creationdate><title>Can one classify finite Postnikov pieces?</title><author>Møller, Jesper M. ; Scherer, Jérôme</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3501-fdd222963f4ff70418a14bf7fa995f20e620e6f09d27b550650da6dfe35d0bb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Møller, Jesper M.</creatorcontrib><creatorcontrib>Scherer, Jérôme</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><jtitle>The Bulletin of the London Mathematical Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Møller, Jesper M.</au><au>Scherer, Jérôme</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Can one classify finite Postnikov pieces?</atitle><jtitle>The Bulletin of the London Mathematical Society</jtitle><date>2010-08</date><risdate>2010</risdate><volume>42</volume><issue>4</issue><spage>661</spage><epage>672</epage><pages>661-672</pages><issn>0024-6093</issn><eissn>1469-2120</eissn><abstract>The classical approach of constructing finite Postnikov systems by k-invariants is compared with the global approach of Dwyer, Kan, and Smith. We concentrate on the case of 3-stage Postnikov pieces and provide examples where a classification is feasible. In general though, the computational difficulty of the global approach is equivalent to that of the classical one. …all mathematics leads, doesn’t it, sooner or later, to some kind of human suffering. ‘Against the Day’, Thomas Pynchon</abstract><pub>Oxford University Press</pub><doi>10.1112/blms/bdq027</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0024-6093
ispartof The Bulletin of the London Mathematical Society, 2010-08, Vol.42 (4), p.661-672
issn 0024-6093
1469-2120
language eng
recordid cdi_crossref_primary_10_1112_blms_bdq027
source Wiley Online Library All Journals; Alma/SFX Local Collection
title Can one classify finite Postnikov pieces?
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T12%3A06%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-istex_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Can%20one%20classify%20finite%20Postnikov%20pieces?&rft.jtitle=The%20Bulletin%20of%20the%20London%20Mathematical%20Society&rft.au=M%C3%B8ller,%20Jesper%20M.&rft.date=2010-08&rft.volume=42&rft.issue=4&rft.spage=661&rft.epage=672&rft.pages=661-672&rft.issn=0024-6093&rft.eissn=1469-2120&rft_id=info:doi/10.1112/blms/bdq027&rft_dat=%3Cistex_cross%3Eark_67375_HXZ_HF4SLFHF_6%3C/istex_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true