37 citations · 193 across the 39 of their papers we have counts for
5 papers · 1 filter
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…
Promotion and cyclic sieving on families of SSYT
Per Alexandersson, Ezgi Kantarci Oğuz, Svante Linusson
We examine a few families of semistandard Young tableaux, for which we observe the cyclic sieving phenomenon under promotion. The first family we consider consists of stretched hoo…
Skew characters and cyclic sieving
Per Alexandersson, Stephan Pfannerer, Martin Rubey +1
In 2010, B. Rhoades proved that promotion together with the fake-degree polynomial associated with rectangular standard Young tableaux give an instance of the cyclic sieving phenom…
A combinatorial expansion of vertical-strip LLT polynomials in the basis of elementary symmetric functions
Per Alexandersson, Robin Sulzgruber
We give a new characterization of the vertical-strip LLT polynomials as the unique family of symmetric functions that satisfy certain combinatorial relations.…
NP-complete variants of some classical graph problems
Per Alexandersson
Some classical graph problems such as finding minimal spanning tree, shortest path or maximal flow can be done efficiently. We describe slight variations of such problems which are…