3 papers
cs.LO2020
On amenability of constraint satisfaction problems
Michał R. Przybyłek
Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution…
cs.LO2020
Beyond sets with atoms: definability in first order logic
Michał R. Przybyłek
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to…
math.NA2019
A note on the complexity of a phaseless polynomial interpolation
Michal R. Przybylek, Pawel Siedlecki
In this paper we revisit the classical problem of polynomial interpolation, with a slight twist; namely, polynomial evaluations are available up to a group action of the unit circl…