Concept

Groupe de Klein

Publications associées (5)

Further Refinement Of Strong Multiplicity One For Gl(2)

We obtain a sharp refinement of the strong multiplicity one theorem for the case of unitary non-dihedral cuspidal automorphic representations for GL(2). Given two unitary cuspidal automorphic representations for GL(2) that are not twist-equivalent, we also ...

American Mathematical Society2014

On isogeny classes of Edwards curves over finite fields

Robert Granger

We count the number of isogeny classes of Edwards curves over finite fields, answering a question recently posed by Rezaeian and Shparlinski. We also show that each isogeny class contains a {\em complete} Edwards curve, and that an Edwards curve is isogeno ...

Elsevier2012

Relative Projectivity and Relative Endotrivial Modules

Caroline Lassueur

This dissertation is concerned with modular representation theory of finite groups, and more precisely, with the study of classes of representations, which we shall term relative endotrivial modules. Given a prime number p, a finite group G of order divisi ...

EPFL2012

On the Approximation Power of Splines: Orthogonal Versus Hexagonal Lattices

Michaël Unser, Dimitri Nestor Alice Van De Ville, Thierry Blu

Recently, we have proposed a novel family of bivariate, non-separable splines. These splines, called "hexsplines" have been designed to deal with hexagonally sampled data. Incorporating the shape of the Voronoi cell of a hexagonal lattice, they preserve th ...

NuHAG2003

Solving the supersymmetric CP problem with Abelian horizontal symmetries

Riccardo Rattazzi

Models that combine Abelian horizontal symmetries and spontaneous CP violation can (i) explain the smallness and hierarchy in quark parameters; (ii) satisfactorily suppress supersymmetric contributions to flavor changing neutral current processes; (iii) so ...

1996

Graph Chatbot

Chattez avec Graph Search

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.

Connectez-vous pour utiliser Chat avec Graph Search