Steven Rossi, Xiao Xiao
Published 2018-12-05Version 1
Solving a Radon-Kaczmarz puzzle involves filling a square grid with positive integers, each between one and nine, satisfying certain clues coming from the sum of entries that lie on the same line in the square grid. Given a set of slopes (of a particular order) that define clues of Radon-Kaczmarz puzzles, we give an upper bound of the size such that any solvable Radon-Kaczmarz puzzle whose size is less than or equal to that is uniquely solvable.
Trees and Matchings
An upper bound on the multiplicative energy
New upper bound for the cardinalities of $s$-distance sets on the unit sphere
![QR code for arXiv:1812.02219 [math.CO]](http://oss.arxitics.com/images/favicon.svg)