Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Harder-Narasimhan filtrations and their compatibility with tensor products

Published 23 Mar 2017 in math.NT, math.CT, and math.MG | (1703.08047v2)

Abstract: We attach buildings to modular lattices and use them to develop a metric approach to Harder-Narasimhan filtrations. Switching back to a categorical framework, we establish an abstract numerical criterion for the compatibility of these filtrations with tensor products. We finally verify our criterion in three cases, one of which is new.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.