Concept

Représentation unitaire

Publications associées (48)

Spectra of non-regular elements in irreducible representations of simple algebraic groups

We study the spectra of non-regular semisimple elements in irreducible representations of simple algebraic groups. More precisely, we prove that if G is a simply connected simple linear algebraic group and φ : G → GL(V ) is a non-trivial irreducible repres ...

2021

Physics-Inspired Structural Representations for Molecules and Materials

Michele Ceriotti, Félix Benedito Clément Musil, Andrea Grisafi

The first step in the construction of a regression model or a data-driven analysis, aiming to predict or elucidate the relationship between the atomic-scale structure of matter and its properties, involves transforming the Cartesian coordinates of the atom ...

AMER CHEMICAL SOC2021

Frequency dependence in GW made simple using a multipole approximation

Tommaso Chiarotti, Andrea Ferretti

In the GW approximation, the screened interaction W is a nonlocal and dynamical potential that usually has a complex frequency dependence. A full description of such a dependence is possible but often computationally demanding. For this reason, it is still ...

AMER PHYSICAL SOC2021

Recursive evaluation and iterative contraction of N-body equivariant features

Michele Ceriotti, Sergey Pozdnyakov, Jigyasa Nigam

Mapping an atomistic configuration to a symmetrized N-point correlation of a field associated with the atomic positions (e.g., an atomic density) has emerged as an elegant and effective solution to represent structures as the input of machine-learning algo ...

2020

Smaller, Faster & Lighter KNN Graph Constructions

Rachid Guerraoui, Anne-Marie Kermarrec, Olivier Ruas

We propose GoldFinger, a new compact and fast-to-compute binary representation of datasets to approximate Jaccard’s index. We illustrate the effectiveness of GoldFinger on the emblematic big data problem of K-Nearest-Neighbor (KNN) graph construction and s ...

2020

Linear Flavour-Wave Theory of SU(N) Lattice Models with Arbitrary Irreducible Representations

Francisco Hyunkyu Kim

This thesis explores various approaches of studying the long-range colour order of antiferromagnetic SU(N) Heisenberg models with the linear flavour-wave theory (LFWT). The LFWT is an extension of the well-known SU(2) spin-wave theory to SU(N), and this se ...

EPFL2019

On the relation between linearity-generating processes and linear-rational models

Damir Filipovic, Martin Larsson

We review the notion of a linearity-generating (LG) process introduced by Gabaix and relate LG processes to linear-rational (LR) models studied by Filipović et al. We show that every LR model can be represented as an LG process and vice versa. We find that ...

2019

A new kind of atlas of zeolite building blocks

Michele Ceriotti, Benjamin Aaron Helfrecht, Rocio Semino Barbaresi, Giovanni Pireddu

We have analyzed structural motifs in the Deem database of hypothetical zeolites to investigate whether the structural diversity found in this database can be well-represented by classical descriptors, such as distances, angles, and ring sizes, or whether ...

2019

Learning Graphs From Data: A Signal Representation Perspective

Pascal Frossard, Xiaowen Dong

The construction of a meaningful graph topology plays a crucial role in the effective representation, processing, analysis, and visualization of structured data. When a natural choice of the graph is not readily available from the data sets, it is thus des ...

2019

Exact diagonalization of SU( N ) Heisenberg and Affleck-Kennedy-Lieb-Tasaki chains using the full SU( N ) symmetry

Frédéric Mila, Pierre Marcel Nataf, Kianna Wan

We present a method for the exact diagonalization of the SU(N) Heisenberg interaction Hamiltonian using Young tableaus to work directly in each irreducible representation of the global SU(N) group. This generalized scheme is applicable to chains consisting ...

2017

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