Papers
Topics
Authors
Recent
Search
2000 character limit reached

Solutions of Reeder's Puzzle

Published 10 Nov 2015 in math.CO | (1511.03069v4)

Abstract: In this paper we consider the generalized Reeder's puzzle, introduced by Reeder in 2005 and generalized by Borovoi and Evenor in 2016. We give a detailed solution of the puzzle for the graphs of Dynkin diagrams and affine Dynkin diagrams. We find the number of equivalence classes in each case. We also discuss more general graphs, and prove the main theorem about graphs (simply-laced trees) that contain E_6 as a subgraph.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up