**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.

Publication# Vanishing evaluations of simple functors

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

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 (20)

Related publications (32)

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.

Finite group

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.

Ontological neighbourhood

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

2020This paper presents a self contained approach to the theory of convolution operators on locally compact groups (both commutative and non commutative) based on the use of the Figà–Talamanca Herz algebras. The case of finite groups is also considered. ...

2019Let be a simple exceptional algebraic group of adjoint type over an algebraically closed field of characteristic and let be a subgroup of containing a regular unipotent element of . By a theorem of Testerman, is contained in a connected subgroup of of type ...

2019