SearcharxivSearch

arXiv subjects

Benjamin Strasser

Publications and source records attributed to Benjamin Strasser.

2 recordsLinked to original sources

An orbit model for the spectra of nilpotent Gelfand pairs

Let $N$ be a connected and simply connected nilpotent Lie group, and let $K$ be a subgroup of the automorphism group of $N$. We say that the pair $(K,N)$ is a nilpotent Gelfand pair if $L^1_K(N)$ is an abelian algebra under convolution. In this document we establish a geometric model for the Gelfand spectra of nilpotent Gelfand pairs $(K,N)$ where the $K$-orbits in the center of $N$ have a one-parameter cross section and satisfy a certain non-degeneracy condition. More specifically, we show that the one-to-one correspondence between the set $\Delta(K,N)$ of bounded $K$-spherical functions on $N$ and the set $\mathcal{A}(K,N)$ of $K$-orbits in the dual $\mathfrak{n}^*$ of the Lie algebra for $N$ established by Benson and Ratcliff is a homeomorphism for this class of nilpotent Gelfand pairs. This result had previously been shown for $N$ a free group and $N$ a Heisenberg group, and was conjectured to hold for all nilpotent Gelfand pairs.

math.RT

A Characterization of the Prime Graphs of Solvable Groups

Let π(G) denote the set of prime divisors of the order of a finite group G. The prime graph of G is the graph with vertex set π(G) with edges {p,q} if and only if there exists an element of order pq in G. In this paper, we prove that a graph is isomorphic to the prime graph of a solvable group if and only if its complement is 3-colorable and triangle free. We then introduce the idea of a minimal prime graph. We prove that there exists an infinite class of solvable groups whose prime graphs are minimal. We prove the 3k-conjecture on prime divisors in element orders for solvable groups with minimal prime graphs, and we show that solvable groups whose prime graphs are minimal have Fitting length 3 or 4.

math.GR