Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Let G be a finite group and let T(G) be the abelian group of equivalence classes of endotrivial kG-modules, where k is an algebraically closed field of characteristic p. We determine, in terms of the structure of G, the kernel of the restriction map from T ...
We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties which do not hold for other types of functor ...
Let G be a finite group and (K, O, k) be a p-modular system “large enough”. Let R = O or k. There is a bijection between the blocks of the group algebra RG and the central primitive idempotents (the blocks) of the so-called cohomological Mackey algebra coμ ...
This thesis is in the context of representation theory of finite groups. More specifically, it studies biset functors. In this thesis, I focus on two biset functors: the Burnside functor and the functor of p-permutation modules. For the Burnside functor we ...
Motivated by the Benjamini-Schramm non-unicity of percolation conjecture we study the following question. For a given finitely generated nonamenable group Gamma, does there exist a generating set S such that the Cayley graph (Gamma, S), without loops and m ...
Encoding of a plurality of encoded symbols is provided wherein an encoded symbol is generated from a combination of a first symbol generated from a first set of intermediate symbols and a second symbol generated from a second set of intermediate symbols, e ...
Object manipulation is a challenging task for robotics, as the physics involved in object interaction is complex and hard to express analytically. Here we introduce a modular approach for learning a manipulation strategy from human demonstration. Firstly w ...
A finitely generated subgroup F of a real Lie group G is said to be Diophantine if there is beta > 0 such that non-trivial elements in the word ball B-Gamma(n) centered at 1 is an element of F never approach the identity of G closer than broken vertical ba ...
Let G be a finite group and (K, O, k) be a p-modular system. Let R = O or k. There is a bijection between the blocks of the group algebra and the blocks of the so-called p-local Mackey algebra mu(1)(R)(G). Let b be a block of RG with abelian defect group D ...
In this paper, we present an exact Riemann solver for one-dimensional systems of conservation laws. The method is based on an offline-online computational decomposition. During the offline stage, we generate an accurate surrogate model for the solution to ...
