1 citations · 1 across the 15 of their papers we have counts for
3 papers · 1 filter
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…
The Comma Sequence is Finite in Other Bases
Robert Dougherty-Bliss, Natalya Ter-Saakov
The comma sequence (1, 12, 35, 94, ...) is the lexicographically earliest sequence such that the difference of consecutive terms equals the concatenation of the digits on either si…
Creating Decidable Diophantine Equations
Robert Dougherty-Bliss, Charles Kenney, Doron Zeilberger
Generalizing an argument of Matiyasevich, we illustrate a method to generate infinitely many diophantine equations whose solutions can be completely described by linear recurrences…