## Contact

**KTH Royal Institute of Technology**

*SE-100 44 Stockholm Sweden +46 8 790 60 00*

[1]

S. Linusson, P. Restadh and L. Solus, "GREEDY CAUSAL DISCOVERY IS GEOMETRIC," *SIAM Journal on Discrete Mathematics*, vol. 37, no. 1, pp. 233-252, 2023.

[2]

S. Linusson and M. T. Stamps, "Association and Simpson conversion in 2 × 2 × 2 contingency tables," *Algebraic Statistics*, vol. 12, no. 1, pp. 57-74, 2021.

[3]

E. Aas *et al.*, "Limiting Directions for Random Walks in Classical Affine Weyl Groups," *International mathematics research notices*, 2021.

[4]

P. Alexandersson, E. K. Oguz and S. Linusson, "Promotion and cyclic sieving on families of SSYT," *Arkiv för matematik*, vol. 59, no. 2, pp. 247-274, 2021.

[5]

P. Alexandersson *et al.*, "Refined Catalan and Narayana cyclic sieving," *Combinatorial Theory*, vol. 1, no. 0, 2021.

[6]

S. Linusson, S. Potka and R. Sulzgruber, "On random shifted standard Young tableaux and 132-avoiding sorting networks," *Algebraic Combinatorics*, vol. 3, no. 6, pp. 1231-1258, 2020.

[7]

S. Linusson and S. Potka, "Properties of the Edelman-Greene bijection," *Journal of Combinatorics*, vol. 11, no. 2, pp. 249-273, 2020.

[8]

S. Linusson, "Erratum to 'On Percolation and the Bunkbed Conjecture' (vol 20, pg 103, 2011)," *Combinatorics, probability & computing*, vol. 28, no. 6, pp. 917-918, 2019.

[9]

A. Asinowski *et al.*, "Pop-stack sorting and its image : Permutations with overlapping runs," *Acta Mathematica Universitatis Comenianae*, vol. 88, no. 3, pp. 395-402, 2019.

[10]

A. Ayyer and S. Linusson, "Reverse juggling processes," *Random structures & algorithms (Print)*, vol. 55, no. 1, pp. 56-72, 2019.

[11]

P. Alexandersson, S. Linusson and S. Potka, "The cyclic sieving phenomenon on circular Dyck paths," *The Electronic Journal of Combinatorics*, vol. 26, no. 4, 2019.

[12]

E. Aas *et al.*, "The exact phase diagram for a semipermeable TASEP with nonlocal boundary jumps," *Journal of Physics A : Mathematical and Theoretical*, vol. 52, no. 35, 2019.

[13]

A. Ayyer *et al.*, "Bumping sequences and multispecies juggling," *Advances in Applied Mathematics*, vol. 98, pp. 100-126, 2018.

[14]

E. Aas and S. Linusson, "Continuous multi-line queues and TASEP," *ANNALES DE L INSTITUT HENRI POINCARE D*, vol. 5, no. 1, pp. 127-152, 2018.

[15]

A. Ayyer and S. Linusson, "Correlations in the multispecies tasep and a conjecture by Lam," *Transactions of the American Mathematical Society*, vol. 369, no. 2, pp. 1097-1125, 2017.

[16]

M. Leander and S. Linusson, "Correlation of paths between distinct vertices in a randomly oriented graph," *Mathematica Scandinavica*, vol. 116, no. 2, pp. 287-300, 2015.

[17]

A. Ayyer and S. Linusson, "An inhomogeneous multispecies TASEP on a ring," *Advances in Applied Mathematics*, vol. 57, pp. 21-43, 2014.

[18]

S. Linusson and G. Ryd, "Dynamic adjustment : An electoral method for relaxed double proportionality," *Annals of Operations Research*, vol. 215, no. 1, pp. 183-199, 2014.

[19]

S. E. Alm, S. Janson and S. Linusson, "First critical probability for a problem on random orientations in G(n,p)," *Electronic Journal of Probability*, vol. 19, pp. 69, 2014.

[20]

S. Linusson, J. Shareshian and M. L. Wachs, "Rees products and lexicographic shellability," *Journal of Combinatorics*, vol. 3, no. 3, pp. 243-276, 2012.

[21]

S. Janson and S. Linusson, "The Probability Of The Alabama Paradox," *Journal of Applied Probability*, vol. 49, no. 3, pp. 773-794, 2012.

[22]

S. E. Alm and S. Linusson, "A Counter-Intuitive Correlation in a Random Tournament," *Combinatorics, probability & computing*, vol. 20, no. 1, pp. 1-9, 2011.

[23]

S. E. Alm, S. Janson and S. Linusson, "Correlations for Paths in Random Orientations of G(n, p) and G(n, m)," *Random structures & algorithms (Print)*, vol. 39, no. 4, pp. 486-506, 2011.

[24]

S. Linusson, "On Percolation and the Bunkbed Conjecture," *Combinatorics, probability & computing*, vol. 20, no. 1, pp. 103-117, 2011.

[25]

A. Claesson and S. Linusson, "n! MATCHINGS, n! POSETS," *Proceedings of the American Mathematical Society*, vol. 139, no. 2, pp. 435-449, 2011.

[26]

D. R. Wood and S. Linusson, "Thomassen's Choosability Argument Revisited," *SIAM Journal on Discrete Mathematics*, vol. 24, no. 4, pp. 1632-1637, 2010.

