38 citations · 38 across the 7 of their papers we have counts for
8 papers
Properties of plactic monoid centralizers
Bruce E. Sagan, Chenchen Zhao
Let u be a word over the positive integers P. Motivated by a question involving crystal graphs, Sagan and Wilson initiated the study of the centralizer of u in the plactic monoid w…
Centralizers in the plactic monoid
Bruce E. Sagan, Alexander N. Wilson
Let u be a word over the positive integers. Motivated in part by a question from representation theory, we study the centralizer set of u which is C(u) = {w | uw is Knuth-equivalen…
Log-concavity and log-convexity via distributive lattices
Jinting Liang, Bruce E. Sagan
We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order…
Rooted partitions and number-theoretic functions
Bruce Sagan
Recently, Merca and Schmidt proved a number of identities relating partitions of an integer with two classic number-theoretic functions, namely the Möbius function and Euler's toti…
Rowmotion on rooted trees
Pranjal Dangwal, Jamie Kimble, Jinting Liang +3
A rooted tree T is a poset whose Hasse diagram is a graph-theoretic tree having a unique minimal element. We study rowmotion on antichains and lower order ideals of T. Recently Eli…
Partial rank symmetry of distributive lattices for fences
Sergi Elizalde, Bruce Sagan
Associated with any composition beta=(a,b,...) is a corresponding fence poset F(beta) whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2}…