Publication

Correspondence functors and lattices

Jacques Thévenaz, Serge Bouc
2019
Journal Articles

Abstract

A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. A main tool for this study is the construction of a correspondence functor associated to any finite lattice T. We prove for instance that this functor is projective if and only if the lattice T is distributive. Moreover, it has quotients which play a crucial role in the analysis of simple functors. The special case of total orders yields some more specific and complete results.

Official source

https://infoscience.epfl.ch/entities/publication/26894a63-c0df-4fd4-8b5a-ac83053458fe

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Jacques Thévenaz, Serge Bouc
2019
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/26894a63-c0df-4fd4-8b5a-ac83053458fe

About this result

Related concepts (32)

Adjoint functors

In mathematics, specifically , adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are known as adjoint functors, one being the left adjoint and the other the right adjoint. Pairs of adjoint functors are ubiquitous in mathematics and often arise from constructions of "optimal solutions" to certain problems (i.e.

Complete lattice

In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a conditionally complete lattice. Specifically, every non-empty finite lattice is complete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra.

Functor represented by a scheme

In algebraic geometry, a functor represented by a scheme X is a set-valued contravariant functor on the category of schemes such that the value of the functor at each scheme S is (up to natural bijections) the set of all morphisms . The scheme X is then said to represent the functor and that classify geometric objects over S given by F. The best known example is the Hilbert scheme of a scheme X (over some fixed base scheme), which, when it exists, represents a functor sending a scheme S to a flat family of closed subschemes of .

Related publications (32)

Correspondence functors and lattices

Chat with Graph Search

Multiplicity-free Representations of Algebraic Groups

Correlating long-term performance and aging behaviour of building integrated PV modules

HYPERBOLA METHOD ON TORIC VARIETIES