Search arXivSearch

arXiv · 1508.03912

Distance regularity in buildings and structure constants in Hecke algebras

Abstract

In this paper we define generalised spheres in buildings using the simplicial structure and Weyl distance in the building, and we derive an explicit formula for the cardinality of these spheres. We prove a generalised notion of distance regularity in buildings, and develop a combinatorial formula for the cardinalities of intersections of generalised spheres. Motivated by the classical study of algebras associated to distance regular graphs we investigate the algebras and modules of Hecke operators arising from our generalised distance regularity, and prove isomorphisms between these algebras and more well known parabolic Hecke algebras. We conclude with applications of our main results to non-negativity of structure constants in parabolic Hecke algebras, commutativity of algebras of Hecke operators, double coset combinatorics in groups with $BN$-pairs, and random walks on the simplices of buildings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peter Abramenko, James Parkinson, Hendrik Van Maldeghem. 2017-02-28. Distance regularity in buildings and structure constants in Hecke algebras. https://arxiv.org/abs/1508.03912

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO