Related papers: Extension dimensional approximation theorem

Simple drawings of graphs are those in which each pair of edges share at most one point, either a common endpoint or a proper crossing. In this paper we study the problem of extending a simple drawing $D(G)$ of a graph $G$ by inserting a…

We give upper bounds for the number $\Phi_\ell(G)$ of matchings of size $\ell$ in (i) bipartite graphs $G=(X\cup Y, E)$ with specified degrees $d_x$ ($x\in X$), and (ii) general graphs $G=(V,E)$ with all degrees specified. In particular,…

Employing Morse theory for the global control of monodromy and the method of analytic discs for local extension, we establish a version of the global Hartogs extension theorem in a singular setting: for every domain D of an (n-1)-complete…

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 $X$ and $Y$ be Banach spaces, let $\mathcal{A}(X)$ stands for the algebra of approximable operators on $X$, and let $P\colon\mathcal{A}(X)\to Y$ be an orthogonally additive, continuous $n$-homogeneous polynomial. If $X^*$ has the…

Recently Paw\l{}ucki showed that compact sets that are definable in some o-minimal structure admit triangulations of class $\mathcal{C}^p$ for each integer $p\geq 1$. In this work, we make use of these new techniques of triangulation to…

Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…

Let $G_n$ be a random geometric graph with vertex set $[n]$ based on $n$ i.i.d.\ random vectors $X_1,\ldots,X_n$ drawn from an unknown density $f$ on $\R^d$. An edge $(i,j)$ is present when $\|X_i -X_j\| \le r_n$, for a given threshold…

Let $E$ be an arbitrary subset of $\mathbb{R}^n$ (not necessarily bounded), and $f:E\to\mathbb{R}$, $G:E\to\mathbb{R}^n$ be functions. We provide necessary and sufficient conditions for the $1$-jet $(f,G)$ to have an extension $(F, \nabla…

The notion of the ultrametrics can be considered as a zero-dimensional analogue of ordinary metrics, and it is expected to prove ultrametric versions of theorems on metric spaces. In this paper, we provide ultrametric versions of the…

We present an approach to cohomological dimension theory based on infinite symmetric products and on the general theory of dimension called the extension dimension. The notion of the extension dimension $\ExD(X)$ was introduced by…

It is proved that the germ of a holomorphic map from a real analytic hypersurface M in C^n into a strictly pseudoconvex compact real algebraic hypersurface M' in C^N, 1 < n < N extends holomorphically along any path on M.

This paper aims to study the dual of an extended locally convex space. In particular, we study the weak and weak* topologies as well as the topology of uniform convergence on bounded subsets of an extended locally convex space. As an…

A relatively polynomially convex subset $V$ of a domain $\Omega$ has the extension property if for every polynomial $p$ there is a bounded holomorphic function $\phi$ on $\Omega$ that agrees with $p$ on $V$ and whose $H^\infty$ norm on…

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…

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…

For a $k$-uniform hypergraph $F$ let $\textrm{ex}(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $\textrm{ex}(n,F)$ is a classical and central problem…

Leveraging the infinite dimensional neural network architecture we proposed in arXiv:2109.13512v4 and which can process inputs from Fr\'echet spaces, and using the universal approximation property shown therein, we now largely extend the…

An orthogonal representation of a graph is an assignment of nonzero real vectors to its vertices such that distinct non-adjacent vertices are assigned to orthogonal vectors. We prove general lower bounds on the dimension of orthogonal…

The Weisfeiler-Leman (WL) algorithms form a family of incomplete approaches to the graph isomorphism problem. They recently found various applications in algorithmic group theory and machine learning. In fact, the algorithms form a…