[27]

A. Hultman *et al.*, "From Bruhat intervals to intersection lattices and a conjecture of Postnikov," *Journal of combinatorial theory. Series A (Print)*, vol. 116, no. 3, pp. 564-580, 2009.

[28]

[29]

J. Gill *et al.*, "A regular decomposition of the edge-product space of phylogenetic trees," *Advances in Applied Mathematics*, vol. 41, no. 2, pp. 158-176, 2008.

[30]

S. Linusson, J. Shareshian and V. Welker, "Complexes of graphs with bounded matching size," *Journal of Algebraic Combinatorics*, vol. 27, no. 3, pp. 331-349, 2008.

[31]

M. Bousquet-Melou, S. Linusson and E. Nevo, "On the independence complex of square grids," *Journal of Algebraic Combinatorics*, vol. 27, no. 4, pp. 423-450, 2008.

[32]

S. Linusson and J. Wastlund, "Completing a (k-1)-assignment," *Combinatorics, probability & computing*, vol. 16, no. 4, pp. 621-629, 2007.

[33]

H. Eriksson *et al.*, "Dense packing of patterns in a permutation," *Annals of Combinatorics*, vol. 11, no. 3-4, pp. 459-470, 2007.

[34]

R. Johansson and S. Linusson, "Pattern avoidance in alternating sign matrices," *Annals of Combinatorics*, vol. 11, no. 04-mar, pp. 471-480, 2007.

[35]

J. Backelin and S. Linusson, "Parity splits by triple point distances in X-trees," *Annals of Combinatorics*, vol. 10, no. 1, pp. 1-18, 2006.

[36]

S. Linusson and J. Wastlund, "A proof of Parisi's conjecture on the random assignment problem," *Probability theory and related fields*, vol. 128, no. 3, pp. 419-440, 2004.

[37]

S. Linusson and J. Shareshian, "Complexes of t-colorable graphs," *SIAM Journal on Discrete Mathematics*, vol. 16, no. 3, pp. 371-389, 2003.

[38]

S. Linusson, "Extended pattern avoidance," *Discrete Mathematics*, vol. 246, no. 03-jan, pp. 219-230, 2002.

[39]

J. Håstad, S. Linusson and J. Wastlund, "A smaller sleeping bag for a baby snake," *Discrete & Computational Geometry*, vol. 26, no. 1, pp. 173-181, 2001.

[40]

K. Eriksson and S. Linusson, "A combinatorial theory of higher-dimensional permutation arrays," *Advances in Applied Mathematics*, vol. 25, no. 2, pp. 194-211, 2000.

[41]

K. Eriksson and S. Linusson, "A decomposition of Fl(n)(d) indexed by permutation arrays," *Advances in Applied Mathematics*, vol. 25, no. 2, pp. 212-227, 2000.

[42]

O. Guibert and S. Linusson, "Doubly alternating Baxter permutations are Catalan," *Discrete Mathematics*, vol. 217, no. 03-jan, pp. 157-166, 2000.

[43]

S. Linusson *et al.*, "Complexes of not i-connected graphs," *Topology*, vol. 38, no. 2, pp. 271-299, 1999.

[44]

S. Linusson, S. Potka and R. Sulzgruber, "On random shifted standard Young tableaux and 132-avoiding sorting networks," in *FPSAC 2019 - 31st International Conference on Formal Power Series and Algebraic Combinatorics*, 2019.

[45]

S. Linusson and S. Potka, "Properties of the edelman-greene bijection (extended abstract)," in *FPSAC 2018 - 30th international conference on Formal Power Series and Algebraic Combinatorics*, 2018.

[46]

A. Ayyer *et al.*, "Some generalized juggling processes (extended abstract)," in *DMTCS proc. FPSAC'15*, 2015, pp. 925-936.

[47]

A. Claesson and S. Linusson, "N! matchings, n! posets (extended abstract)," in *FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics*, 2010, pp. 637-648.

[48]

A. Hultman *et al.*, "From Bruhat intervals to intersection lattices and a conjecture of Postnikov," in *FPSAC - Int. Conf. Form. Power Ser. Algebraic Comb.*, 2008, pp. 203-214.

[49]

S. Linusson, "Uddaltasmetoden och röstningsprocesser," in *Matematik och människor : läsebok för nyfikna, *Ola Helenius & Karin Wallby Ed., Göteborg : Göteborgs universitet, 2008.

[50]

S. Janson and S. Linusson, "Proportionella val inom kommunfullmäktige," Uppsala University, Analysis and Probability Theory, 2019.

[51]

[52]

E. Aas *et al.*, "Limiting directions for random walks in classical affine Weyl groups," (Manuscript).

[53]

[54]

S. Linusson, S. Potka and R. Sulzgruber, "On random shifted standard Young tableaux and 132-avoiding sorting networks," (Manuscript).

[55]

S. Linusson, S. Potka and R. Sulzgruber, "On random shifted standard Young tableaux and 132-avoiding sorting networks," (Manuscript).

[56]

S. Linusson, P. Restadh and L. Solus, "On the Edges of Characteristic Imset Polytopes," (Manuscript).

[57]

[58]

Senaste synkning med DiVA:

2023-06-05 00:18:51

**KTH Royal Institute of Technology**

*SE-100 44 Stockholm Sweden +46 8 790 60 00*