Skip to main content

Search

Show all results for

Home

Publication

Vanishing evaluations of simple functors

About
Privacy
Disclaimer

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

Jacques Thévenaz, Serge Bouc
2014

Abstract

The classification of simple biset functors is known, but the evaluation of a simple biset functor at a finite group G may be zero. We investigate various situations where this happens, as well as cases where this does not occur. We also prove a closed formula for such an evaluation under some restrictive conditions on G.

Official source

https://infoscience.epfl.ch/entities/publication/8508afe7-7b0b-4449-bfae-fffe499b1b40

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.

Related concepts (18)

Classification of finite simple groups

In mathematics, the classification of finite simple groups is a result of group theory stating that every finite simple group is either cyclic, or alternating, or it belongs to a broad infinite class called the groups of Lie type, or else it is one of twenty-six or twenty-seven exceptions, called sporadic. The proof consists of tens of thousands of pages in several hundred journal articles written by about 100 authors, published mostly between 1955 and 2004.

In abstract algebra, a finite group is a group whose underlying set is finite. Finite groups often arise when considering symmetry of mathematical or physical objects, when those objects admit just a finite number of structure-preserving transformations. Important examples of finite groups include cyclic groups and permutation groups. The study of finite groups has been an integral part of group theory since it arose in the 19th century.

Finitely generated group

In algebra, a finitely generated group is a group G that has some finite generating set S so that every element of G can be written as the combination (under the group operation) of finitely many elements of S and of inverses of such elements. By definition, every finite group is finitely generated, since S can be taken to be G itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated.

Related publications (30)

Lattice packings through division algebras

Nihar Prakash Gargava

In this text, we will show the existence of lattice packings in a family of dimensions by employing division algebras. This construction is a generalization of Venkatesh's lattice packing result Venkatesh (Int Math Res Notices 2013(7): 1628-1642, 2013). In ...

SPRINGER HEIDELBERG2023

Approximating nonabelian free groups by groups of homeomorphisms of the real line

We show that for a large class C of finitely generated groups of orientation preserving homeomorphisms of the real line, the following holds: Given a group G of rank k in C, there is a sequence of k-markings (G,S-n), n is an element of N whose limit in the ...

2020

The algebra of Boolean matrices, correspondence functors, and simplicity

Jacques Thévenaz, Serge Bouc

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 ...

2020