Computing the Goodwillie-Taylor tower for discrete modules
Tebbe, Amelia Nora
Loading…
Permalink
https://hdl.handle.net/2142/98276
Description
Title
Computing the Goodwillie-Taylor tower for discrete modules
Author(s)
Tebbe, Amelia Nora
Issue Date
2017-07-11
Director of Research (if dissertation) or Advisor (if thesis)
McCarthy, Randy
Doctoral Committee Chair(s)
Ando, Matt
Committee Member(s)
Rezk, Charles
Malkiewich, Cary
Department of Study
Mathematics
Discipline
Mathematics
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Functor calculus
Goodwillie calculus
Discrete modules
Atomic functors
Finite sets
Rank filtration
Algebraic topology
Homotopy theory
Abstract
A functor from finite sets to chain complexes is called atomic if it is completely determined by its value on a particular set. We present a new resolution for these atomic functors, which allows us to easily compute their Goodwillie polynomial approximations. By a rank filtration, any functor from finite sets to chain complexes is built from atomic functors. Computing the linear approximation of an atomic functor is a classic result involving partition complexes. Robinson constructed a bicomplex, which can be used to compute the linear approximation of any functor. We hope to use our new resolution to similarly construct bicomplexes that allow us to compute polynomial approximations for any functor from finite sets to chain complexes.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.