Eriksson's numbers game on certain edge-weighted three-node cyclic graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

5 pages. v2: References updated

Scientific paper

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 and its interactions with Coxeter/Weyl group theory and Lie theory have been studied by many authors. Following Eriksson, we allow the amplitudes on graph edges to be certain real numbers. Games played on such graphs are ``E-games.'' We show that for certain such three-node cyclic graphs, any numbers game will diverge when played from an initial assignment of nonnegative real numbers not all zero. This result is a key step in a Dynkin diagram classification (obtained elsewhere) of all E-game graphs which meet a certain finiteness requirement.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Eriksson's numbers game on certain edge-weighted three-node cyclic graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Eriksson's numbers game on certain edge-weighted three-node cyclic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Eriksson's numbers game on certain edge-weighted three-node cyclic graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-170098

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.