Embeddings of k-complexes into 2k-manifolds

04/04/2019
by   Pavel Paták, et al.
0

If K is a simplicial k-complex, the standard van Kampen obstructions tells you whether K can be embedded into R^2k or not (provided k≠ 2). We describe how the obstruction changes if we replace R^2k by a closed PL 2k-manifold satisfying a certain technical condition: We require that every map f |K| → M is homotopic to a map f' |K| → M such that f'(|K^(k-1)|) fits into some 2k-ball in M, where K^(k-1) stands for the (k-1)-skeleton of K. The technical condition is satisfied, in particular, either if M is (k-1)-connected or if K is the k-skeleton of n-simplex, Δ_n^(k), for some n. Under the technical condition, if K embeds in M, then our obstruction vanishes. In addition, if M is (k-1)-connected and k ≥ 3, then the obstruction is complete, that is, we get the reverse implication. If M = S^2k (or R^2k) then the intersection form on M vanishes and our obstruction coincides with the standard van Kampen obstruction. However, if the intersection form is nontrivial, then our obstruction is not linear (a cohomology class) but rather `quadratic' in a sense that it vanishes if and only if a certain system of quadratic equations over integers is solvable. It remains to be determined whether these systems can be solved algorithmically. Finally, the Z_2-reduction of the obstruction shows how to obtain a non-trivial upper bound for the Kühnel problem: determine the smallest n so that Δ_n^(k) does not embed into M. Also, the Z_2-reduction is computable and, if M is (k-1)-connected, it determines whether there is a map f |K| → M which has an even number of crossings of f(σ) and f(τ) for each pair (σ, τ) of disjoint k-simplices of K.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/18/2018

A 2-Norm Condition Number for Bézier Curve Intersection

We present a short note describing a condition number of the intersectio...
research
06/15/2021

When the positive semidefinite relaxation guarantees a solution to a system of real quadratic equations

By solving a positive semidefinite program, one can reduce a system of r...
research
06/16/2020

Testing systems of real quadratic equations for approximate solutions

Consider systems of equations q_i(x)=0, where q_i: R^n ⟶ R, i=1, …, m, ...
research
09/05/2023

The ℓ-intersection Pairs of Constacyclic and Conjucyclic Codes

A pair of linear codes whose intersection is of dimension ℓ, where ℓ is ...
research
12/06/2021

Embeddings of k-complexes in 2k-manifolds and minimum rank of partial symmetric matrices

Let K be a k-dimensional simplicial complex having n faces of dimension ...
research
01/08/2013

On Intersecting IFS Fractals with Lines

IFS fractals - the attractors of Iterated Function Systems - have motiva...
research
08/19/2021

A relaxed technical assumption for posterior sampling-based reinforcement learning for control of unknown linear systems

We revisit the Thompson sampling algorithm to control an unknown linear ...

Please sign up or login with your details

Forgot password? Click here to reset