Do you want to publish a course? Click here

On Harder-Narasimhan filtrations and their compatibility with tensor products

79   0   0.0 ( 0 )
 Added by Christophe Cornut
 Publication date 2017
  fields
and research's language is English




Ask ChatGPT about the research

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.



rate research

Read More

129 - Christophe Cornut 2018
We define and study Harder-Narasimhan filtrations on Breuil-Kisin-Fargues modules and related objects relevant to p-adic Hodge theory.
168 - Christophe Cornut 2014
We construct and study a scheme theoretical version of the Tits vectorial building, relate it to filtrations on fiber functors, and use them to clarify various constructions pertaining to Bruhat-Tits buildings, for which we also provide a Tannakian description.
We introduce a generalization of the notion of a negligible morphism and study the associated tensor ideals and thick ideals. These ideals are defined by considering deformations of a given monoidal category $mathcal{C}$ over a local ring $R$. If the maximal ideal of $R$ is generated by a single element, we show that any thick ideal of $mathcal{C}$ admits an explicitely given modified trace function. As examples we consider various Deligne categories and the categories of tilting modules for a quantum group at a root of unity and for a semisimple, simply connected algebraic group in prime characteristic. We prove an elementary geometric description of the thick ideals in quantum type A and propose a similar one in the modular case.
138 - Sho Kubota 2017
We define the type of graph products, which enable us to treat many graph products in a unified manner. These unified graph products are shown to be compatible with Godsil--McKay switching. Furthermore, by this compatibility, we show that the Doob graphs can also be obtained from the Hamming graphs by switching.
We show that the tensor product of two cyclic $A_infty$-algebras is, in general, not a cyclic $A_infty$-algebra, but an $A_infty$-algebra with homotopy inner product. More precisely, we construct an explicit combinatorial diagonal on the pairahedra, which are contractible polytopes controlling the combinatorial structure of an $A_infty$-algebra with homotopy inner products, and use it to define a categorically closed tensor product. A cyclic $A_infty$-algebra can be thought of as an $A_infty$-algebra with homotopy inner products whose higher inner products are trivial. However, the higher inner products on the tensor product of cyclic $A_infty$-algebras are not necessarily trivial.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا