Related papers: Differentiable approximation of continuous semialg…

In Mergelyan type approximation we uniformly approximate functions on compact sets K by polynomials or rational functions or holomorphic functions on varying open sets containing K. In the present paper we consider analogous approximation,…

Let G/H be a pseudo-Riemannian semisimple symmetric space. The tangent bundle T(G/H) contains a maximal G-invariant neighbourhood of the zero section where the adapted complex structure exists. Such neighbourhood is endowed with a canonical…

In this work we compare the semialgebraic subsets that are images of regulous maps with those that are images of regular maps. Recall that a map f : R n $\rightarrow$ R m is regulous if it is a rational map that admits a continuous…

The purpose of this paper is to present, for all $n\ge 3$, very simple examples of continuous maps $f:M^{n-1} \to M^{n}$ from closed $(n-1)$-manifolds $M^{n-1}$ into closed $n$-manifold $M^n$ such that even though the singular set $S(f)$ of…

Using methods from the theory of uniform algebras, we give a simple proof of an approximation result of Sahutoglu and Tikaradze with $L^\infty$-pseudoconvex domains replaced by the open sets for which Gleason's problem is solvable.

This paper deals with the existence of algebraic structures on compact Nash sets. We introduce the algebraic-topological notion of asymmetric Nash cobordism between compact Nash sets, and we prove that a compact Nash set is…

Let X be a complex nonsingular affine algebraic variety, K a holomorphically convex subset of X, and Y a homogeneous variety for some complex linear algebraic group. We prove that a holomorphic map f:K-->Y can be uniformly approximated on K…

We prove that every continuous mapping from a separable infinite-dimensional Hilbert space $X$ into $\mathbb{R}^{m}$ can be uniformly approximated by $C^\infty$ smooth mappings {\em with no critical points}. This kind of result can be…

Let $X$ be a compact metric space which is locally absolutely retract and let $\phi: C(X)\to C(Y, M_n)$ be a unital homomorphism, where $Y$ is a compact metric space with ${\rm dim}Y\le 2.$ It is proved that there exists a sequence of $n$…

Constructing a similarity graph from a set $X$ of data points in $\mathbb{R}^d$ is the first step of many modern clustering algorithms. However, typical constructions of a similarity graph have high time complexity, and a quadratic space…

Given a closed semi-algebraic set $X \subset \mathbb{R}^n$ and a continuous semi-algebraic mapping $G \colon X \to \mathbb{R}^m,$ it will be shown that there exists an open dense semi-algebraic subset $\mathscr{U}$ of $L(\mathbb{R}^n,…

For a well-studied family of domination-type problems, in bounded-treewidth graphs, we investigate whether it is possible to find faster algorithms. For sets $\sigma,\rho$ of non-negative integers, a $(\sigma,\rho)$-set of a graph $G$ is a…

This paper addresses the approximation of fractional harmonic maps. Besides a unit-length constraint, one has to tackle the difficulty of nonlocality. We establish weak compactness results for critical points of the fractional Dirichlet…

This paper introduces the Simultaneous assignment problem. Let us given a graph with a weight and a capacity function on its edges, and a set of its subgraphs along with a degree upper bound function for each of them. We are also given a…

In the maximum coverage problem, we are given subsets $T_1, \ldots, T_m$ of a universe $[n]$ along with an integer $k$ and the objective is to find a subset $S \subseteq [m]$ of size $k$ that maximizes $C(S) := \Big|\bigcup_{i \in S}…

In this letter we proved this theorem: \emph{if $F$ be a holomorphic mapping of $T_{\Omega}$ to a mapping manifold $X$ such that for every compact subset $K\subset \Omega$ the mapping $F$ is uniformly continues on $T_{K}$ and $F(T_{K})$ is…

We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…

The aim of this paper is to investigate the links between ${\cal T}_C$-class algorithms, CQ Algorithm and shrinking projection methods. We show that strong convergence of these algorithms are related to coherent ${\cal T}_C$-class sequences…

Semi-supervised semantic segmentation aims to utilize limited labeled images and abundant unlabeled images to achieve label-efficient learning, wherein the weak-to-strong consistency regularization framework, popularized by FixMatch, is…

We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…