Publikationer av Svante Linusson
Refereegranskade
Artiklar
[1]
S. Linusson, P. Restadh och L. Solus, "GREEDY CAUSAL DISCOVERY IS GEOMETRIC," SIAM Journal on Discrete Mathematics, vol. 37, no. 1, s. 233-252, 2023.
[2]
S. Hopkins, A. Lazar och S. Linusson, "On the q-enumeration of barely set-valued tableaux and plane partitions," European journal of combinatorics (Print), vol. 113, 2023.
[3]
S. Linusson och M. T. Stamps, "Association and Simpson conversion in 2 × 2 × 2 contingency tables," Algebraic Statistics, vol. 12, no. 1, s. 57-74, 2021.
[4]
E. Aas et al., "Limiting Directions for Random Walks in Classical Affine Weyl Groups," International mathematics research notices, vol. 2023, no. 4, s. 3092-3137, 2021.
[5]
P. Alexandersson, E. K. Oguz och S. Linusson, "Promotion and cyclic sieving on families of SSYT," Arkiv för matematik, vol. 59, no. 2, s. 247-274, 2021.
[6]
P. Alexandersson et al., "Refined Catalan and Narayana cyclic sieving," Combinatorial Theory, vol. 1, no. 0, 2021.
[7]
S. Linusson, S. Potka och R. Sulzgruber, "On random shifted standard Young tableaux and 132-avoiding sorting networks," Algebraic Combinatorics, vol. 3, no. 6, s. 1231-1258, 2020.
[8]
S. Linusson och S. Potka, "Properties of the Edelman-Greene bijection," Journal of Combinatorics, vol. 11, no. 2, s. 249-273, 2020.
[9]
S. Linusson, "Erratum to 'On Percolation and the Bunkbed Conjecture' (vol 20, pg 103, 2011)," Combinatorics, probability & computing, vol. 28, no. 6, s. 917-918, 2019.
[10]
A. Asinowski et al., "Pop-stack sorting and its image : Permutations with overlapping runs," Acta Mathematica Universitatis Comenianae, vol. 88, no. 3, s. 395-402, 2019.
[11]
A. Ayyer och S. Linusson, "Reverse juggling processes," Random structures & algorithms (Print), vol. 55, no. 1, s. 56-72, 2019.
[12]
P. Alexandersson, S. Linusson och S. Potka, "The cyclic sieving phenomenon on circular Dyck paths," The Electronic Journal of Combinatorics, vol. 26, no. 4, 2019.
[13]
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.
[14]
A. Ayyer et al., "Bumping sequences and multispecies juggling," Advances in Applied Mathematics, vol. 98, s. 100-126, 2018.
[15]
E. Aas och S. Linusson, "Continuous multi-line queues and TASEP," ANNALES DE L INSTITUT HENRI POINCARE D, vol. 5, no. 1, s. 127-152, 2018.
[16]
A. Ayyer och S. Linusson, "Correlations in the multispecies tasep and a conjecture by Lam," Transactions of the American Mathematical Society, vol. 369, no. 2, s. 1097-1125, 2017.
[17]
M. Leander och S. Linusson, "Correlation of paths between distinct vertices in a randomly oriented graph," Mathematica Scandinavica, vol. 116, no. 2, s. 287-300, 2015.
[18]
A. Ayyer och S. Linusson, "An inhomogeneous multispecies TASEP on a ring," Advances in Applied Mathematics, vol. 57, s. 21-43, 2014.
[19]
S. Linusson och G. Ryd, "Dynamic adjustment : An electoral method for relaxed double proportionality," Annals of Operations Research, vol. 215, no. 1, s. 183-199, 2014.
[20]
S. E. Alm, S. Janson och S. Linusson, "First critical probability for a problem on random orientations in G(n,p)," Electronic Journal of Probability, vol. 19, s. 69, 2014.
[21]
S. Linusson, J. Shareshian och M. L. Wachs, "Rees products and lexicographic shellability," Journal of Combinatorics, vol. 3, no. 3, s. 243-276, 2012.
[22]
S. Janson och S. Linusson, "The Probability Of The Alabama Paradox," Journal of Applied Probability, vol. 49, no. 3, s. 773-794, 2012.
[23]
S. E. Alm och S. Linusson, "A Counter-Intuitive Correlation in a Random Tournament," Combinatorics, probability & computing, vol. 20, no. 1, s. 1-9, 2011.
[24]
S. E. Alm, S. Janson och S. Linusson, "Correlations for Paths in Random Orientations of G(n, p) and G(n, m)," Random structures & algorithms (Print), vol. 39, no. 4, s. 486-506, 2011.
[25]
S. Linusson, "On Percolation and the Bunkbed Conjecture," Combinatorics, probability & computing, vol. 20, no. 1, s. 103-117, 2011.
[26]
A. Claesson och S. Linusson, "n! MATCHINGS, n! POSETS," Proceedings of the American Mathematical Society, vol. 139, no. 2, s. 435-449, 2011.
[27]
D. R. Wood och S. Linusson, "Thomassen's Choosability Argument Revisited," SIAM Journal on Discrete Mathematics, vol. 24, no. 4, s. 1632-1637, 2010.
[28]
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, s. 564-580, 2009.
[29]
[30]
J. Gill et al., "A regular decomposition of the edge-product space of phylogenetic trees," Advances in Applied Mathematics, vol. 41, no. 2, s. 158-176, 2008.
[31]
S. Linusson, J. Shareshian och V. Welker, "Complexes of graphs with bounded matching size," Journal of Algebraic Combinatorics, vol. 27, no. 3, s. 331-349, 2008.
[32]
M. Bousquet-Melou, S. Linusson och E. Nevo, "On the independence complex of square grids," Journal of Algebraic Combinatorics, vol. 27, no. 4, s. 423-450, 2008.
[33]
S. Linusson och J. Wastlund, "Completing a (k-1)-assignment," Combinatorics, probability & computing, vol. 16, no. 4, s. 621-629, 2007.
[34]
H. Eriksson et al., "Dense packing of patterns in a permutation," Annals of Combinatorics, vol. 11, no. 3-4, s. 459-470, 2007.
[35]
R. Johansson och S. Linusson, "Pattern avoidance in alternating sign matrices," Annals of Combinatorics, vol. 11, no. 04-mar, s. 471-480, 2007.
[36]
J. Backelin och S. Linusson, "Parity splits by triple point distances in X-trees," Annals of Combinatorics, vol. 10, no. 1, s. 1-18, 2006.
[37]
S. Linusson och J. Wastlund, "A proof of Parisi's conjecture on the random assignment problem," Probability theory and related fields, vol. 128, no. 3, s. 419-440, 2004.
[38]
S. Linusson och J. Shareshian, "Complexes of t-colorable graphs," SIAM Journal on Discrete Mathematics, vol. 16, no. 3, s. 371-389, 2003.
[39]
S. Linusson, "Extended pattern avoidance," Discrete Mathematics, vol. 246, no. 03-jan, s. 219-230, 2002.
[40]
J. Håstad, S. Linusson och J. Wastlund, "A smaller sleeping bag for a baby snake," Discrete & Computational Geometry, vol. 26, no. 1, s. 173-181, 2001.
[41]
K. Eriksson och S. Linusson, "A combinatorial theory of higher-dimensional permutation arrays," Advances in Applied Mathematics, vol. 25, no. 2, s. 194-211, 2000.
[42]
K. Eriksson och S. Linusson, "A decomposition of Fl(n)(d) indexed by permutation arrays," Advances in Applied Mathematics, vol. 25, no. 2, s. 212-227, 2000.
[43]
O. Guibert och S. Linusson, "Doubly alternating Baxter permutations are Catalan," Discrete Mathematics, vol. 217, no. 03-jan, s. 157-166, 2000.
[44]
S. Linusson et al., "Complexes of not i-connected graphs," Topology, vol. 38, no. 2, s. 271-299, 1999.
Konferensbidrag
[45]
S. Linusson, S. Potka och R. Sulzgruber, "On random shifted standard Young tableaux and 132-avoiding sorting networks," i FPSAC 2019 - 31st International Conference on Formal Power Series and Algebraic Combinatorics, 2019.
[46]
S. Linusson och S. Potka, "Properties of the edelman-greene bijection (extended abstract)," i FPSAC 2018 - 30th international conference on Formal Power Series and Algebraic Combinatorics, 2018.
[47]
A. Ayyer et al., "Some generalized juggling processes (extended abstract)," i DMTCS proc. FPSAC'15, 2015, s. 925-936.
[48]
A. Claesson och S. Linusson, "N! matchings, n! posets (extended abstract)," i FPSAC'10 - 22nd International Conference on Formal Power Series and Algebraic Combinatorics, 2010, s. 637-648.
[49]
A. Hultman et al., "From Bruhat intervals to intersection lattices and a conjecture of Postnikov," i FPSAC - Int. Conf. Form. Power Ser. Algebraic Comb., 2008, s. 203-214.
Icke refereegranskade
Kapitel i böcker
[50]
S. Linusson, "Uddaltasmetoden och röstningsprocesser," i Matematik och människor : läsebok för nyfikna, Ola Helenius & Karin Wallby red., Göteborg : Göteborgs universitet, 2008.
Rapporter
[51]
S. Janson och S. Linusson, "Proportionella val inom kommunfullmäktige," Uppsala University, Analysis and Probability Theory, 2019.
Övriga
[52]
[53]
E. Aas et al., "Limiting directions for random walks in classical affine Weyl groups," (Manuskript).
[54]
[55]
S. Linusson, S. Potka och R. Sulzgruber, "On random shifted standard Young tableaux and 132-avoiding sorting networks," (Manuskript).
[56]
S. Linusson, S. Potka och R. Sulzgruber, "On random shifted standard Young tableaux and 132-avoiding sorting networks," (Manuskript).
[57]
S. Linusson, P. Restadh och L. Solus, "On the Edges of Characteristic Imset Polytopes," (Manuskript).
[58]
[59]
Senaste synkning med DiVA:
2024-04-22 00:19:01