R. Dougherty-Bliss

activity

20202026

most citedEnumerating Restricted Dyck Paths with Context-Free Grammars

1 citations · 1 across the 15 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

Enumerating separable derangements

Robert Dougherty-Bliss, Alejandro B. Galván, Michaela A. Polley +1

We give a polynomial-time algorithm to compute the number $b_{n}$ of separable derangements of $[n]$ . This algorithm is based on a generating function technique which tracks permutat…

math.CO2026

In How Many Ways can a Rectangle be Rectangled?

Pablo Blanco, Robert Dougherty-Bliss, Natalya Ter-Saakov +1

There are $2^{n - 1}$ ways to tile a $1 \times n$ rectangle with rectangular tiles (of any length, of course they all must have width $1$ ), but in how many ways can you tile a $100 \…

math.CO2026

Necklaces, subset sums, and cyclic permutations

Robert Dougherty-Bliss, Sergi Elizalde

It is a well known that, for odd $n$ , the number of subsets of ${1, 2, \dots, n}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$ .…