4 papers · 1 filter
Exactly-solvable self-trapping lattice walks. II. Lattices of arbitrary height
Jay Pantone, Alexander R. Klotz, Everett Sullivan
A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function en…
Colored Multipermutations and a Combinatorial Generalization of Worpitzky's Identity
John Engbers, Jay Pantone, Christopher Stocker
Worpitzky's identity expresses in terms of the Eulerian numbers and binomial coefficients: Pita-Ruiz recent…
Counting pop-stacked permutations in polynomial time
Anders Claesson, Bjarki Ágúst Guðmundsson, Jay Pantone
Permutations in the image of the pop-stack operator are said to be pop-stacked. We give a polynomial-time algorithm to count pop-stacked permutations up to a fixed length and we us…
Universal layered permutations
Michael Albert, Michael Engen, Jay Pantone +1
We establish an exact formula for the length of the shortest permutation containing all layered permutations of length , proving a conjecture of Gray.