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 math.COShow all

8 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 of separable derangements of . 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 ways to tile a rectangle with rectangular tiles (of any length, of course they all must have width ), 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 , the number of subsets of the sum of whose elements is divisible by equals the number of binary necklaces of length .…

math.CO2025

Cutting 4 by grids into two congruent pieces

Robert Dougherty-Bliss, Natalya Ter-Saakov, Doron Zeilberger

In the March 2025 issue of Pour la Science, Jean-Paul Delahaye described a wonderful solution to the following problem: How many ways can you divide a 3 by 2n rectangle into two co…

math.CO2024

The (Symbolic and Numeric) Computational Challenges of Counting 0-1 Balanced Matrices

Robert Dougherty-Bliss, Christoph Koutschan, Natalya Ter-Saakov +1

A chessboard has the property that every row and every column has as many white squares as black squares. In this mostly methodological note, we address the problem of counting suc…

math.CO2023

Hardinian Arrays

Robert Dougherty-Bliss, Manuel Kauers

In 2014, R.H. Hardin contributed a family of sequences about king-moves on an array to the On-Line Encyclopedia of Integer Sequences (OEIS). The sequences were recently noticed in…

math.CO2022

The Meta-C-finite Ansatz

Robert Dougherty-Bliss

The Fibonacci numbers satisfy the famous recurrence . The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible b…

math.CO2020★ 1 cited

Enumerating Restricted Dyck Paths with Context-Free Grammars

AJ Bu, Robert Dougherty-Bliss

The number of Dyck paths of semilength is famously , the th Catalan number. This fact follows after noticing that every Dyck path can be uniquely parsed according to a…