Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Lacina, Stephen"'
Autor:
Lacina, Stephen
This paper introduces a partial order on the maximal chains of any finite bounded poset $P$ which has a CL-labeling $\lambda$. We call this the maximal chain descent order induced by $\lambda$, denoted $P_{\lambda}(2)$. As a first example, letting $P
Externí odkaz:
http://arxiv.org/abs/2209.15142
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 networks, we provide new and improved results on the matter using the theor
Externí odkaz:
http://arxiv.org/abs/2201.11545
Autor:
Lacina, Stephen
Ceballos and Pons generalized weak order on permutations to a partial order on certain labeled trees, thereby introducing a new class of lattices called $s$-weak order. They also generalized the Tamari lattice by defining a particular sublattice of $
Externí odkaz:
http://arxiv.org/abs/2009.02389
Publikováno v:
In Discrete Mathematics September 2023 346(9)
Autor:
Cartern, Nikki, Dygert, Brittany, Junge, Matthew, Lacina, Stephen, Litterell, Collin, Stromme, Austin, You, Andrew
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 rumor spreading model. We given an alternate and elementary proof that the
Externí odkaz:
http://arxiv.org/abs/1510.05995