Search arXivSearch

arXiv · 1102.2460

Spectra of Symmetrized Shuffling Operators

Abstract

(Abridged abstract) For a finite real reflection group W and a W-orbit O of flats in its reflection arrangement---or equivalently a conjugacy class of its parabolic subgroups---we introduce a statistic on elements of W. We then study the operator of right-multiplication within the group algebra of W by the element whose coefficients are given by this statistic. We reinterpret the operators geometrically in terms of the arrangement of reflecting hyperplanes for W. We show that they are self-adjoint and positive semidefinite. via two explicit factorizations into a symmetrized form A^t A. In one such factorization, A is a generalization of the projection of a simplex onto the linear ordering polytope. In the other factorization, A is the transition matrix for one of the well-studied Bidigare-Hanlon-Rockmore random walks on the chambers of an arrangement. We study the family of operators in which O is the conjugacy classes of Young subgroups of type (k,1^{n-k}). A special case within this family is the operator corresponding to random-to-random shuffling. We show in a purely enumerative fashion that these operators pairwise commute. We furthermore conjecture that they have integer spectrum, generalizing a conjecture of Uyemura-Reyes for the case k=n-1. We use representation theory to show that if O is a conjugacy class of rank one parabolics in W, the corresponding operator has integer spectrum. Our proof makes use of an (apparently) new family of twisted Gelfand pairs for W. We also study the family of operators in which O is the conjugacy classes of Young subgroups of type (2^k,1^{n-2k}). Here the construction of a Gelfand model for the symmetric group shows that these operators pairwise commute and that they have integer spectrum. For the symmetric group, we conjecture that apart from the two commuting families above, no other pair of operators of this form commutes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor Reiner, Franco Saliola, Volkmar Welker. 2011-04-21. Spectra of Symmetrized Shuffling Operators. https://arxiv.org/abs/1102.2460

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