Search arXivSearch

arXiv · 1410.2772

Variations of the Poincaré series for affine Weyl groups and q-analogues of Chebyshev polynomials

Abstract

Let $(W,S)$ be a Coxeter system and write $P_W(q)$ for its Poincaré series. Lusztig has shown that the quotient $P_W(q^2)/P_W(q)$ is equal to a certain power series $L_{W}(q)$, defined by specializing one variable in the generating function recording the lengths and absolute lengths of the involutions in $W$. The simplest inductive method of proving this result for finite Coxeter groups suggests a natural bivariate generalization $L^J_W(s,q) \in \mathbb{Z}[[s,q]]$ depending on a subset $J\subset S$. This new power series specializes to $L_W(q)$ when $s=-1$ and is given explicitly by a sum of rational functions over the involutions which are minimal length representatives of the double cosets of the parabolic subgroup $W_J$ in $W$. When $ W$ is an affine Weyl group, we consider the renormalized power series $T_{ W}(s,q) = L^J_W(s,q) / L_W(q)$ with $J$ given by the generating set of the corresponding finite Weyl group. We show that when $W$ is an affine Weyl group of type $A$, the power series $T_W(s,q)$ is actually a polynomial in $s$ and $q$ with nonnegative coefficients, which turns out to be a $q$-analogue recently studied by Cigler of the Chebyshev polynomials of the first kind, arising in a completely different context.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eric Marberg, Graham White. 2016-08-17. Variations of the Poincaré series for affine Weyl groups and q-analogues of Chebyshev polynomials. https://doi.org/10.1016/j.aam.2016.08.003

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO