arXiv Analytics

Sign in

arXiv:1805.04834 [math.CO]AbstractReferencesReviewsResources

Approximations of Mappings

Jaroslav Nesetril, Patrice Ossona de Mendez

Published 2018-05-13Version 1

We consider mappings, which are structure consisting of a single function (and possibly some number of unary relations) and address the problem of approximating a continuous mapping by a finite mapping. This problem is the inverse problem of the construction of a continuous limit for first-order convergent sequences of finite mappings. We solve the approximation problem and, consequently, the full characterization of limit objects for mappings for first-order (i.e. ${\rm FO}$) convergence and local (i.e. ${\rm FO}^{\rm local}$) convergence. This work can be seen both as a first step in the resolution of inverse problems (like Aldous-Lyons conjecture) and a strengthening of the classical decidability result for finite satisfiability in Rabin class (which consists of first-order logic with equality, one unary function, and an arbitrary number of monadic predicates). The proof involves model theory and analytic techniques.

Related articles: Most relevant | Search more
arXiv:2004.01529 [math.CO] (Published 2020-04-03)
On an inverse problem of the Erdős-Ko-Rado type theorems
arXiv:2305.10074 [math.CO] (Published 2023-05-17)
Inverse problem for electrical networks via twist
arXiv:1207.3446 [math.CO] (Published 2012-07-14, updated 2013-02-08)
Moments of Askey-Wilson polynomials