<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Unitary representations of real reductive groups · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1212.2192/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1212.2192/feed.xml" rel="self" type="application/rss+xml" /><item><title>Unitary representations of real reductive groups — mentioned by mathgenius</title><link>https://news.ycombinator.com/item?id=14501392</link><guid isPermaLink="false">urn:hackerpapers:mention:1212.2192:14501392</guid><pubDate>Tue, 06 Jun 2017 21:13:15 GMT</pubDate><description>&lt;p&gt;The paper is here [1]. It begins with: &amp;quot;&amp;quot;&amp;quot; The purpose of this paper is to give a finite algorithm for computing the set of irreducible unitary representations of a real reductive Lie group G. Before explaining the nature of the algorithm, it is worth recalling why this is an interesting question. A serious historical survey would go back at least to the work of Fourier (which can be understood in terms of the irreducible unitary representations of the circle). &amp;quot;&amp;quot;&amp;quot; This work is also related to the &amp;quot;Langlands program&amp;quot;, which is perhaps the mathematician&amp;#x27;s version of a grand unified theory of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1212.2192/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.RT</category></item></channel></rss>
