Search arXivSearch

arXiv · 1901.06945

The action of the Weyl group on the $E_8$ root system

Abstract

Let $Γ$ be the graph on the roots of the $E_8$ root system, where any two distinct vertices $e$ and $f$ are connected by an edge with color equal to the inner product of $e$ and $f$. For any set $c$ of colors, let $Γ_c$ be the subgraph of $Γ$ consisting of all the $240$ vertices, and all the edges whose color lies in $c$. We consider cliques, i.e., complete subgraphs, of $Γ$ that are either monochromatic, or of size at most $3$, or a maximal clique in $Γ_c$ for some color set $c$, or whose vertices are the vertices of a face of the $E_8$ root polytope. We prove that, apart from two exceptions, two such cliques are conjugate under the automorphism group of $Γ$ if and only if they are isomorphic as colored graphs. Moreover, for an isomorphism $f$ from one such clique $K$ to another, we give necessary and sufficient conditions for $f$ to extend to an automorphism of $Γ$, in terms of the restrictions of $f$ to certain special subgraphs of $K$ of size at most 7.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rosa Winter, Ronald van Luijk. 2021-07-18. The action of the Weyl group on the $E_8$ root system. https://doi.org/10.1007/s00373-021-02315-8

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

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO