Search arXivSearch

arXiv · 2303.16569

Shi arrangements and low elements in Coxeter groups

Abstract

Given an arbitrary Coxeter system $(W,S)$ and a nonnegative integer $m$, the $m$-Shi arrangement of $(W,S)$ is a subarrangement of the Coxeter hyperplane arrangement of $(W,S)$. The classical Shi arrangement ($m=0$) was introduced in the case of affine Weyl groups by Shi to study Kazhdan-Lusztig cells for $W$. As two key results, Shi showed that each region of the Shi arrangement contains exactly one element of minimal length in $W$ and that the union of their inverses form a convex subset of the Coxeter complex. The set of $m$-low elements in $W$ were introduced to study the word problem of the corresponding Artin-Tits (braid) group and they turn out to produce automata to study the combinatorics of reduced words in $W$. In this article, we generalize and extend Shi's results to any Coxeter system for any $m$: (1) the set of minimal length elements of the regions in a $m$-Shi arrangement is precisely the set of $m$-low elements, settling a conjecture of the first and third authors in this case; (2) the union of the inverses of the ($0$-)low elements form a convex subset in the Coxeter complex, settling a conjecture by the third author, Nadeau and Williams.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew Dyer, Christophe Hohlweg, Susanna Fishel, Alice Mark. 2024-06-24. Shi arrangements and low elements in Coxeter groups. https://doi.org/10.1112/plms.12624

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