Related papers: Approximations of Mappings
We study the problem of supervised learning a metric space under discriminative constraints. Given a universe $X$ and sets ${\cal S}, {\cal D}\subset {X \choose 2}$ of similar and dissimilar pairs, we seek to find a mapping $f:X\to Y$, into…
We present a unification problem based on first-order syntactic unification which ask whether every problem in a schematically-defined sequence of unification problems is unifiable, so called loop unification. Alternatively, our problem may…
We study a local behavior of one class of mappings, which are defined in a domain of $n$-measured Euclidean space, in a case, when corresponding images of this domain are variable. Under some conditions on a function defining a behavior of…
It is known that locally compact groups approximable by finite ones are unimodular, but this condition is not sufficient, for example, the simple Lie groups are not approximable by finite ones as topological groups. In this paper the…
We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…
By suitable examples we illustrate an algorithm for composition of inverse problems.
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
We investigate the continuous non-monotone DR-submodular maximization problem subject to a down-closed convex solvable constraint. Our first contribution is to construct an example to demonstrate that (first-order) stationary points can…
Let $X$ be a compact real algebraic set of dimension $n$. We prove that every Euclidean continuous map from $X$ into the unit $n$-sphere can be approximated by regulous map. This strengthens and generalizes previously known results.
We focus on nonconvex and nonsmooth minimization problems with a composite objective, where the differentiable part of the objective is freed from the usual and restrictive global Lipschitz gradient continuity assumption. This longstanding…
We show that a given set of first class constraints becomes abelian if one maps each constraint to the surface of other constraints. There is no assumption that first class constraints satisfy a closed algebra. The explicit form of the…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
We present a general framework to study uniqueness, stability and reconstruction for infinite-dimensional inverse problems when only a finite-dimensional approximation of the measurements is available. For a large class of inverse problems…
We consider a class of inverse problems defined by a nonlinear map from parameter or model functions to the data. We assume that solutions exist. The space of model functions is a Banach space which is smooth and uniformly convex; however,…
In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…
For a class of expanding maps with neutral singularities we prove the validity of a finite rank approximation scheme for the analysis of Sinai-Ruelle-Bowen measures. Earlier results of this sort were known only in the case of hyperbolic…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…