Concept

Automorphisme

Publications associées (24)

A Spectral Ansatz for The Long-Time Homogenization of The Wave Equation

Matthias Ruf

Consider the wave equation with heterogeneous coefficients in the homogenization regime. At large times, the wave interacts in a nontrivial way with the heterogeneities, giving rise to effective dispersive effects. The main achievement of the present wor ...

Ecole Polytechnique2024

Symmetry in design and decoding of polar-like codes

Kirill Ivanov

The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...

EPFL2022

Outer automorphism anomalies

Brian Quinn Henning

We discuss anomalies associated with outer automorphisms in gauge theories based on classical groups, namely charge conjugations for SU(N) and parities for SO(2r). We emphasize the inequivalence (yet related by a flavor transformation) between two versions ...

SPRINGER2022

Nielsen Equivalence In Gupta-Sidki Groups

Aglaia Myropolska

For a group G generated by k elements, the Nielsen equivalence classes are defined as orbits of the action of AutF(k), the automorphism group of the free group of rank k, on the set of generating k-tuples of G. Let p >= 3 be prime and G(p) the Gupta-Sidki ...

Amer Mathematical Soc2017

Poincaré, Scale and Conformal Symmetries

Georgios Karananas

Symmetries are omnipresent and play a fundamental role in the description of Nature. Thanks to them, we have at our disposal nontrivial selection rules that dictate how a theory should be constructed. This thesis, which is naturally divided into two parts, ...

EPFL2016

Amenable hyperbolic groups

Nicolas Monod

We give a complete characterization of the locally compact groups that are nonelementary Gromov-hyperbolic and amenable. They coincide with the class of mapping tori of discrete or continuous one-parameter groups of compacting automorphisms. We moreover gi ...

European Mathematical Soc2015

Diophantine properties of nilpotent Lie groups

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

London Mathematical Society, Cambridge2015

L-2-Betti numbers and Plancherel measure

Henrik Densing Petersen, Alain Valette

We compute L-2-Betti numbers of postliminal, locally compact, unimodular groups in terms of ordinary dimensions of reduced cohomology with coefficients in irreducible unitary representations and the Plancherel measure. This allows us to compute the L-2-Bet ...

Academic Press Inc Elsevier Science2014

Mixing patterns from the groups Sigma(n phi)

Lorenzo Vitale

We survey the mixing patterns which can be derived from the discrete groups Sigma(36 x 3), Sigma( 72 x 3), Sigma(216 x 3) and Sigma(360 x 3), if these are broken to Abelian subgroups G(e) and G(nu) in the charged lepton and neutrino sector, respectively. S ...

Iop Publishing Ltd2014

Elliptic and Hyperelliptic Curves: A Practical Security Analysis

Joppe Willem Bos, Andrea Miele

Motivated by the advantages of using elliptic curves for discrete logarithm-based public-key cryptography, there is an active research area investigating the potential of using hyperelliptic curves of genus 2. For both types of curves, the best known algor ...

Springer Berlin Heidelberg2014

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