Parametrized spectra, multiplicative Thom spectra and the twisted Umkehr map
نویسندگان
چکیده
منابع مشابه
Units of Ring Spectra and Thom Spectra
We review and extend the theory of Thom spectra and the associated obstruction theory for orientations. Specifically, we show that for an E∞ ring spectrum A, the classical construction of gl1A, the spectrum of units, is the right adjoint of the functor Σ∞+ Ω ∞ : ho(connective spectra) → ho(E∞ ring spectra). To a map of spectra f : b → bgl1A, we associate an E∞ A-algebra Thom spectrum Mf , which...
متن کاملRing Spectra Which Are Thom Complexes
commutes up to homotopy where T is the map that exchanges factors. Let L be a space and let be a fibration over L classified by a mapf L BF (the classifying space of stable spherical fibrations). We can form the Thom spectrum T(f) of f as a suspension spectrum by letting (T(f)) be the Thorn complex of L n--YBFn where L is the n-skeleton of L. This makes T(f)-{(T(f))n) into a suspension spectrum...
متن کاملThom Isomorphism and Push-forward Map in Twisted K-theory
We establish the Thom isomorphism in twisted K-theory for any real vector bundle and develop the push-forward map in twisted K-theory for any differentiable map f : X → Y (not necessarily K-oriented). The push-forward map generalizes the push-forward map in ordinary K-theory for any K-oriented map and the Atiyah-Singer index theorem of Dirac operators on Clifford modules. For D-branes satisfyin...
متن کاملThe spectra ko and ku are not Thom spectra: an approach using THH
We apply an announced result of Blumberg-Cohen-Schlichtkrull to reprove (under restricted hypotheses) a theorem of Mahowald: the connective real and complex K-theory spectra are not Thom spectra. The construction of various bordism theories as Thom spectra served as a motivating example for the development of highly structured ring spectra. Various other examples of Thom spectra followed; for i...
متن کاملThe Spectra of Multiplicative Attribute Graphs
A multiplicative attribute graph is a random graph in which vertices are represented by random words of length t in a finite alphabet Γ, and the probability of adjacency is a symmetric function Γt×Γt → [0, 1]. These graphs are a generalization of stochastic Kronecker graphs, and both classes have been shown to exhibit several useful real world properties. We establish asymptotic bounds on the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometry & Topology
سال: 2018
ISSN: 1364-0380,1465-3060
DOI: 10.2140/gt.2018.22.3761