3 papers
math.LO2026
Ordinals and recursively defined functions on the reals
Gabriel Nivasch, Lior Shiboli
We determine sufficient conditions under which certain recursively defined functions are well defined for all real inputs. Given a function , call a decrea…
cs.CG2026
On the complexity of the free space of a translating box in R^3
Gabriel Nivasch
Consider a convex polyhedral robot that can translate (without rotating) amidst a finite set of non-moving polyhedral obstacles in . The "free space" …
math.CO2025
A convergence technique for the game i-Mark
Gabriel Nivasch, Oz Rubinstein
The game of i-Mark is an impartial combinatorial game introduced by Sopena (2016). The game is parametrized by two sets of positive integers , , where . From pos…