32 citations · 141 across the 41 of their papers we have counts for
44 papers
Pattern avoidance in alternating sign rectangles I: Extended avoidance
Hans Höngesberg, Matjaž Konvalinka, Svante Linusson
We introduce extendable pattern avoidance for alternating sign rectangles (ASRs), the natural rectangular generalization of alternating sign matrices (ASMs). An ASR extendably avoi…
Inversion monotonicity in subclasses of the 1324-avoiders
Anders Claesson, Svante Linusson, Henning Ulfarsson +1
A collection of patterns is called inversion monotone if , the number of -avoiding permutations of length with inversions, is weakly increasing i…
The -Plancherel measure and a Finite Markov Chain
Svante Linusson, Alperen Özdemir
Let denote the set of partitions of whose largest part is bounded by which are in well-known bijection with -cores . We study a gr…
The bunkbed problem and the random cluster model
Arvind Ayyer, Svante Linusson, Mohan Ravichandran
The well known bunkbed conjecture about percolation on finite graphs is now resolved; Gladkov, Pak and Zimin, building upon work of Hollom, have constructed a counterexample. We re…
Set-Valued Catalan Combinatorics
Alexander Lazar, Svante Linusson
Set-valued standard Young tableaux are a generalization of standard Young tableaux due to Buch (2002) with applications in algebraic geometry. The enumeration of set-valued SYT is…
Enumerating 1324-avoiders with few inversions
Svante Linusson, Emil Verkama
We enumerate the numbers of 1324-avoiding -permutations with exactly inversions for all and . The result depends on a structural character…