26 citations · 49 across the 14 of their papers we have counts for
14 papers
Strictly increasing and decreasing sequences in subintervals of words and a conjecture of Guo and Poznanović
Jonathan S. Bloom, Dan Saracino
We prove a conjecture of Guo and Poznanović concerning chains in certain 01-fillings of moon polyominoes. A key ingredient of our proof is a correspondence between words and pa…
Rook and Wilf equivalence of integer partitions
Jonathan Bloom, Dan Saracino
The subjects of rook equivalence and Wilf equivalence have both attracted considerable attention over the last half-century. In this paper we introduce a new notion of Wilf equival…
On criteria for rook equivalence of Ferrers boards
Jonathan Bloom, Dan Saracino
In [2] we introduced a new notion of Wilf equivalence of integer partitions and proved that rook equivalence implies Wilf equivalence. In the present paper we prove the converse an…
Pattern avoidance for set partitions à la Klazar
Jonathan Bloom, Dan Saracino
In 2000 Klazar introduced a new notion of pattern avoidance in the context of set partitions of . The purpose of the present paper is to undertake a study of t…
The 2-color Rado number of
Dan Saracino
In 1982, Beutelspacher and Brestovansky determined the 2-color Rado number of the equation for all Here we extend their result by determi…
Proofs and generalizations of a homomesy conjecture of Propp and Roby
Jonathan Bloom, Oliver Pechenik, Dan Saracino
Let be a group acting on a set of combinatorial objects, with finite orbits, and consider a statistic . Propp and Roby defined the triple t…