相关论文: Extension dimensional approximation theorem

We deduce an extension theorem for the so-called Sobolev-Grand Lebesgue Spaces defined on the suitable subsets of the whole finite-dimensional Euclidean space, and estimate the norms of correspondent extension operator, which may be choosed…

We describe the supports of a class of real-valued maps on $C*(X)$ introduced by Radul. Using this description, a characterization of compact-valued retracts of a given space in terms of functional extenders is obtained. For example, if…

Let (G,w) be a weighted graph. The necessary and sufficient conditions under which a weight w : E(G)-->R^+ can be extended to a pseudoultrametric on V(G) are found. A criterion of the uniqueness of this extension is also obtained. It is…

We show that the space of continuous functions over a compact space X admits an equivalent pointwise-lowersemicontinuous locally uniformly rotund norm whenever X admits a fully closed map onto a compact Y such that C(Y) and the spaces of…

In this paper, with the aid of the simplicial approximation property, the Hopf's construction and Dugundji's homotopy extension Theorem, we first show that if C is a nonempty compact convex subset of an F-space (E; || ||); then for every…

We introduce the problem Partial VC Dimension that asks, given a hypergraph $H=(X,E)$ and integers $k$ and $\ell$, whether one can select a set $C\subseteq X$ of $k$ vertices of $H$ such that the set $\{e\cap C, e\in E\}$ of distinct…

A graph $G$ is said to be $k$-extendable if every matching of size $k$ in $G$ can be extended to a perfect matching of $G$, where $k$ is a positive integer. We say $G$ is $1$-excludable if for every edge $e$ of $G$, there exists a perfect…

Let $G$ be a planar embedding with list-assignment $L$ and outer cycle $C$, and let $P$ be a path of length at most four on $C$, where each vertex of $G\setminus C$ has a list of size at least five and each vertex of $C\setminus P$ has a…

Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…

For strongly connected, pure $n$-dimensional regular CW-complexes, we show that {\it evenness} (each $(n{-}1)$-cell is contained in an even number of $n$-cells) is equivalent to generalizations of both cycle decomposition and…

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.

Given a regular (connected) graph $\Gamma=(X,E)$ with adjacency matrix $A$, $d+1$ distinct eigenvalues, and diameter $D$, we give a characterization of when its distance matrix $A_D$ is a polynomial in $A$, in terms of the adjacency…

Let $D_j\subset\Bbb C^{k_j}$ be a pseudoconvex domain and let $A_j\subset D_j$ be a locally pluripolar set, $j=1,...,N$. Put$$X:=\bigcup_{j=1}^N A_1\times...\times A_{j-1}\times D_j\times A_{j+1}\times...\times A_N\subset\Bbb…

We study the closure of the unitary orbit of a given point in the non-commutative Choquet boundary of a unital operator space with respect to the topology of pointwise norm convergence. This may be described more extensively as the…

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s…

A graph is called $k$-extendable if each $k$-matching can be extended to a perfect matching. We give spectral conditions for the $k$-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations.…

This paper extends the proof of density of neural networks in the space of continuous (or even measurable) functions on Euclidean spaces to functions on compact sets of probability measures. By doing so the work parallels a more then a…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

We investigate the following property for Banach spaces. A Banach space $X$ satisfies the Uniform Approximation on Large Subspaces (UALS) if there exists $C>0$ with the following property: for any $A\in\mathcal{L}(X)$ and convex compact…

Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…