Equivariant perverse sheaves on Coxeter arrangements and buildings

When $W$ is a finite Coxeter group acting by its reflection representation on $E$, we describe the category ${\mathsf{Perv}}_W(E_{\mathbb C}, {\mathcal{H}}_{\mathbb C})$ of $W$-equivariant perverse sheaves on $E_{\mathbb C}$, smooth with respect to the stratification by reflection hyperplanes. By using Kapranov and Schechtman's recent analysis of perverse sheaves on hyperplane arrangements, we find an equivalence of categories from ${\mathsf{Perv}}_W(E_{\mathbb C}, {\mathcal{H}}_{\mathbb C})$ to a category of finite-dimensional modules over an algebra given by explicit generators and relations. We also define categories of equivariant perverse sheaves on affine buildings, e.g., $G$-equivariant perverse sheaves on the Bruhat--Tits building of a $p$-adic group $G$. In this setting, we find that a construction of Schneider and Stuhler gives equivariant perverse sheaves associated to depth zero representations.Comment: 28 pages, 6 figures. v5 processed for publication in Epig

The arithmetic of arithmetic Coxeter groups

In the 1990s, J.H. Conway published a combinatorial-geometric method for analyzing integer-valued binary quadratic forms (BQFs). Using a visualization he named the "topograph," Conway revisited the reduction of BQFs and the solution of quadratic Diophantine equations such as Pell's equation. It appears that the crux of his method is the coincidence between the arithmetic group $PGL_2({\mathbb Z})$ and the Coxeter group of type $(3,\infty)$. There are many arithmetic Coxeter groups, and each may have unforeseen applications to arithmetic. We introduce Conway's topograph, and generalizations to other arithmetic Coxeter groups. This includes a study of "arithmetic flags" and variants of binary quadratic forms.Comment: 14 pages, 11 figure

Capacity of a POST Channel with and without Feedback

We consider finite state channels where the state of the channel is its previous output. We refer to these as POST (Previous Output is the STate) channels. We first focus on POST($\alpha$) channels. These channels have binary inputs and outputs, where the state determines if the channel behaves as a $Z$ or an $S$ channel, both with parameter $\alpha$. %with parameter $\alpha.$ We show that the non feedback capacity of the POST($\alpha$) channel equals its feedback capacity, despite the memory of the channel. The proof of this surprising result is based on showing that the induced output distribution, when maximizing the directed information in the presence of feedback, can also be achieved by an input distribution that does not utilize of the feedback. We show that this is a sufficient condition for the feedback capacity to equal the non feedback capacity for any finite state channel. We show that the result carries over from the POST($\alpha$) channel to a binary POST channel where the previous output determines whether the current channel will be binary with parameters $(a,b)$ or $(b,a)$. Finally, we show that, in general, feedback may increase the capacity of a POST channel