Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Stekolshchik, Rafael"'
Autor:
Stekolshchik, Rafael
The notions of special and extraspecial pairs of roots were introduced by Carter for calculating structure constants, [Ca72]. Let $\{r, s\}$ be a special pair of roots for which the structure constant $N(r,s)$ is sought, and let $\{r_1, s_1\}$ be the
Externí odkaz:
http://arxiv.org/abs/2409.13552
Autor:
Stekolshchik, Rafael
We consider subsets of linearly independent roots in a certain root system $\varPhi$. Let $S'$ be such a subset, and let $S'$ be associated with any Carter diagram $\Gamma'$. The main question of the paper: what root $\gamma \in \varPhi$ can be added
Externí odkaz:
http://arxiv.org/abs/2406.10726
Autor:
Stekolshchik, Rafael
Let $\varPhi$ be a root system of a finite Weyl group $W$ with simple roots $\Delta$ and corresponding simple reflections $S$. For $J \subseteq S$, denote by $W_J$ the standard parabolic subgroup of $W$ generated by $J$, and by $\Delta_J \subseteq \D
Externí odkaz:
http://arxiv.org/abs/2306.00397
Autor:
Stekolshchik, Rafael
Publikováno v:
Fixed Point Theory and Algorithms for Sciences and Engineering (2023) 2023:15, 1--45
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, $W$-orbits and elements of the Weyl group. An extension of Snow's algorithm is proposed, which al
Externí odkaz:
http://arxiv.org/abs/2212.03156
Autor:
Stekolshchik, Rafael
Publikováno v:
Communications in Mathematics, Volume 30 (2022), Issue 3 (Special issue: in memory of Arkady Onishchik) (July 11, 2023) cm:9760
For any two root subsets associated with two Carter diagrams that have the same $ADE$ type and the same size, we construct the transition matrix that maps one subset to the other. The transition between these two subsets is carried out in some canoni
Externí odkaz:
http://arxiv.org/abs/2203.07958
Autor:
Stekolshchik, Rafael
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 following algorithms are examined: the deep Q-network (DQN), double DQN,
Externí odkaz:
http://arxiv.org/abs/2006.14167
Autor:
Stekolshchik, Rafael1 (AUTHOR) r.stekol@gmail.com
Publikováno v:
Fixed Point Theory & Algorithms for Sciences & Engineering. 11/20/2023 Suppl, Vol. 2023, p1-45. 45p.
Autor:
Stekolshchik, Rafael
A linkage diagram is obtained from the Carter diagram $\Gamma$ by adding an extra root $\gamma$, so that the resulting subset of roots is linearly independent. With every linkage diagram we associate the linkage label vector $\gamma^{\nabla}$, simila
Externí odkaz:
http://arxiv.org/abs/1406.3049
Autor:
Stekolshchik, Rafael
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. Ebeling established a connection between certain Poincare series, the Coxete
Externí odkaz:
http://arxiv.org/abs/1311.0377
Autor:
Stekolshchik, Rafael
A diagram obtained from the Carter diagram $\Gamma$ by adding one root together with its bonds such that the resulting subset of roots is linearly independent is said to be the {\it linkage diagram}. Given a linkage diagram, we associate the linkage
Externí odkaz:
http://arxiv.org/abs/1105.2875