Háskólinn í ReykjavíkReykjavik UniversityNadeau, ÉmileÚlfarsson, Henning Arnór2021-06-252021-06-252021-031462-72641365-8050 (eISSN)https://hdl.handle.net/20.500.11815/2629Publisher's version (útgefin grein)In this paper, we study the staircase encoding of permutations, which maps a permutation to a staircase grid with cellsfilled with permutations. We consider many cases, where restricted to a permutation class, the staircase encoding be-comes a bijection to its image. We describe the image of thoserestrictions using independent sets of graphs weightedwith permutations. We derive the generating function for the independent sets and then for their weighted coun-terparts. The bijections we establish provide the enumeration of permutation classes. We use our results to uncoversome unbalanced Wilf-equivalences of permutation classesand outline how to do random sampling in the permutationclasses. In particular, we cover the classes Av (2314,3124), Av (2413,3142), Av(2413,3124), Av(2413,2134) and Av (2314,2143), as well as many subclasses.C. Bean, E. Nadeau, and H. Ulfarsson, “Enumeration of Permutation Classes and Weighted Labelled Independent Sets,” Discret. Math. Theor. Comput. Sci., vol. 22, no. 2, p. 2, 2021eninfo:eu-repo/semantics/openAccessSoftware EngineeringPermutation PatternsIndependent setsWilf-equivalenceRandom samplingEnumerationHugbúnaðarverkfræðiSlembiúrtakStærðfræðiinfo:eu-repo/semantics/articleDIiscrete Mathematics and Theoretical Computer Science