Many questions remain open: how does the dimension of the layers grow if rank grows?
Statement
Many questions remain open: how does the dimension of the layers grow if rank grows? Can one tell from a graph how many vertices are contained in the in intersection of a component with a given layer? 3. How to navigate the galaxy? Classical approaches to the isomorphism problem involve a) reducing to a specific subclass of Coxeter groups and to b) finding explicit moves, i.e. explicit manipu- lations, between defining graphs. These moves correspond to edges in the Coxeter galaxy. Although many preliminary results exist, several fundamental problems remain open: Question 3.1 (Reachability and Coloring Problem). Does there exist a finite list of vertical and horizontal moves such that, for any vertex in the Coxeter galaxy, any other vertex in its connected component can be reached by applying a finite sequence of these moves? Can such an algorithm also output which kinds of moves are needed along a path between vertices of the galaxy? This question (implicitly) appeared multiple times in the literature and was answered positively in some cases. For example, Howlett and Mühlherr introduced moves called blow-ups. Results by Mihalik, Ratcliffe, and Tschantz imply that they suffice to vertically navigate the galaxy. The current state of the art concerning the corresponding horizontal question revolves around Mühlherr’s twist conjecture, which is discussed in detail in the final sec
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.