2 citations · 2 across the 5 of their papers we have counts for
5 papers
Equivalences and Distinctions in Lexicographic Shellability of Posets
Stephen Lacina, Grace Stadnyk
We present two perhaps surprisingly small posets, one graded and one non-graded, that are CC-shellable in the sense of Kozlov and TCL-shellable in the sense of Hersh, but not CL-sh…
Maximal chain descent orders
Stephen Lacina
This paper introduces a partial order on the maximal chains of any finite bounded poset which has a CL-labeling . We call this the maximal chain descent order induced by …
Tiling of rectangles with squares via Diophantine approximation
Tamás Keleti, Stephen Lacina, Changshuo Liu +2
This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor netwo…
Poset topology of -weak order via SB-labelings
Stephen Lacina
Ceballos and Pons generalized weak order on permutations to a partial order on certain labeled trees, thereby introducing a new class of lattices called -weak order. They also g…
Frog model wakeup time on the complete graph
Nikki Cartern, Brittany Dygert, Matthew Junge +4
The frog model is a system of random walks where active particles set sleeping particles in motion. On the complete graph with n vertices it is equivalent to a well-understood rumo…