13 citations · 41 across the 14 of their papers we have counts for
15 papers
Decomposition of the longest element of the Weyl group using factors corresponding to the highest roots
Rafael Stekolshchik
Let be a root system of a finite Weyl group with simple roots and corresponding simple reflections . For , denote by the standard paraboli…
Extending Snow's algorithm for computations in the finite Weyl groups
Rafael Stekolshchik
In 1990, D.Snow proposed an effective algorithm for computing the orbits of finite Weyl groups. Snow's algorithm is designed for computation of weights, -orbits and elements of…
Transitions between root subsets associated with Carter diagrams
Rafael Stekolshchik
For any two root subsets associated with two Carter diagrams that have the same type and the same size, we construct the transition matrix that maps one subset to the other.…
Some approaches used to overcome overestimation in Deep Reinforcement Learning algorithms
Rafael Stekolshchik
Some phenomena related to statistical noise which have been investigated by various authors under the framework of deep reinforcement learning (RL) algorithms are discussed. The fo…
Classification of linkage systems
Rafael Stekolshchik
A linkage diagram is obtained from the Carter diagram by adding an extra root , so that the resulting subset of roots is linearly independent. With every linkage diagram we…
Coxeter Transformations, the McKay correspondence, and the Slodowy correspondence
Rafael Stekolshchik
This talk was presented at Workshop "Spectral Methods in Representation Theory of Algebras and Applications to the Study of Rings of Singularities", 2008 (Banff, Canada). W. Ebelin…