2 papers
math.CO2016
Polynomials and Second Order Linear Recurrences
Soumyabrata Pal, Shankar M. Venkatesan
One of the most interesting results of the last century was the proof completed by Matijasevich that computably enumerable sets are precisely the diophantine sets [MRDP Theorem, 9]…
math.CO2016
Tight lower bounds for connected queen domination problems on the chessboard
Sneha S. Venkatesan, S. M. Venkatesan
1. We first show a lower bound of 2N/3-1 for the connected minimum queen domination (or cover) problem on the NXN chessboard - the upper bound is only 2 higher at most and is easy…