R. Dorward

activity

20152026

most citedA Generalization of Zeckendorf's Theorem via Circumscribed

m

-gons

9 citations · 14 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2026

On the number of symmetric chain decompositions of the minuscule lattices $L (m, n)$ and $M (n)$

Robert Dorward

We study the problem of enumerating symmetric chain decompositions (SCDs) of the minuscule lattices $L (m, n)$ of partitions in an $m$ by $n$ box and $M (n)$ of partitions into distin…

math.CO2020

Combinatorial statistics on restricted growth functions containing a pattern exactly $k$ times

Robert Dorward

In this undergraduate thesis, we expand on the study of statistics on restricted growth functions avoiding patterns initiated by Campbell, et. al. Restricted growth functions are o…

math.CO2016

Restricted growth function patterns and statistics

Lindsey R. Campbell, Samantha Dahlberg, Robert Dorward +4

A restricted growth function (RGF) of length n is a sequence w = w_1 w_2 ... w_n of positive integers such that w_1 = 1 and w_i is at most 1 + max{w_1,..., w_{i-1}} for i at least…

math.CO2015★ 1 cited

Set partition patterns and statistics

Samantha Dahlberg, Robert Dorward, Jonathan Gerhard +4

A set partition $σ$ of $[n] = {1, \dots, n}$ contains another set partition $π$ if restricting $σ$ to some $S \subseteq [n]$ and then standardizing the result gives $π$ . Otherwise we s…

On the number of symmetric chain decompositions of the minuscule lattices L(m,n) and M(n)

Combinatorial statistics on restricted growth functions containing a pattern exactly k times

Restricted growth function patterns and statistics

Set partition patterns and statistics

On the number of symmetric chain decompositions of the minuscule lattices $L (m, n)$ and $M (n)$

Combinatorial statistics on restricted growth functions containing a pattern exactly $k$ times