Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0610702

The numbers game, geometric representations of Coxeter groups, and Dynkin diagram classification results

Robert G. Donnelly
View original source ↗Read source document ↗Export metadata ↓

Abstract

The numbers game is a one-player game played on a finite simple graph with certain ``amplitudes'' assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at the nodes using the amplitudes in a certain way. This game has been studied previously by Proctor, Mozes, Bjorner, Eriksson, and Wildberger. We show that those connected such graphs for which the numbers game meets a certain finiteness requirement are precisely the Dynkin diagrams associated with the finite-dimensional complex simple Lie algebras. As a consequence of our proof we obtain the classifications of the finite-dimensional Kac-Moody algebras and of the finite Weyl groups. We use Coxeter group theory to establish a more general result that applies to Eriksson's E-games: an E-game meets the finiteness requirement if and only if a naturally associated Coxeter group is finite. To prove this and some other finiteness results we further develop Eriksson's theory of a geometric representation of Coxeter groups and observe some curious differences of this representation from the standard geometric representation.

Explore related subjects

math.COmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Robert G. Donnelly. 2006-10-23. The numbers game, geometric representations of Coxeter groups, and Dynkin diagram classification results. https://arxiv.org/abs/math/0610702

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