Nilpotent groups have polynomially bounded homological filling invariants

Abstract

Gromov claimed, with a sketch of proof, that simply connected nilpotent Lie groups have polynomially bounded filling invariants. The literature establishes this, often with a stronger conclusion where the exponent of polynomiality is computed or estimated, for some classes of nilpotent groups, or ranges of filling degrees. We provide a proof, in part based on Gromov's hints, yielding at once (non-optimal) polynomial upper bounds on the homological filling invariants in every degree for all finitely generated nilpotent groups, or equivalently, for all simply connected nilpotent Lie groups having lattices.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…