3 citations · 7 across the 6 of their papers we have counts for
8 papers
Refined Catalan and Narayana cyclic sieving
Per Alexandersson, Svante Linusson, Samu Potka +1
We prove several new instances of the cyclic sieving phenomenon (CSP) on Catalan objects of type A and type B. Moreover, we refine many of the known instances of the CSP on Catalan…
Limiting directions for random walks in classical affine Weyl groups
Erik Aas, Arvind Ayyer, Svante Linusson +1
Let be a finite Weyl group and the corresponding affine Weyl group. A random element of can be obtained as a reduced random walk on the alcoves of…
The cyclic sieving phenomenon on circular Dyck paths
Per Alexandersson, Svante Linusson, Samu Potka
We give a -enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Ale…
The exact phase diagram for a semipermeable TASEP with nonlocal boundary jumps
Erik Aas, Arvind Ayyer, Svante Linusson +1
We consider a finite one-dimensional totally asymmetric simple exclusion process (TASEP) with four types of particles, , in contact with reservoirs. Particles of…
On random shifted standard Young tableaux and 132-avoiding sorting networks
Svante Linusson, Samu Potka, Robin Sulzgruber
We study shifted standard Young tableaux (SYT). The limiting surface of uniformly random shifted SYT of staircase shape is determined, with the integers in the SYT as heights. This…
Properties of the Edelman-Greene bijection
Svante Linusson, Samu Potka
Edelman and Greene constructed a correspondence between reduced words of the reverse permutation and standard Young tableaux. We prove that for any reduced word the shape of the re…
Betti numbers of cut ideals of trees
Samu Potka, Camilo Sarmiento
Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraic statistics. We study the minimal free resolutions of cut ideals of tree graphs. By employ…
Higher connectivity of fiber graphs of Gröbner bases
Samu Potka
Fiber graphs of Gröbner bases from contingency tables are important in statistical hypothesis testing, where one studies random walks on these graphs using the Metropolis-Hastings…