Search arXivSearch

arXiv · 2405.14395

Edge Zeta Functions and Eigenvalues for Buildings of Finite Groups of Lie Type

Abstract

For the Tits building B(G) of a finite group of Lie type G(Fq), we study the edge zeta function, which enumerates edge-geodesic cycles in the 1-skeleton. We show that every nonzero edge eigenvalue becomes a power of q after raising to a bounded exponent k depending on the type of G. The proof is uniform across types using a Hecke algebra approach. This extends previous results for type A and for oppositeness graphs to the full edge-geodesic setting and all finite groups of Lie type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jianhao Shen. 2026-04-15. Edge Zeta Functions and Eigenvalues for Buildings of Finite Groups of Lie Type. https://arxiv.org/abs/2405.14395

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