Person

Henrik Densing Petersen

This person is no longer with EPFL

Related publications (4)

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

A Groupoid Approach to Luck's Amenability Conjecture

Henrik Densing Petersen

We prove that amenability of a discrete group is equivalent to dimension flatness of certain ring inclusions naturally associated with measure preserving actions of the group. This provides a group-measure space theoretic solution to a conjecture of Luck s ...
Osaka Journal Of Mathematics2014

AN OBSTRUCTION TO l(p)-DIMENSION

Nicolas Monod, Henrik Densing Petersen

Let G be any group containing an infinite elementary amenable subgroup and let 2 < p < infinity. We construct an exhaustion of l(p) G by closed invariant subspaces which all intersect trivially a fixed non-trivial closed invariant subspace. This is an obst ...
Annales Inst Fourier2014

L-2-Betti numbers of locally compact groups

Henrik Densing Petersen

The present paper is a summary and overview of results obtained in the author's thesis, "L-2-Betti Numbers of Locally Compact Groups", wherein the definition of L-2-Betti numbers for countable groups is extended to locally compact unimodular groups. In man ...
Elsevier2013

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.