collaborators

5 papers

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.CO2026

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.NT2025

Dyadically resolving trinomials for fast modular arithmetic

Robert Dougherty-Bliss, Mits Kobayashi, Natalya Ter-Saakov +1

Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured…

math.CO2025

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…