Related papers: Hardness of embedding simplicial complexes in $\R^…

We prove that an m-dimensional unit ball D^m in the Euclidean space {\mathbb R}^m cannot be isometrically embedded into a higher-dimensional Euclidean ball B_r^d \subset {\mathbb R}^d of radius r < 1/2 unless one of two conditions is met --…

We work in the smooth category. If there are knotted embeddings S^n\to R^m, which often happens for 2m<3n+4, then no concrete complete description of embeddings of n-manifolds into R^m up to isotopy was known, except for disjoint unions of…

This work investigates the hardness of computing sparse solutions to systems of linear equations over F_2. Consider the k-EvenSet problem: given a homogeneous system of linear equations over F_2 on n variables, decide if there exists a…

Efficient embedding virtual clusters in physical network is a challenging problem. In this paper we consider a scenario where physical network has a structure of a balanced tree. This assumption is justified by many real- world…

We study embedding a subset $K$ of the unit sphere to the Hamming cube $\{-1,+1\}^m$. We characterize the tradeoff between distortion and sample complexity $m$ in terms of the Gaussian width $\omega(K)$ of the set. For subspaces and several…

We offer the following explanation of the statement of the Kuratowski graph planarity criterion and of 6/7 of the statement of the Robertson-Seymour-Thomas intrinsic linking criterion. Let us call a cell complex 'dichotomial' if to every…

Despite much research, hard weighted problems still resist super-polynomial improvements over their textbook solution. On the other hand, the unweighted versions of these problems have recently witnessed the sought-after speedups.…

We present a new way to encode weighted sums into unweighted pairwise constraints, obtaining the following results. - Define the k-SUM problem to be: given n integers in [-n^2k, n^2k] are there k which sum to zero? (It is well known that…

Let n and k be positive integers with and k < n. Then of course SU(k,1) is contained into SU(n,1). Moreover, which is less clear - but proved by Khoroshkin -, the representation theory of SU(k,1) at the generalized infinitesimal character…

Bi-spinor and G-structure methods are used to classify the possible consistent truncations of type II supergravity to $d=6$ Einstein-Maxwell (gauged) supergravity, and its consistent sub-sectors. In the absence of R-symmetry gauging and a…

For positive integers k,n, we investigate the simplicial complex NM_k(n) of all graphs G on vertex set [n] such that every matching in G has size less than k. This complex (along with other associated cell complexes) is found to be homotopy…

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…

The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a…

A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a…

We study the existence of irreducible $SU(2)$-representations for cyclic branched covers of knots in $S^3$. Our main result establishes that if $K$ is a non-trivial prime knot and $d$ is an integer such that $d \geq 2$ and $\Sigma_d(K)$ is…

Following Ghomi and Tabachnikov we study topological obstructions to totally skew embeddings of a smooth manifold M in Euclidean spaces. This problem is naturally related to the question of estimating the geometric dimension of the stable…

We consider the class of Levi nondegenerate hypersurfaces $M$ in $\bC^{n+1}$ that admit a local (CR transversal) embedding, near a point $p\in M$, into a standard nondegenerate hyperquadric in $\Bbb C^{N+1}$ with codimension $k:=N-n$ small…

We study families of axis-aligned boxes in a $d$-dimensional Euclidean space $\mathbb{R}^d$ whose placement is restricted by bounds on the dimension of their pairwise intersections. More specifically, two such boxes in $\mathbb{R}^d$ are…

Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…

We consider the classic 1-center problem: Given a set $P$ of $n$ points in a metric space find the point in $P$ that minimizes the maximum distance to the other points of $P$. We study the complexity of this problem in $d$-dimensional…