Embeddings of $k$-complexes into $2k$-manifolds
Pavel Pat\'ak, Martin Tancer

TL;DR
This paper introduces a new obstruction criterion for embedding $k$-complexes into $2k$-manifolds, improving bounds and providing algebraic conditions that could impact algorithmic embeddability decisions.
Contribution
It develops a novel intersection form-based obstruction for embeddability of $k$-complexes into $2k$-manifolds, extending classical results and offering a quadratic algebraic framework.
Findings
Derived an improved bound for K"uhnel's problem.
Established a new intersection form obstruction for embeddability.
Connected the obstruction to quadratic Diophantine equations.
Abstract
We improve the bound on K\"uhnel's problem to determine the smallest such that the -skeleton of an -simplex does not embed into a compact PL -manifold by showing that if embeds into , then . As a consequence we obtain improved Radon and Helly type results for set systems in such manifolds. Our main tool is a new description of an obstruction for embeddability of a -complex into a compact PL -manifold via the intersection form on . In our approach we need that for every map the restriction to the -skeleton of is nullhomotopic. In particular, this condition is satisfied in interesting cases if is -connected, for example a -skeleton of -simplex, or if is -connected. In addition, if is -connected and $k\geq…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology
Embeddings of -complexes into -manifolds.††thanks: This research is
supported by the GAČR grant 19-04113Y.
Pavel Paták
Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic
Czech Technical University in Prague, Faculty of Information Technology, Thákurova 2700/9, 160 00 Praha 6, Czech Republic
Martin Tancer
Department of Applied Mathematics, Charles University, Malostranské nám. 25, 118 00 Praha 1, Czech Republic
Abstract
We improve the bound on Kühnel’s problem to determine the smallest such that the -skeleton of an -simplex does not embed into a compact PL -manifold by showing that if embeds into , then . As a consequence we obtain improved Radon and Helly type results for set systems in such manifolds.
Our main tool is a new description of an obstruction for embeddability of a -complex into a compact PL -manifold via the intersection form on . In our approach we need that for every map the restriction to the -skeleton of is nullhomotopic. In particular, this condition is satisfied in interesting cases if is -connected, for example a -skeleton of -simplex, or if is -connected. In addition, if is -connected and , the obstruction is complete, meaning that a -complex embeds into if and only if the obstruction vanishes. For trivial intersection forms, our obstruction coincides with the standard van Kampen obstruction. However, if the form is non-trivial, the obstruction is not linear but rather ’quadratic’ in a sense that it vanishes if and only if certain system of quadratic diophantine equations is solvable. This may potentially be useful in attacking algorithmic decidability of embeddability of -complexes into PL -manifolds.
1 Introduction
Motivation.
This paper has three main goals:
Describe an obstruction for (almost)-embeddability of -dimensional simplicial complexes into compact -dimensional PL manifolds (Theorems 4 and 6). This extends the standard van Kampen obstruction for embeddability into . 2. 2)
Improve the bounds for so-called Kühnel problem: Provide an upper bound on such that the -skeleton of the -simplex embeds into compact -dimensional PL-manifold (Theorem 1). 3. 3)
Use the bounds from the previous item to obtain versions of Radon’s and Helly’s theorem on manifolds (Theorems 2 and 3).
Motivation for such research emerges from various directions:
The classical setting, related to the first goal, considers the case of embeddings of -complexes into (a -complex is always embeddable into , thus the target dimension is the first nontrivial dimension). This line of research was initiated by results of van Kampen and Flores [vK32, Flo34] on nonembeddability of the -skeleton of the -simplex, , and the -fold join of three isolated points into . This case is in general well understood: If , embeddability of in is characterized via vanishing of so-called van Kampen obstruction [vK32, Sha57, Wu65, Mel09], which is even efficiently computable (details on computability are given in [MTW11]). If , the obstruction is incomplete [FKT94], and it seems to be a challenging problem to determine whether embeddability of -complexes into is decidable. (Only NP-hardness is known [MTW11].) However, there are many interesting target spaces that are not . In geometry one often works with projective spaces, incidence problems lead to embeddings into Grassmanians or flag manifolds, etc. A possible concrete example where the ideas of this paper can be useful are considerations of Helly type results as in [GPP*+*17].111However, our work should be understand only as a first step towards an improvement of [GPP*+*17]. In particular, we did not attempt to upgrade our results to homological almost embeddings which are really used in [GPP*+*17]. Here considerations of a general manifold become apparent, for example, when considering Helly-type theorems for line transversals as in [CGHP08].
In relation to our second main goal, embeddability of the -skeleton of -simplex to a -manifold was considered in [Küh94, Vol96, GMP*+*17]. Volovikov [Vol96] shows, for quite general , that there is no embedding provided that induces a trivial map on (co)homology, which generalizes nonembeddability of in .222Volovikov’s result is in fact even more general in different directions. Given a -connected -manifold such that -skeleton of -simplex embeds into , Kühnel conjectured an upper bound on depending only on and the Euler characteristic of ; see equation (1) below. A weaker bound was proved in [GMP*+*17]. As an application of our tools, we will show how this bound can be significantly improved (for compact PL manifolds333In fact, we are not sure from the statement of the conjecture in [Küh94, Conjecture B] whether it regards arbitrary (possibly non-compact) manifolds or whether it regards polyhedral manifolds discussed in the paper which are PL and closed (a fortiori compact).). Such improvement also yields improved Radon and Helly type theorems on manifolds, which is our third goal.
Finally, in a special case when our research coincides with a classical topic of embeddings of graphs in surfaces [MT01]; and, in particular, our work is related to Hanani–Tutte type results for graphs on surfaces [PSS09, FK19, FK18]. In the language of these references, our algebraic description in this case provides a characterization of graphs admitting an independently even drawing into a given surface.
1.1 The Kühnel problem and Helly-type results
Before we explain the details of our description of embeddability of -complexes into -manifolds, let us survey a few results that we can reach with our tools.
Kühnel’s conjecture.
Kühnel conjectured [Küh94] that if the -dimensional skeleton can be embedded into a -connected -manifold , then
[TABLE]
Because of -connectivity, this inequality is equivalent to
[TABLE]
which seems to hold even without the connectivity assumption. (Here denotes the Betti number.)
The special case , of Kühnel’s conjecture is known as Heawood inequality and it is fully confirmed in this case (see [Rin74] for discussion).444Note that has vertices, thus is shifted by one when compared with the standard statement of the Heawood inequality. For , a recent far reaching work Adiprasito [Adi18] proves the Kühnel bound under an additional assumption that the embedding is sufficiently tame. Without the tameness assumption, together with Goaoc, Mabillard, Patáková and Wagner [GMP*+*17], we have obtained a bound . Here we demonstrate how the ‘obstruction machinery’ may improve this bound (under an extra assumption that is PL). Once the machinery is set up, the main idea of the proof is relatively simple; see the sketch at the beginning of Section 4.
Given a simplicial complex and a manifold (or arbitrary topological space in general) an almost embedding of into is a map such that whenever and are disjoint simplices of . Every embedding is an almost embedding. By we will denote the -intersection form on . The intersection form is discussed in more detail in Subsection 2.2. The main properties are that is a symmetric bilinear form and if and are two general position -cycles in , then counts the number of crossings between and modulo ; here stands for the corresponding homology class.
Theorem 1**.**
If the -skeleton of an -simplex can be almost embedded into a compact (possibly with boundary) PL -manifold , then
* and* 2.
* if the intersection form on is alternating, that is for all .*
If , our bounds agree with the value proposed by Kühnel and if the form is alternating the same is true for . The condition that the form is alternating is a natural condition that occurs, for example, if is a connected sum of . One of the advantages of Theorem 1 is that it also applies to manifolds which are not -connected. This distinguishes it from Kühnel’s conjecture. Using Theorem 1 we can, for example, see that there is no (almost) embedding of into .
For , Theorem 1 does not recover the Heawood inequality. However, considering that Theorem 1 is stated for almost embeddings, it seems to say something new even for as it is an open question whether embeddability and almost embeddability coincide for graphs on surfaces [FK19, Problem 5.2]. Almost embeddability is relevant for example in context of Helly-type theorems; see Theorem 2 and Corollary 3 below.
There are several cases where the inequalities from Theorem 1 are tight: there is a -point triangulation of the real projective plane (, , ), a -point triangulation of the complex projective plane (, , ) [KB83] and 15-point triangulation of the quaternionic projective plane (, , ) [Gor19], and the torus can by triangulated using vertices only (, , ). Quick computation of the number of faces reveals that each of these triangulations necessarily contains the complete -skeleton of . (It is -neighbourly [Küh94].)
In addition, there is a hope that bounds of Theorem 1 can be still improved significantly by using our tools, possibly giving a solution of the Kühnel conjecture. In Section 4 we pose a specific conjecture (purely in combinatorics and linear algebra), Conjecture 18, that implies Kühnel’s conjecture (in case that is a compact PL-manifold). A computer assisted search for small values of and suggests that Conjecture 18 may hold.
Radon and Helly type theorems.
Improved bounds on the Kühnel problem as in Theorem 1 immediately imply improved bounds on the Radon number (value in the statement below) in the theorem below. Consequently one obtains better bounds on Helly’s number [Lev51], Tverberg’s numbers [JW81], fractional Helly number [HL21], existence of weak -nets and -theorems [HL21, AKMM02].
Theorem 2**.**
Let be a compact PL -manifold. Let be a closure operator.555A closure operator is any function that for all satisfies , and . Typical examples are convex and affine hulls in or topological closure operators in topological spaces. Let be a set of size , such that is (topologically) -connected666From the proof follows that it suffices to require that the -th homotopy group of is trivial for each of size at most . Moreover, if one is willing to increase the bound on , it is possible to use the ideas from [Mat97] or [Pat19a] and allow that have more path-connected components, if all of them are sufficiently connected. for every of size at most .
- (i)
If , or 2. (ii)
if the intersection form of is alternating (over ) and ,
then there are two disjoint subsets such that .
Corollary 3** (Helly-type theorem).**
Let be a compact PL -manifold. Let be a finite collection of subsets of such that is -connected or empty for every subfamily . If is nonempty for every of cardinality less than , where is as in the previous theorem, then .
Proof [Lev51, Rad21].
Consider the following closure operator
[TABLE]
If , let be a minimal subset with . By assumption . By minimality of for each there is a point . The set has at least points. Thus Theorem 2 guarantees that it can be split into two disjoint sets such that there is a point . By our choice of the closure operator, such lies in every set of , contradicting . ∎
Theorem 2 follows the line of research of deducing Helly and Radon type theorems from non-embeddability results; see [Mat97], [GPP*+*17] or [Pat19b].
Corollary 3 is an analogy of Theorem 2 in [Mat97] or Theorem 1 in [GPP*+*17] for manifolds, with stronger assumption on intersections. This is already interesting for manifolds, as the optimal Helly number is linked to the solution of the Kühnel problem. The proof of Theorem 2 (modulo Theorem 1) follows by a combination of a suitable definition of Radon number [Pat19b] and techniques developed in [Mat97, GPP*+*17]. Because the proof is short, we reproduce it immediately.
Proof of Theorem 2.
For contradiction, we assume that is empty for every two disjoint subsets of . Under this assumption, we will build an almost embedding . This contradicts Theorem 1(i) in case (i) and Theorem 1(ii) in case (ii). We define inductively, skeleton by skeleton. We start by letting the points be the [math]-skeleton of . During the construction, we maintain the following property: If is a simplex of dimension at most and is the set of vertices of , then maps into .
Now, given a simplex of dimension at most , assume that is already defined on . Due to the property we maintain, we get that belongs to , where is the set of vertices of . As is -connected, we can extend to inside , thus we maintain the required property. It remains to show that the resulting is an almost embedding of into . Given disjoint -simplices and of , let be set of vertices of and be the set of vertices of . In particular and are disjoint. But then lies in and lies in and these two sets are disjoint by our assumption. ∎
1.2 Obstruction for embeddability
Now we describe an obstruction for embeddability of a -complex into a compact PL -manifold, which is our main technical tool. In general, we follow [Sha57, FKT94, Joh02, Sko08, Mel09] and [MTW11, App. D]; however the concrete interpretations of the van Kampen obstruction in these references somewhat vary. We choose to specify the details in a way convenient for working with intersection form later on. We postpone the precise definition of a general position map, intersection number and intersection form to Section 2 as they are not so essential for understanding this text in the introduction.
The standard van Kampen obstruction.
Let and be a simplicial -complex. Let be a general position map. Given two disjoint -simplices and of , the number of intersections and is finite and each such intersection is transversal. One way how to express the idea of the van Kampen obstruction [vK32] is the following: Let be the vector space over whose coordinates are indexed by the set of all (ordered) pairs of disjoint -simplices of . The general position map induces a vector such that its coordinate corresponding to the pair is the number of intersections between and modulo 2. It turns out that the vectors when considering over all possible general maps form an affine subspace of . In particular, if there is an embedding of into , this affine subspace has to contain the zero vector . For concrete , it is possible to determine whether contains the zero vector, and is essentially the object that we will call the van Kampen obstruction (see below).
For practical purposes (computations), it is convenient to consider as a certain cohomology class which we will overview below. In particular, will be replaced with deleted product of ; with corresponding intersection cochain and with certain cohomology class denoted . In addition, the similar ideas as above may be performed over the integers instead of . The cost is that one has to consider intersections of and carefully with signs but the benefit is that the integer valued obstruction is complete for .
From now on we perform all our considerations in a ring or . All the orientation considerations can be skipped if . (This specifically applies in the proof of Theorem 1 as the -version of the obstruction is fully sufficient there.) Let denote the deleted product of . We fix an orientation of every simplex of . This induces an orientation of the cells by the product orientation.777If is a positive basis of and is a positive basis of , then is a positive basis of . By we denote the group of -chains in (for some integer ).888We work with cellular homology, thus the group should be understood as and should be understood as an oriented generator corresponding to the cell with . The symbol stands for -skeleton of . This essentially means that is the group of formal -combinations of products with the fixed orientation as above. The boundary operator on is given by
[TABLE]
By we denote the group of -cochains in . These are homomorphisms from to . The coboundary operator, dual to the boundary operator, is given by
[TABLE]
for . We will need (only in dimension ) a subgroup of consisting of cochains satisfying
[TABLE]
We will also need (only in dimension ) a subgroup of consisting of cochains satisfying
[TABLE]
We call alternately-symmetric and symmetric. A simple computation reveals that for and vice versa for . Then the cohomology group is defined in the standard way as with respect to the coboundary operator
[TABLE]
The operator is in particular trivial, thus .
Given a general position map , we have the intersection cochain given so that is the intersection number of and . (The details are postponed to Section 2. Intuitively, the intersection number is the number of intersections between and ; however, if , then the intersections have to be counted carefully with signs.) This cochain satisfies ; therefore it belongs to . It turns out that the cohomology class is independent of the choice of . This class (for arbitrary ) is called the van Kampen obstruction for embeddability of into and we will denote it . If is an embedding, then which also implies that . Thus is indeed an obstruction for embeddability of into .
The obstruction in a manifold.
Now let us in addition assume that is a compact PL -manifold. Let us also assume that is -orientable—this condition is vacuous if while this is the standard orientability if . By we denote the -intersection form on .999It would be more appropriate to use the notation instead of consistently with the previous subsection. However, from now on, we want to simplify the notation for . If the properties of the form were sketched in the previous subsection and they are analogous for . In general, is again alternately-symmetric, that is, ; this is of course the same as symmetric if . Given a homomorphism , we define by . By alternating symmetry of we get that is indeed an alternately symmetric cochain.
Theorem 4** **(Existence of the obstruction101010As our obstruction is parametrized by homomorphisms
we have been asked whether Theorem 4 can be equivalently stated in (co)homological invariants instead of (co)chains. This is indeed possible: A homomorphism is an element of the cochain group . Each such element is a cocyle because is -dimensional. It can be computed that is independent of the choice of representative of a cohomology class in ; thus could be defined only with respect to such a cohomology class. ).
Let , or , be a -complex, and be a compact -orientable PL -manifold. Assume that there is an almost embedding . Assume also that the restriction of to the -skeleton is nullhomotopic. Then there is a homomorphism such that
[TABLE]
First, let us remark that the extra assumption that the restriction of to the -skeleton is nullhomotopic is always satisfied in two important cases: if either or is -connected. In particular, this occurs if is the -skeleton of an -simplex. The latter one we use in the proof of Theorem 1 and a reader interested only in the proof of Theorem 1 and willing to accept Theorem 4 as a blackbox may immediately jump to Section 4.
With slight abuse of terminology, we can consider non-existence of a homomorphism from the theorem as an obstruction for (almost) embeddability of to , and we say that this obstruction vanishes if such homomorphism exists.
Remarks 5*.*
- (a)
If is trivial, then must be a trivial homomorphism, thus our obstruction coincides with the standard van Kampen obstruction. 2. (b)
The minus sign at in the statement is not important as the van Kampen obstruction is an element of order , . 3. (c)
We will show that our obstruction is ‘quadratic’ in a sense that it vanishes if and only if certain system of quadratic equations has a solution; see Theorem 15. 4. (d)
Given a map , there are several ways how to describe an obstruction, depending on , for existence of a homotopy from to an embedding:
A necessary condition for existence of such homotopy is existence of an equivariant homotopy from to so called isovariant map; see Harris [Har69] for details. If is a -complex and is an -manifold and (in particular if and ), then this is even ‘if and only if’ condition; see [Har69, Theorem 1]. This gives rise to obstruction theories in this setting; see Corollary 6 and Corollary 8 in [Har69]. From this point of view, some description of an obstruction for embedding -complexes into -manifolds is not new. However, the added value of Theorem 4 is that it provides quite concrete description for all maps suitable for applications. 2. 2.
A more explicit description of such obstruction appears in a work of Johnson [Joh02] (in the setting when is a -complex and is a -manifold). There are some mild differences in the assumptions on . In particular, Johnson works in the smooth case. However, Johnson’s setting is overall closer to our setting than Harris’ setting because he essentially works with the van Kampen obstruction. When adapted to our notation, Johnson’s obstruction is a class in . However, it does not seem that Johnson’s approach answers which class is it. We in principle provide this answer (see the proof of Proposition 14) as an intermediate step in a proof of Theorem 4, though we need to assume the nullhomotopy condition as in Theorem 4.
As a counterpart to Theorem 4, using the standard tools, we will show that our obstruction is complete, if and is -connected. (We will mainly follow [FKT94] but similar ideas go back at least to Whitney [Whi44], Shapiro [Sha57] and Wu [Wu65].)
Theorem 6** (Completeness of the obstruction).**
Let , be a -complex, be a compact -connected (in particular orientable) PL -manifold. Assume that there is a homomorphism such that (over the integers), that is, the obstruction vanishes. Then there is a PL embedding .
The Kühnel problem revisited.
Theorem 6 can be used to transfer the solution to Kühnel’s problem from one manifold to another, as we discuss now. Another case, where Theorem 6 could be useful are the computational aspects that we will discuss in next subsection. In particular, in both these cases, the consideration of the obstruction over the integers is unavoidable.
In the proof of Theorem 2, it was crucial that Theorem 1 holds for almost embeddings (and not only for embeddings). However, our approach allows, under mild conditions on the manifold, to extend an upper bound on the Kühnel problem from embeddings to almost embeddings. This would be in particular interesting, if it were possible to remove the additional assumption on the embeddings in Adiprasito’s proof of the Kühnel bound (mentioned early in the introduction).
Proposition 7**.**
Assume that , is a compact orientable PL -manifold, and is a compact -connected orientable PL -manifold such that and have isomorphic intersection forms over the integers. If (topologically) almost embeds into , then PL embeds into .
Proof.
Given an embedding of to , Theorem 4 implies that there is a homomorphism such that . As the intersection forms of and are isomorphic, there is also a homomorphism such that . Therefore, we get the required PL embedding into from Theorem 6. ∎
The intersection form on is in particular very simple if is odd and is closed. The former property implies that the form is antisymmetric; the latter property implies that it is unimodular (after factoring out the torsion) [Pra07, Subsection 2.7]. Therefore for a suitable choice of the basis of (after factoring out the torsion) it can be represented by a block-diagonal matrix where each block is of the form ; this is a simple exercise (and probably a well known fact). The explicit reference containing the proof we were able to find are the online lecture notes [Mor18, Claim 2.1, Lecture 7]. On the other hand, the block diagonal matrix with blocks is the matrix of the intersection form of the connected sum of copies of , which is -connected. If we take this connected sum as , Proposition 7 gives the following corollary.
Corollary 8**.**
Assume that is odd and assume that (topologically) almost embeds into a closed orientable PL -manifold , then PL embeds into the connected sum of copies of .∎
In other words, Corollary 8 says that it we want to solve the orientable variant of the Kühnel problem for odd, it is sufficient to solve it in the very special cases for .
1.3 Computational aspects
Part of our motivation for introducing the obstruction for embeddability of into was to understand an analogue of algorithmic embeddability question from [MTW11], when the target space is (instead of Euclidean space as in [MTW11]). For this, let , for fixed and denote the computational problem which asks whether a -complex on input is embeddable into .
Question 9**.**
For which -manifolds is decidable?
This problem of course makes sense even without the assumption that but we will stay in the world of -manifolds as this is the first nontrivial case. As mentioned early in this section, is decidable, even polynomial time solvable, for . Also, if and is an arbitrary (closed) surface, then is decidable, even linear time solvable [Moh99, KMR08]. If , decidability of is unknown.
For , our approach allows us to reformulate each instance of this problem as a certain, very special, system of quadratic Diophantine equations. This follows from Theorems 4, 6, and 15 (stated later on). Unfortunately, it is in general undecidable to determine whether a system of quadratic equations over integers has a solution [Mat70]. However, the system of equations coming from Theorem 15 is somewhat special and we suspect that it can be solved algorithmically for sufficiently nice . In any case, the reformulation of Question 9 via Theorem 15 allows to try new tools when answering Question 9.
On the other hand, if we consider the same system of quadratic equations over , then solvability of such a system is decidable (in worst case by trying all options). This reflects in decidability stated in the following theorem. The properties of maps stated in the theorem are generalizations of even drawings and independently even drawings of graphs [PT04, FKMP15, FK19].
Theorem 10**.**
Let us assume that and is a compact -connected PL manifold. Then, it is algorithmically decidable to determine whether a given -complex admits
a general position map such that whenever and are disjoint -simplices of , then and intersect an even number of times; 2.
a general position map such that whenever and are -simplices of , then and intersect an even number of times.
Finally, if is compact PL and simply connected then it can be efficiently decided whether a given map is homotopic to an embedding. For details we refer to Remark 22. However, this remark is not very new; this is essentially just Johnson’s [Joh02] description of the obstruction, though not stated this way explicitly. We add this remark for completeness.
Organization.
In Section 2 we properly introduce the intersection number and the intersection form. Then, Theorem 4 is proved in Section 3; Theorem 1 is proved in Section 4; and Theorems 6 and 10 are proved in Section 5. In Section 6 we mention a few open problems.
2 Preliminaries
Throughout the paper, we work in the PL-category. In particular, all maps and manifolds are PL, unless stated otherwise. Simplicial complexes are geometric simplicial complexes, that is, triangulations of polyhedra as in [RS72]. We assume that is an integer, and is either the ring of integers or . We assume that is -orientable compact (possibly with boundary) -manifold, unless explicitly stated otherwise. (-orientability is the standard orientability, -orientability is vacuous.) In sequel ‘oriented’ stays for -oriented and all orientation considerations should be skipped if . We also assume that is -complex in which each simplex has a fixed orientation but we do not require any compatibility conditions for orientations of different simplices. By we denote the -skeleton of . The closed interval is denoted .
2.1 Intersection number
In the definitions of general position and intersection number below apart from our conventions on , we also allow . This fills the postponed details from Subsection 1.2.
General position.
Let be a map. We say that is a general position map if is injective; there are only finitely many with more than one preimage; each such has exactly two preimages, which both lie in , and the crossing of at is transversal. In addition, if has nonempty boundary, we assume that111111It would be perhaps more natural to assume for a general position map. However, allowing the nonempty intersection of and the image of will be useful in one of the proofs. . We will sometimes need to perturb a map to a general position map by a homotopy with a support in an arbitrarily close neighborhood of . In such case we mean to use Lemma 4.8 of [Hud69].
Sometimes, we will need a mutually general position of two maps , where is another -complex. This will be equivalent with requiring that is a general position map, where ‘’ stands for disjoint union.
Intersection number.
Let and be maps. Let , be two -simplices such that is in general position. Let be an intersection point of and , that is, for some and . By general position, the intersection is transversal and is in the interior of and is in the interior of . By we denote the sign of this intersection:
If , then .
If , because the intersection of and is transversal at , there is a neighborhood of in and an orientation preserving PL-embedding such that both and are flat. Considering the orientations of and as a choice of positively oriented bases, this gives positively oriented bases of (affine spans of) and . Then by concatenation, taking a positively oriented basis of first, we get an orientation of . We set if this orientation agrees with the orientation of (after applying ) and otherwise; see Figure 1 for an example. It turns out that .
Next, the intersection number of and is defined as
[TABLE]
where the sum is over all obtained as intersection points of and . Consequently,
[TABLE]
2.2 Intersection form.
By we denote the intersection form. Intuitively, given two cycles in general position, the value counts the intersection number of these two cycles, which could be defined similarly as for general position maps.
Intersection form for closed manifolds.
Now, we temporarily assume that is closed. In this case we refer to [Pra07, Chapter 2, §2.7] for precise definition; we use the dual form in [Pra07]. However, if , we assume that is also defined on the torsion part of and it evaluates to [math] there. (Prasolov [Pra07] points out that the form vanishes on the torsion part and he factors out the torsion—then the form is nondegenerate.) We will use the following properties of the intersection form:
is a bilinear form. 2.
is alternately-symmetric, that is, . 3.
evaluates to [math] on the torsion part of if . 4.
Let and be maps such that is in general position. Let , , be two -cycles, where and are all -simplices of and respectively. Then
[TABLE]
Property (i) follows immediately from the definition and (ii) is the contents of Theorem 2.17(b) in [Pra07]; (iii) is due to our convention. Finally, (iv) comes from the definition of the intersection number in [Pra07, Chapter 1, §5.3]. For getting formula (8) we need that and are cycles in mutually dual cell decompositions of but this can be achieved by considering sufficiently fine subdivision of and a perturbation of . For other properties of the intersection form, we also refer to [MAP].
Intersection form for manifolds with nonempty boundary.
As Prasolov points out [Pra07, Remark below Thm. 2.17], the intersection form can be also defined for manifolds with nonempty boundary. However, one has to be a bit careful because there are two natural ways how to do it, and in the case of manifolds with boundaries these two definitions are non-equivalent. Here we provide a definition for which formula (8) remains true.
Therefore now we assume that is compact with nonempty boundary. Let be the double of . (We take two copies of and we glue them together along their common boundary). Let be the intersection form on and we aim to define the intersection form on . Let be two homology classes in . Let be -cycles with and where the subscript indicates that their homology class is taken in . (Analogously, we use subscript if the homology class is taken in ). We define
[TABLE]
We note that is well defined because if and are homologous in , then they are homologous in as well. We also remark that all the properties (i), (ii), (iii), (iv) remain true for with nonempty boundary—this can be easily checked because satisfies them.
3 Van Kampen obstruction in a manifold
Throughout this section we have the same assumptions as in the beginning of Section 2 regarding the notation , and .
Recall from the introduction that denotes the deleted product of ; is the group of alternately-symmetric cochains; is the corresponding cohomology group; and is the van Kampen obstruction. Let us also recall that where is the intersection cochain of an arbitrary general position map .
We generalize the intersecton cochain to maps with codomain : Given a general position map we define the intersection cochain for as via
[TABLE]
It follows from (7) that is alternately-symmetric as required. We also define the van Kampen obstruction of the homotopy class of as the cohomology class .
Lemma 11**.**
Let be homotopic general position maps. Then . Equivalently, .
The proof of Lemma 11 is given in [Sha57, Lemma 3.5] and reproduced, e.g., in [FKT94, Lemma 1] in the case that . The proof is based on an existence of a homotopy between and and can be used essentially in verbatim in our setting.
Lemma 12**.**
Let be a general position map such that the restriction of to is nullhomotopic. Then there is a PL -ball in and a general position map homotopic to (in ) such that .
Proof.
Because the restriction of to is nullhomotopic, by the homotopy extension property [Hat01, Proposition 0.16] there is homotopic to such that the restriction of to is constant. Let and let be -ball such that . By further homotopy, we can get such that restricted to is in general position, and . (We first perform the homotopy on and then we use the homotopy extension property again.) Finally, by next homotopy fixed on we push the image of outside so that the resulting map is in general position, obtaining the required . ∎
Now the shift of to in the previous lemma allows us to easily compare the intersection cochain with the intersection cochain of another map which is fully inside . The advantage of using is that this is essentially the case in . Therefore let be a -ball in . Let and be two general position maps such that . (In particular .)
Now for a -simplex let be the (singular) -cycle . We also define via
[TABLE]
Lemma 13**.**
.
Proof.
For we have
[TABLE]
The second equality follows from the fact that and from (8). ∎
Proposition 14**.**
Let be a general position map with . Assume that the restriction of to is nullhomotopic. Then there is a homomorphism such that is trivial.
Proof.
Let be the map obtained from Lemma 12. Take an arbitrary general position map which coincides with on and define and as above. By Lemma 13 and Lemma 11, we get Let us define to be the homology class of in . Then, according to the earlier definition of , we get and . Therefore . ∎
Theorem 4 is an immediate consequence.
Proof of Theorem 4.
In this proof we use both topological and PL maps therefore we carefully distinguish them. Let be a topological almost embedding from the statement of Theorem 4. By a small perturbation (cf. [Hud69, Lemma 4.8]) we can assume that is a general position PL map and still an almost embedding (if and have a positive distance before the perturbation in some metric inducing topology of , then they have positive distance also after a sufficiently small perturbation). In particular . Now we can use Proposition 14. ∎
Finger moves.
For further applications it is useful to describe the zero cohomology class in explicitly. This we will do now via so called elementary cochains/finger moves.
Following [FKT94] let us define elementary cochains as follows: Given a -simplex and -simplex with , let be given by while it evaluates to zero on remaining cells. These cochains generate . Therefore generate ; compare with (5). In other words, for and its cohomology class we get
[TABLE]
where the sum is over all pairs , as above and .
Geometrically, the cochains correspond to so called finger moves; see Figure 2. If we pull a finger from towards as suggested on Figure 2, the intersection cochain changes by (both signs are achievable depending on how is the finger pulled). For a slightly more details, we refer to [FKT94].
System of quadratic equations.
Our next aim is to describe an existence of almost embedding via solvability of a certain system of quadratic equations.
Let be a -simplex and -simplex respectively and assume that and are disjoint. For every such pair we define a variable .
Next we need to distinguish whether or . If , assume that where is the torsion. Let be the homomorphism obtained from the isomorphism above after factoring out the torsion. If , then for some and we take an arbitrary isomorphism .
Let be the matrix of , that is, for every we have . For every -simplex and every we define an integer variable and we set . Let be any fixed intersection cochain in the class ; an explicit choice is described in [MTW11, App. D].
Now consider a system of quadratic equations with variables and over given by the following equation for each pair of disjoint -simplices.
[TABLE]
We remark that swapping and gives the same equation as both sides are alternately-symmetric.
Theorem 15**.**
Let be a compact -orientable PL -manifold. Then there is a homomorphism such that is trivial (considered over ) if and only if the system of equations (11) has a solution in .
Proof.
First assume that is trivial, hence and differ by a linear combination of cochains by (10). Thus, there are , one for each , such that for every we get . We also set as , then . By rearranging and swapping the signs at all we get a solution of (11).
Now assume that we have a solution of (11). For a -simplex , we define as an arbitrary element in and we extend to a homomorphism from to . We get . Therefore, from (11), we get that is a linear combination of cochains by (10). This gives that and belong to the same cohomology class of ; that is, is trivial. ∎
4 Kühnel question
In this section we prove Theorem 1. However; first we sketch a proof of Theorem 1 with slightly weaker bound . For a full proof of Theorem 1, it is not necessary to follow this sketch. However, it may help to understand why do we prepare some auxiliary claims.
Sketch of Theorem 1 with a weaker bound ..
Let us assume that almost embeds into . By Theorem 4, there is such that . Consider an induced subcomplex of on vertices (if , otherwise we are done). It is well known that the van Kampen obstruction of this complex is nonzero. The formula therefore implies that is also nontrivial when restricted to . In particular, we will deduce that there is a pair of cycles such that . Because is generated by boundaries of -simplices, we can assume that where and are -simplices in . On the other hand we will also show that whenever is -simplex disjoint from . (In particular must share a vertex with but we do not need it now.)
Let be the induced subcomplex of on all vertices of except the vertices of . From the conditions and (for disjoint with ) it follows that when considering the restriction of to , the rank of is decreased at least by . We repeat this procedure as long as the currently considered subcomplex has at least vertices. In the beginning, the rank of is at most , thus we may perform at most such removals of vertices. This shows that the number of vertices (which is ) is at most because after all removals we cannot have a subcomplex on vertices or more. ∎
It is not too difficult to fill the details in the sketch above. However, as our bounds in Theorem 1 indicate, in a proof of Theorem 1(i) we want to remove only vertices instead of in each step; on the other hand in a proof of Theorem 1(ii), we will remove vertices but we will decrease the rank of the form by . These improvements require a more subtle analysis.
Throughout this section, let . We set to be the -skeleton of an -simplex while is a compact PL -manifold. We work only with coefficients, that is, we set . Note the notions ‘alternately symmetric’ and ‘symmetric’ coincide over . In particular, is a symmetric bilinear form over in this case. We also systematically replace ‘’ with ‘’ in expressions such as .
Now we state the two main ingredients for the proof of Theorem 1. Given a vertex of and a simplex not containing , by we denote the join of and , that is, the simplex formed by vertices of and by . Note that if is a -simplex in , then belongs to .
Proposition 16**.**
Assume that almost embeds into , then there is a symmetric bilinear form on of rank at most satisfying the following conditions.
- (C1)
Let , be disjoint -simplices in . Then . 2. (C2)
Let be an induced subcomplex of on vertices (that is, is isomorphic to ). Then for every vertex of we get
[TABLE]
where is the set of all unordered pairs of disjoint -simplices in avoiding .
In addition, if for every , then for every .
Relation between Proposition 16 and the preceding sketch is the following: If embeds into , then by Theorem 4 there is such that . We will take so that . Then the conditions (C1) and (C2) verify the conditions required in the sketch. Although we do not need it, we note that the proof of Theorem 3 in [Kyn20] shows that the other implication can be partially reverted for : If (C1) and (C2) are satisfied for obtained from and as above, then is trivial.
Proposition 17**.**
Assume that is a symmetric bilinear form on satisfying conditions (C1) and (C2) (in Proposition 16).
Then
[TABLE]
Assuming the two propositions above, Theorem 1 follows immediately:
Proof of Theorem 1.
Assume that almost embeds into . Let be the symmetric bilinear form on obtained from Proposition 16. Because , we immediately deduce Theorem 1(i) from (12). If, in addition, for every , then for every and we deduce Theorem 1(ii) from (13). ∎
Propositions 16 and 17 are proved in forthcoming subsections.
In fact we conjecture that the bounds given by Proposition 17 can be improved to the Kühnel bounds:
Conjecture 18**.**
Assume that is a symmetric bilinear form on satisfying conditions (C1) and (C2) (in Proposition 16).
Then
[TABLE]
Proposition 16 and Conjecture 18 together imply Kühnel’s conjecture (for PL manifolds) in the same way as Theorem 1 is proved. In fact they imply even something stronger. (It is not necessary to assume -connectedness and the conclusion holds for almost-embeddings.)
Computer-assisted bounds.
In our proof of Theorem 1, we do not use Proposition 16 in full strength—at least for small values the bounds can be improved: If is odd, all non-degenerate symmetric bilinear forms on are equivalent to the form with the identity matrix . If , we furthermore have symplectic forms—forms equivalent to
[TABLE]
These are the forms satisfying for every . The matrix of can hence be written as , where or for , and is a matrix over . Proposition 16 then translates into equations over which needs to satisfy. For small values these equations can be turned into a CNF formula and checked by modern SAT solvers, preferably ones that support xor clauses, e.g. CryptoMiniSat [SNC09]. Using this technique we obtain computer assisted bounds in Table 1.
4.1 Proof of Proposition 16
Given as in Theorem 4, as announced earlier, we define a symmetric bilinear form on via . We observe that the rank of is at most the rank of which is at most . We also observe that if for every , then for every . These are some of the conditions required on in Proposition 16.
For the proof of Proposition 16 we also need the following lemma.
Lemma 19**.**
Let be a cohomology class. Let be a -chain in the ordinary chain group such that is symmetric. (That is, and appear with the same coefficient in for any -simplex and -simplex .) Then the value is independent of the choice of the representative with .
Proof.
Let be such that . Let . By the previous condition, is cohomologically trivial, thus for some . Then we get
[TABLE]
The last equality above follows from the facts that for any -simplex and -simplex and that is symmetric. Thus we get as required. ∎
Now, let be a homomorphism as in Theorem 4. The conclusion of Theorem 4 is that and are the same homology class. On the one hand is a representative of this cohomology class; on the other hand an arbitrary intersection cochain of a general position map is a representative as well. Consequently, Lemma 19 gives
[TABLE]
Our strategy is that we will deduce Proposition 16 from (14) by suitable choices of and .
Proof of Proposition 16(i).
Because almost embeds into , there is such that by Theorem 4. Take via as described above.
Take the -chain given by . Note that is actually a cycle. Thus and satisfies the assumptions of Lemma 19. Let be an arbitrary general position map such that and are disjoint. (This is possible because and are disjoint.) Then we get
[TABLE]
as required. The first equality is the definition of ; the second equality comes from the definition of ; the third equality is the contents of (14); and the last equality follows from our choice of which implies that the intersection cochain is identically zero on . ∎
For a proof of Proposition 16(ii), we will need another auxiliary lemma which will be also reused in a proof of Proposition 17. Given an induced subcomplex of on vertices let be the set of all unordered pairs of disjoint -simplices in . We also consider a chain given by
[TABLE]
where is an arbitrary fixed order on -simplicies of . We check that satisfies the assumptions of Lemma 19, that is, is symmetric: Let be the isomorphism of swapping the coordinates. Then is a cycle formed by all products over all ordered pairs of disjoint -simplices of . Therefore which implies (as we work over ). Consequently is symmetric as required.
Lemma 20**.**
Let be a symmetric bilinear form on . Let be an induced subcomplex of on vertices. Then for arbitrary vertex of the value:
[TABLE]
is independent of the choice of . In addition, if is a homomorphism and for every , then the value of the sum (15) equals .
Proof.
First, we extend to a symmetric bilinear form on . If we are in the ‘in addition’ case that , then we simply set for -simplices and of .
In any other case, can be obtained in the following way: We pick a vertex . Then for -simplices and in we set
[TABLE]
It is easy to check that if both and avoid . In addition, because the cycles for avoiding generate , we get for any .
Our aim is to show that
[TABLE]
Because the right-hand side of (16) is independent of the choice of , this will prove the first part of the lemma. If we are in the ‘in addition’ case, then we further get
[TABLE]
where the last equality follows from the definitions of and (from we only need that for every exactly one of the products and appears with coefficient in ). This proves the lemma as soon as we show (16).
By bilinearity of the intersection form,
[TABLE]
where is the set of all (unordered) pairs of distinct -simplices in and is the number of appearances of , , or , over all unordered pairs , modulo . Therefore, for checking (16), it remains to show that if (that is, and are disjoint) and if ( and are not disjoint). We also remark that for any only one of the two options above for appearance is possible, thus we can safely assume and when counting.
If and share a vertex different from , then there is no appearance as and are required to be disjoint and consequently and share only .
If and share but no other vertex, then there are exactly two vertices of outside . Consequently, there are two appearances and .
If neither nor contains , then there is the exactly one appearance: .
If exactly one of the simplices , contains , say contains , then there is exactly one appearance , where is the vertex of not in . ∎
Proof of Proposition 16(ii).
We will take and in the same way as in the proof of (i). It is well known that there is a general position map such that with defined above Lemma 20; see, e.g., [Mel09, Example 3.5]. Then by Lemma 20 and by (14) we get
[TABLE]
as required. ∎
4.2 Proof of Proposition 17
Proof.
We will prove both items of Proposition 17 simultaneously by induction in the rank of . If , then for any two cycles . In particular, (C2) can only be satisfied in this case if the there is no induced subcomplex of on vertices, i.e., if . (Recall that has vertices.) This yields the base for the induction in both cases.
Assume now that we are in the case (12) and not in (13), which has a better bound. Since , where runs through all -simplices in , generate , there is a -simplex for which . Up to reordering the vertices, we may assume that is the simplex on the last vertices of . Define121212The definition of was obtained as follows. We considered the projection to the “orthogonal” complement of , and we took as the pullback of under .
[TABLE]
Then is a symmetric bilinear form. If for some , for all , the same is true for . Moreover for every , yet . In other words, , and so . Let be the subcomplex of formed by the first vertices of . We are going to show that restricted to satisfies both (C1) and (C2) (see Proposition 16). Due to (C1) for and (17), as long as at least one of the chains is disjoint with . This is clearly true when verifying (C1) for on . It also holds when verifying (C2), if . However, Lemma 20 then tells us that (C2) holds for as well.
By induction, , leading to
[TABLE]
Let us now prove the case (13). If for every and the rank of is non-zero, there are two simplices and for which . By reordering the vertices, if necessary, we may assume that is the subcomplex on the last vertices of . Define131313Here we consider the pullback of by the “orthogonal” projection to .
[TABLE]
This is a symmetric bilinear form. If for some , for all , the same is true for . Moreover . If could be written as a linear combination , where and , then , a contradiction. It follows that the vectors and are linearly independent modulo . Hence and .
Let now be the complex formed from by deleting the vertices of . We are going to show that restricted to satisfies both (C1) and (C2). However, if , then both cycles and are disjoint with . Then (C1) for and (18) imply that . In particular, satisfies both (C1) and (C2) on . By induction, , leading to
[TABLE]
5 Completeness
The aim of this section is to prove Theorem 6 and then Theorem 10. Therefore, for this section, in addition to our standard conventions from Section 2, we assume that and is -connected; unless explicitly stated otherwise, which occurs only in Remark 22.
Proof of Theorem 6.
All considerations in this proof are over . According to the statement, we also assume that we are given such that is trivial.
Let be a (closed) -ball. Assume that is a general position map with . Our first step will be to find a general position map , agreeing with on such that where is as in Section 3; see (9). The second step will be to find a homotopy of to a general position map such that . The third step will be to remove the remaining self-intersections via standard tricks.
Step 1. We define on each -simplex separately. We only need that . Then via (9).
By Hurewicz theorem , let be the Hurewicz isomorphism. We also recall the definition of (see [Pra07, Chap.3, §1.1]). Given a map where , , we set where is the induced map on homology and is the fundamental class. The map can be also regarded as a map from to , constant on .
Consider temporarily as a simplex in containing the origin and let be a homothetic smaller copy of . Let be a map, constant on , representing the class in . Now we want to extend to . We have , thus we can describe the extension of on identifying with and with . Let coincide with on , then we first extend to as a homotopy in from to a constant map. Now let be an arbitrary path from to (recall that is constant on both and ). For we define .
It follows from the construction that the homology class of is . Now it is sufficient to consider a homotopy of , constant on , such that the resulting map maps the interior of to , and then perform a perturbation to a required general position map .
Step 2. From the assumption that is trivial and by Lemma 13, we get that is trivial. By (10) this means that
[TABLE]
where the sum is over all pairs , where is a -simplex, is a -simplex and ; are the elementary cochains defined above (10); and . If were , then for any we could apply ‘van Kampen finger moves’ as described in [FKT94, §2.4] and which provide a homotopy from to another map such that . (Both choices are possible.) In order to adapt to our situation of general , we consider a general position PL-path in the interior of connecting a point in the interior of with a point in the interior of . Then we consider a regular neighborhood of , which is a ball by [RS72, Corollary 3.27]. We perform the finger-move as in [FKT94, §2.4] inside which has exactly same effect on as in . Therefore we can get a homotopy from to with the required property by successively applying finger moves.141414This step of obtaining out of seems to be the bulk of the work [Joh02]. However, the standard approach via finger moves presented here seems to be simpler. (We could not directly refer to [Joh02] in this paragraph, as Johnson works in smooth category.) In addition, avoids .
Step 3. Finally, we want to build the required embedding out of . This can be done by standard tricks such as the Whitney trick. They are described in [FKT94, §2.4] for . The key observation is that all tricks are based on finding a copy of in in general position, filling this with a general position disk , taking a regular neighborhood of , which is a ball, and removing the singularities inside . In a simply connected manifold, these steps work in verbatim. This finishes the proof of Theorem 6. ∎
Now, we provide (somewhat weaker) analogy of Theorem 6 for the case used in the proof of Theorem 10.
Proposition 21**.**
Let us assume that and is compact -connected. Then, the following conditions are equivalent.
There is a homomorphism such that (over ). 2.
There is a general position map such that for every pair of disjoint -simplices, and have an even number of intersections. 3.
There is a general position map such that for every pair of -simplices, and have an even number of intersections. (We can even assume that is an embedding on every -simplex and that and share only , if and are -simplices which are not disjoint.)
Proof of Proposition 21.
The implication follows from Proposition 14. (Any map from a -complex into a -connected manifold is nullhomotopic.) The implication is obvious.
Thus it remains to prove , and . Note that the condition on from is equivalent with .
The proof of is analogous to steps 1. and 2. in the proof of Theorem 6, thus we only point out the single difference: In step 1 for we use the Hurewicz isomorphism ; however, we only use that is an epimorphism. If we consider as a homomorphism then the proof that is an epimorphism from [Pra07, Theorem 3.2] works in verbatim.
The proof of follows the step 3 of the proof of Theorem 6. However, we only perform the tricks that remove self-intersections of simplices that share at least one vertex. (For comparison, the reason why we cannot get rid of all singularities is that we cannot perform the Whitney trick. Given two disjoint -simplices and in the Whitney trick may remove a pair of intersection points provided that the signs at and are opposite. But we do not know whether we get opposite signs if we perform computations only over .) ∎
Now, Theorem 10 follows quickly.
Proof.
By Theorem 15 and Proposition 21, it is sufficient to find out whether the system of equations (11) has a solution in . This is decidable as is finite. ∎
Remark 22*.*
Let us consider another algorithmic question: Given a -complex , a compact PL -manifold , not necessarily -connected, and a general position map . We would like to know whether is homotopic to an embedding. Let us also assume that is presented on the input via its intersection cochain over the integers. Then deducing whether is of course efficiently computable even over the integers. (In formula (11), the term on the left side disappears while we have on the right side, thus the equations become linear.)
Therefore, the question whether is homotopic to an embedding can be solved efficiently whenever vanishing is a complete obstruction for being homotopic to an embedding. According to Johnson [Joh02, Theorem 4] this occurs when is closed, smooth and simply connected. However, the assumption that is compact, PL and simply connected is also sufficient by checking Step 2 of the proof of Theorem 6; we leave the details for the interested reader.
6 Conclusions and open problems
Here we mention few conclusions and open problems, sometimes touched in the introduction.
Existence of the obstruction and completeness.
Given an almost embedding , the obstruction class is well defined even if we do not assume that restricted to the -skeleton of is nullhomotopic. However, we need to assume nullhomotopy for describing the obstruction as in Theorem 4. In particular, our approach gives where and (considering only general position PL maps). In particular, if there is an almost embedding , then the trivial class belongs to and thereby to as well, which is in principle our obstruction.
Problem 23** (Existence).**
Is there an easy to describe superset of even if we do not assume the nullhomotopy condition, perhaps via (co)homology of or .
Problem 24** (Completeness).**
When implies ? When implies that there is an embedding ?
If we do not assume that the restriction of every map to the -skeleton is nullhomotopic, the answer to the first question of Problem 24 may of course depend on the answer to Problem 23. In our proof of Theorem 6, the implication was the contents of steps 1 and 2 in the proof and there we really used -connectedness of the manifold. The implication implies that there is an embedding was the contents of step 3 and it seems to be generally well understood. There we used and the fact that is simply-connected. This implication does not hold if even if ; [FKT94]. We also do not expect that the requirement that is simply-connected can be removed in general.
Somewhat specific case occurs when , that is, is a graph and is a surface, for simplicity connected, otherwise we can treat every component separately (let us remark that in this case the nullhomotopy condition is satisfied). If then even vanishing the -version of the van Kampen obstruction implies that is a planar graph [CH34, Tut70]. When is a general surface, Fulek and Kynčl [FK19] in their noticeable work provide an example of , and a drawing such that over whereas does not embed in . This shows that the -version of our obstruction is not a complete obstruction for embeddability of graphs into surfaces. The -case is not answered yet and it is essentially equivalent to Problem 5.3 in [FK19] (restated in our language):
Problem 25**.**
Assume that is a graph and a connected orientable surface. Assume that there is a general position map with (over ). Does it follow that embeds in ?
Computational aspects.
We have already mentioned Question 9 in the introduction. Here we only specify a few concrete cases when is -connected and this question seems to be easiest to approach.
Problem 26**.**
Is decidable for . 2.
Is decidable, where is the quaternionic projective plane? (We remark that is an -dimensional manifold.)
In the first case the intersection form has matrix For , .
Homological almost embeddings.
Motivated by approach in [GPP*+*17] we pose:
Problem 27**.**
Can Theorem 4 be upgraded to homological almost embeddings? (We refer to [GPP*+*17] for a definition of homological almost embeddings.)
Acknowledgments
We would like to thank Xavier Goaoc, Zuzana Patáková and Uli Wagner for discussions in early stages of this project. We also thank Karim Adiprasito for explaining us the consequences of his work in [Adi18].
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[Adi 18] K. Adiprasito. Combinatorial Lefschetz theorems beyond positivity. Preprint; https://arxiv.org/abs/1812.10454 , 2018.
- 2[AKMM 02] N. Alon, G. Kalai, J. Matoušek, and R. Meshulam. Transversal numbers for hypergraphs arising in geometry. Adv. in Appl. Math. , 29(1):79–101, 2002.
- 3[CGHP 08] O. Cheong, X. Goaoc, A. Holmsen, and S. Petitjean. Helly-type theorems for line transversals to disjoint unit balls. Discrete Comput. Geom. , 39(1-3):194–212, 2008.
- 4[CH 34] Ch. Chojnacki (H. Hanani). Über wesentlich unplättbare Kurven im dreidimensionalen Raume. Fund. Math. , 23(1):135–142, 1934.
- 5[FK 18] R. Fulek and J. Kynčl. The ℤ 2 subscript ℤ 2 \mathbb{Z}_{2} -genus of Kuratowski minors. In 34th International Symposium on Computational Geometry (So CG 2018) . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
- 6[FK 19] R. Fulek and J. Kynčl. Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4. Combinatorica , 39(6):1267–1279, 2019.
- 7[FKMP 15] R. Fulek, J. Kynčl, I. Malinović, and D. Pálvölgyi. Clustered planarity testing revisited. Electron. J. Combin. , 22(4):Paper 4.24, 29, 2015.
- 8[FKT 94] M. H. Freedman, V. S. Krushkal, and P. Teichner. Van Kampen’s embedding obstruction is incomplete for 2-complexes in ℝ 4 superscript ℝ 4 {\mathbb{R}}^{4} . Math. Res. Lett. , 1(2):167–176, 1994.
