相关论文: On finite-to-one maps

For a given graph $H$, we say that a graph $G$ has a perfect $H$-subdivision tiling if $G$ contains a collection of vertex-disjoint subdivisions of $H$ covering all vertices of $G.$ Let $\delta_{\mathrm{sub}}(n, H)$ be the smallest integer…

In this paper we prove that the set of metrics conformal to the standard metric on $\mathbb{S}^{n}\backslash\{p_{1},\cdots,p_{l}\}$ is locally compact in $C^{m,\alpha}$ topology for any $m>0$, whenever the metrics have constant $\sigma_{k}$…

The \emph{Filter Dichotomy} says that every uniform nonmeager filter on the integers is mapped by a finite-to-one function to an ultrafilter. The consistency of this principle was proved by Blass and Laflamme. A function between topological…

In this manuscript a recent topology on the positive integers generated by the collection of $\{\sigma_n:n\in\mathbb{N}\}$ where $\sigma_n:=\{m: \gcd(n,m)=1\}$ is generalized over integral domains. Some of its topological properties are…

We shall prove the following Stinespring-type theorem: there exists a triple $(\pi,\mathcal{H},\mathbf{V})$ associated with an unital completely positive map $\Phi:\mathfrak{A}\rightarrow \mathfrak{A}$ on C* algebra $\mathfrak{A}$ with…

Given a connected graph $G$ on $n$ vertices and a positive integer $k\le n$, a subgraph of $G$ on $k$ vertices is called a $k$-subgraph in $G$. We design combinatorial approximation algorithms for finding a connected $k$-subgraph in $G$…

For any two integers $k,n$, $2\leq k\leq n$, let $f:(\mathbb{C}^*)^n\rightarrow\mathbb{C}^k$ be a generic polynomial map with given Newton polytopes. It is known that points, whose fiber under $f$ has codimension one, form a finite set…

A classic result of Brooks, Smith, Stone and Tutte associates to any finite planar network with distinguished source and sink vertices, a tiling of a rectangle by smaller subrectangles whose aspect ratios are given by the conductances of…

David Gabai showed that disk decomposable knot and link complements carry taut foliations of depth one. In an arbitrary sutured 3-manifold M, such foliations F, if they exist at all, are determined up to isotopy by an associated ray [F]…

Given a set $S$ of points in the plane, a geometric network for $S$ is a graph $G$ with vertex set $S$ and straight edges. We consider a broadcasting situation, where one point $r \in S$ is a designated source. Given a dilation factor…

In the following text we prove that for all finite $p\geq0$ there exists a topological graph $X$ such that $\{p,p+1,p+2,\ldots\}\cup\{+\infty\}$ is the collection of all possible heights for transformation groups with phase space $X$.…

Let $K_k$, $C_k$, $T_k$, and $P_{k}$ denote a complete graph on $k$ vertices, a cycle on $k$ vertices, a tree on $k+1$ vertices, and a path on $k+1$ vertices, respectively. Let $K_{m}-H$ be the graph obtained from $K_{m}$ by removing the…

Let $(M,F)$ be a $C^\infty$ Finsler manifold, $p\geq 1$ a real number, $k$ a positive integer and $H_k^p (M)$ a certain Sobolev space determined by a Finsler structure $F$. Here, it is shown that the set of all real $C^{\infty}$ functions…

Let $M$ be a von Neumann algebra with a faithful normal finite trace $t$, and $H^\infty$ be a finite, maximal, subdiagonal of $M$. Fundamental theorems on conjugate functions for weak* Dirichlet algebras are shown to be a bounded linear map…

Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. The feasible region $\Omega(\mathcal{F})$ of $\mathcal{F}$ is the set of points $(x,y)$ in the unit square such that there exists a sequence of $\mathcal{F}$-free $r$-uniform…

Given a fixed graph $H$, a real number $p\in(0,1)$, and an infinite Erd\H{o}s-R\'enyi graph $G\sim G(\infty,p)$, how many adjacency queries do we have to make to find a copy of $H$ inside $G$ with probability $1/2$? Determining this number…

We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…

Dumas, Foucaud, Perez, and Todinca [SIAM J. Disc. Math., 2024] proved that if the vertex set of a graph $G$ can be covered by $k$ shortest paths, then the pathwidth of $G$ is bounded by $\mathcal{O}(k \cdot 3^k)$. We prove a coarse variant…

Let M be a 3-manifold (possibly with boundary). We show that, for any positive integer g, there exists an open nonempty set of metrics on M for each of which there are stable compact embedded minimal surfaces of genus g with arbitrarily…

Let $K$ be an uncountable compact metric space and let $C(K,\mathbb{R}^d)$ denote the set of continuous maps $f\colon K \to \mathbb{R}^d$ endowed with the maximum norm. The goal of this paper is to determine various fractal dimensions of…