weyl groups
Recently Published Documents


TOTAL DOCUMENTS

386
(FIVE YEARS 52)

H-INDEX

24
(FIVE YEARS 3)

2022 ◽  
Vol 9 (1) ◽  
Author(s):  
Olof Bergvall

AbstractWe develop an algorithm for computing the cohomology of complements of toric arrangements. In the case a finite group $$\Gamma $$ Γ is acting on the arrangement, the algorithm determines the cohomology groups as representations of $$\Gamma $$ Γ . As an important application, we determine the cohomology groups of the complements of the toric arrangements associated with root systems of exceptional type as representations of the corresponding Weyl groups.


Author(s):  
Michael Finkelberg ◽  
David Kazhdan ◽  
Yakov Varshavsky

Author(s):  
Erik Aas ◽  
Arvind Ayyer ◽  
Svante Linusson ◽  
Samu Potka

Abstract Let $W$ be a finite Weyl group and $\widetilde W$ the corresponding affine Weyl group. A random element of $\widetilde W$ can be obtained as a reduced random walk on the alcoves of $\widetilde W$. By a theorem of Lam (Ann. Prob. 2015), such a walk almost surely approaches one of $|W|$ many directions. We compute these directions when $W$ is $B_n$, $C_n$, and $D_n$ and the random walk is weighted by Kac and dual Kac labels. This settles Lam’s questions for types $B$ and $C$ in the affirmative and for type $D$ in the negative. The main tool is a combinatorial two row model for a totally asymmetric simple exclusion process (TASEP) called the $D^*$-TASEP, with four parameters. By specializing the parameters in different ways, we obtain TASEPs for each of the Weyl groups mentioned above. Computing certain correlations in these TASEPs gives the desired limiting directions.


2021 ◽  
Vol 130 ◽  
pp. 102225
Author(s):  
Thomas Folz-Donahue ◽  
Steven Glenn Jackson ◽  
Todor Milev ◽  
Alfred G. Noël
Keyword(s):  

10.37236/9982 ◽  
2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Antoine Abram ◽  
Nathan Chapelier-Laget ◽  
Christophe Reutenauer

Motivated by the study of affine Weyl groups, a ranked poset structure is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an interval in the affine symmetric group $\tilde S_n$ with the weak order. The poset is a semidistributive lattice, and the rank function, whose range is cubic in $n$, is computed by some special formula involving inversions. We prove also some links with Eulerian numbers, triangulations of an $n$-gon, and Young's lattice.


Sign in / Sign up

Export Citation Format

Share Document