Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Journal articles
  4. The algebra of Boolean matrices, correspondence functors, and simplicity
 
research article

The algebra of Boolean matrices, correspondence functors, and simplicity

Bouc, Serge
•
Thévenaz, Jacques
January 1, 2020
Journal of Combinatorial Algebra

We determine the dimension of every simple module for the algebra of the monoid of all relations on a finite set (i.e. Boolean matrices). This is in fact the same question as the determination of the dimension of every evaluation of a simple correspondence functor. The method uses the theory of such functors developed in previous papers, as well as some new ingredients in the theory of finite lattices.

  • Files
  • Details
  • Metrics
Type
research article
DOI
10.4171/JCA/44
ArXiv ID

1902.05422

Author(s)
Bouc, Serge
Thévenaz, Jacques
Date Issued

2020-01-01

Published in
Journal of Combinatorial Algebra
Volume

4

Issue

3

Start page

215

End page

267

Subjects

Finite set

•

Correspondence

•

Relation

•

Boolean matrix

•

Functor category

•

Simple functor

•

Simple module

•

Poset

•

Lattice

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
CTG  
Available on Infoscience
November 19, 2018
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/151494
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés