Θ-Completeness for Classifying Stacks

Simple item page
dc.contributor.advisorAlper, Jarod
dc.contributor.authorTheplertboon, Varodom
dc.date.accessioned2024-02-12T23:41:33Z
dc.date.available2024-02-12T23:41:33Z
dc.date.issued2024-02-12
dc.date.submitted2023
dc.descriptionThesis (Ph.D.)--University of Washington, 2023
dc.description.abstractWe provide a criterion for the classifying stack BGto be Θ-completeover an algebraically closed field of characteristic 0. It is known that the classifying stack BG is Θ-complete when G is a unipotent algebraic group or reductive group (hence the product of a unipotent group and a reductive group). We prove that this is in fact a necessary condition. That is the Θ-completeness of the classifying stack BG implies that G must be the trivial product of a unipotent group and a reductive group.
dc.embargo.termsOpen Access
dc.format.mimetypeapplication/pdf
dc.identifier.otherTheplertboon_washington_0250E_26309.pdf
dc.identifier.urihttp://hdl.handle.net/1773/51204
dc.language.isoen_US
dc.rightsnone
dc.subject
dc.subjectMathematics
dc.subject.otherMathematics
dc.titleΘ-Completeness for Classifying Stacks
dc.typeThesis

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Theplertboon_washington_0250E_26309.pdf
Size:
697.43 KB
Format:
Adobe Portable Document Format
Download

Collections

Mathematics