Related papers: Preservation of the Borel class under open-$LC$ fu…

Let $G$ be a Polish group and let $H \leq G$ be a compact subgroup. We prove that there exists a Borel set $T \subset G$ which is simultaneously a complete set of coset representatives of left and right cosets, provided that a certain index…

We study sublevel set and superlevel set persistent homology on discrete functions through the perspective of finite ordered sets of both linearly ordered and cyclically ordered domains. Finite ordered sets also serve as the codomain of our…

By definition, the intersection of finitely many open sets of any topological space is open. Nachbin observed that, more generally, the intersection of compactly many open sets is open. Moreover, Nachbin applied this to obtain elegant…

A function $f:X\to \mathbb R$ defined on a topological space $X$ is called returning if for any point $x\in X$ there exists a positive real number $M_x$ such that for every path-connected subset $C_x\subset X$ containing the point $x$ and…

The class of $\mu$-compact sets can be considered as a natural extension of the class of compact metrizable subsets of locally convex spaces, to which the particular results well known for compact sets can be generalized. This class…

Let $(C(t))\_{t \in R}$ be a cosine function in a unital Banach algebra. We show that if $sup\_{t\in R}\Vert C(t)-cos(t)\Vert \textless{} 2$ for some continuous scalar bounded cosine function $(c(t))\_{t\in \R},$ then the closed subalgebra…

We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…

We find all subsets of $\mathbb{N}$ which occur as the set of possible cardinalities of preimages of a continuous function. We also study and answer this question for various subclasses of continuous functions.

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results…

Many classically used function space structures (including the topology of pointwise convergence, the compact-open topology, the Isbell topology and the continuous convergence) are induced by a hyperspace structure counterpart. This scheme…

Let X be a countably infinite set of real numbers and let Y_x, x \in X, be an independent family of stationary random subsets of the real numbers, e.g. homogeneous Poisson point processes. We give criteria for the a.s. existence of various…

We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…

Let $X$ be a Hausdorff compact space and $C(X)$ be the algebra of all continuous complex-valued functions on $X$, endowed with the supremum norm. We say that $C(X)$ is (approximately) $n$-th root closed if any function from $C(X)$ is…

We introduce a new point of view towards Glaeser's theorem on composite $C^\infty$ functions [Ann. of Math. 1963], with respect to which we can formulate a ``$C^k$ composite function property" that is satisfied by all semiproper real…

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

The aim of this paper is to define and study $\mathcal{B}$-open sets and related properties. A $\mathcal{B}$-open set is, roughly speaking, a generalization of a $b$-open set, which is in turn a generalization of a pre-open set and a…

We study closed choice principles for different spaces. Given information about what does not constitute a solution, closed choice determines a solution. We show that with closed choice one can characterize several models of…

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

In this paper we study nonlinear interpolation problems for interpolation and peak-interpolation sets of function algebras. The subject goes back to the classical Rudin-Carleson interpolation theorem. In particular, we prove the following…

This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…