Related papers: Realising sets of integers as mapping degree sets

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

This work focuses on the degree bound of maps between balls with maximum geometric rank and minimum target dimension where this geometric rank occurs. Specifically, we show that rational proper maps between $\mathbb{B}_n$ and $\mathbb{B}_N$…

In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…

Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…

Based on the numerical manifold method principle, we developed a mathematical framework of a neural network manifold: Deep Manifold and discovered that neural networks: 1) is numerical computation combining forward and inverse; 2) have near…

Given a real analytic set X in a complex manifold and a positive integer d, denote by A(d) the set of points p in X at which there exists a germ of a complex analytic set of dimension d contained in X. It is proved that A(d) is a closed…

We study the rate of growth of $p(n,S,M)$, the number of partitions of $n$ whose parts all belong to $S$ and whose multiplicities all belong to $M$, where $S$ (resp. $M$) are given infinite sets of positive (resp. nonnegative) integers. We…

An end sum is a non-compact analogue of a connected sum. Suppose we are given two connected, oriented $n$-manifolds $M_1$ and $M_2$. Recall that to form their connected sum one chooses an $n$-ball in each $M_i$, removes its interior, and…

The Degree Realization problem requires, given a sequence $d$ of $n$ positive integers, to decide whether there exists a graph whose degrees correspond to $d$, and to construct such a graph if it exists. A more challenging variant of the…

We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in $[0,1]$,…

Let $N_{g,n}$ be a genus $g$ compact non-orientable surface with $n$ boundaries. We explain about relations on the level $d$ mapping class group $\mathcal{M}_d(N_{g,0})$ of $N_{g,0}$ and the level $d$ principal congruence subgroup…

A metric space $\mathrm{M}=(M,\de)$ is {\em indivisible} if for every colouring $\chi: M\to 2$ there exists $i\in 2$ and a copy $\mathrm{N}=(N, \de)$ of $\mathrm{M}$ in $\mathrm{M}$ so that $\chi(x)=i$ for all $x\in N$. The metric space…

Given a pointed metric space $M$, we study when there exist $n$-dimensional linear subspaces of $\operatorname{Lip}_0(M)$ consisting of strongly norm-attaining Lipschitz functionals, for $n\in\mathbb{N}$. We show that this is always the…

For all positive even integers $n$, graphs of order $n$ with degree sequence \begin{equation*} S_{n}:1,2,\dots,n/2,n/2,n/2+1,n/2+2,\dots,n-1 \end{equation*} naturally arose in the study of a labeling problem in \cite{IMO}. This fact…

Let $\mathbb{N}$ be the set of all nonnegative integers. For any integer $r$ and $m$, let $r+m\mathbb{N}=\{r+mk: k\in\mathbb{N}\}$. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_{S}(n)$ denote the number of solutions of the…

We introduce the metric fundamental class for metric spaces that are homeomorphic to compact, non-orientable, smooth manifolds with (possibly empty) boundary. This is an integer rectifiable current that provides an analytic representation…

We consider the following feasibility problem: given an integer $n \geq 1$ and an integer $m$ such that $0 \leq m \leq \binom{n}{2}$, does there exist a line graph $L = L(G)$ with exactly $n$ vertices and $m$ edges ? We say that a pair…

For a positive integer \( k \), let \( [k] = \{1, 2, \ldots, k\} \). Let \( h \) be a non-negative integer, and let \( n \) be a multiple of \( h + 1 \). Define \( H \) as the disjoint union of \( n/(h+1) \) cliques (each of size \( h + 1…

Let $\widetilde{I}_{2n,k}$ denote the space of $k$-dimensional, oriented isotropic subspaces of $\mathbb{R}^{2n}$, called the oriented isotropic Grassmannian. Let $f \colon \widetilde{I}_{2n,k} \rightarrow \widetilde{I}_{2m,l} $ be a map…

We construct an increasing $\omega$-sequence $(a_n)$ of Turing degrees which forms an initial segment of the Turing degrees, and such that each~$a_{n+1}$ is diagonally noncomputable relative to $a_n$. It follows that the~$\mathsf{DNR}$…