Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCoupled embeddability
127
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We introduce the notion of coupled embeddability, defined for maps on products of topological spaces. We use known results for nonsingular biskew and bilinear maps to generate simple examples and nonexamples of coupled embeddings. We study genericity properties for coupled embeddings of smooth manifolds, extend the Whitney embedding theorems to statements about coupled embeddability, and we discuss a Haefliger-type result for coupled embeddings. We relate the notion of coupled embeddability to the $mathbb{Z}/2$-coindex of embedding spaces, recently introduced and studied by the authors. With a straightforward generalization of these results, we obtain strong obstructions to the existence of coupled embeddings in terms of the combinatorics of triangulations. In particular, we generalize nonembeddability results for certain simplicial complexes to sharp coupled nonembeddability results for certain pairs of simplicial complexes.
rate research
Read More
In 2019 P. Patak and M. Tancer obtained the following higher-dimensional generalization of the Heawood inequality on embeddings of graphs into surfaces. We expose this result in a short well-structured way accessible to non-specialists in the field. Let $Delta_n^k$ be the union of $k$-dimensional faces of the $n$-dimensional simplex. Theorem. (a) If $Delta_n^k$ PL embeds into the connected sum of $g$ copies of the Cartesian product $S^ktimes S^k$ of two $k$-dimensional spheres, then $ggedfrac{n-2k}{k+2}$. (b) If $Delta_n^k$ PL embeds into a closed $(k-1)$-connected PL $2k$-manifold $M$, then $(-1)^k(chi(M)-2)gedfrac{n-2k}{k+1}$.
We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions of bi-embeddable triviality and basis of a spectrum. Using bi-embeddable triviality we show that several known families of degrees are bi-embeddability spectra of structures. We then characterize the bi-embeddability spectra of linear orderings and study bases of bi-embeddability spectra of strongly locally finite graphs.
We show that compact Riemannian manifolds, regarded as metric spaces with their global geodesic distance, cannot contain a number of rigid structures such as (a) arbitrarily large regular simplices or (b) arbitrarily long sequences of points equidistant from pairs of points preceding them in the sequence. All of this provides evidence that Riemannian metric spaces admit what we term loose embeddings into finite-dimensional Euclidean spaces: continuous maps that preserve both equality as well as inequality. We also prove a local-to-global principle for Riemannian-metric-space loose embeddability: if every finite subspace thereof is loosely embeddable into a common $mathbb{R}^N$, then the metric space as a whole is loosely embeddable into $mathbb{R}^N$ in a weakened sense.
We show that the decision problem of determining whether a given (abstract simplicial) $k$-complex has a geometric embedding in $mathbb R^d$ is complete for the Existential Theory of the Reals for all $dgeq 3$ and $kin{d-1,d}$. This implies that the problem is polynomial time equivalent to determining whether a polynomial equation system has a real root. Moreover, this implies NP-hardness and constitutes the first hardness results for the algorithmic problem of geometric embedding (abstract simplicial) complexes.
In this paper, we introduce the concept of uniformly bounded fibred coarse embeddability of metric spaces, generalizing the notion of fibred coarse embeddability defined by X. Chen, Q. Wang and G. Yu. Moreover, we show its relationship with uniformly bounded a-T-menability of groups. Finally, we give some examples to illustrate the differences between uniformly bounded fibred coarse embeddability and fibred coarse embeddability.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
