Related papers: Hardness of almost embedding simplicial complexes …

The Kirchberg Embedding Problem (KEP) asks if every C*-algebra embeds into an ultrapower of the Cuntz algebra $\cal O_2$. Motivated by the recent refutation of the Connes Embedding Problem using the quantum complexity result MIP*=RE, we…

In this paper, we contribute toward a classification of two-variable polynomials by classifying (up to an automorphism of $C^2$) polynomials whose Newton polygon is either a triangle or a line segment. Our classification has several…

The vanishing of Van Kampen's obstruction is known to be necessary and sufficient for embeddability of a simplicial n-complex into $R^{2n}$ for $n\neq 2$, and it was recently shown to be incomplete for $n=2$. We use algebraic-topological…

We give essentially tight bounds for, $\nu(d,k)$, the maximum number of distinct neighbourhoods on a set $X$ of $k$ vertices in a graph with twin-width at most~$d$. Using the celebrated Marcus-Tardos theorem, two independent works [Bonnet…

Given a finite number of samples of a continuous set-valued function F, mapping an interval to non-empty compact subsets of $\mathbb{R}^d$, $F: [a,b] \to K(\mathbb{R}^d)$, we discuss the problem of computing good approximations of F. We…

Proximity graphs have been studied for several decades, motivated by applications in computational geometry, geography, data mining, and many other fields. However, the computational complexity of classic graph problems on proximity graphs…

One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This…

The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the…

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

We prove for various finite groups $G$ and integers $n\geq 1$ that there are families of equations with Galois group $G$ that cannot be simplified to a one-parameter family even after adjoining a root of a polynomial of degree at most $n$.…

If $g$ is a map from a space $X$ into $\mathbb R^m$ and $q$ is an integer, let $B_{q,d,m}(g)$ be the set of all lines $\Pi^d\subset\mathbb R^m$ such that $|g^{-1}(\Pi^d)|\geq q$. Let also $\mathcal H(q,d,m,k)$ denote the maps $g\colon…

A strong geodetic set of a graph~$G=(V,E)$ is a vertex set~$S \subseteq V(G)$ in which it is possible to cover all the remaining vertices of~$V(G) \setminus S$ by assigning a unique shortest path between each vertex pair of~$S$. In the…

A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected $2$-complex every link graph of which is 3-connected…

We study the well-known Label Cover problem under the additional requirement that problem instances have large girth. We show that if the girth is some $k$, the problem is roughly $2^{\log^{1-\epsilon} n/k}$ hard to approximate for all…

We study regularity of the time-delayed coordinate maps \[\phi_{h,k}(x) = (h(x), h(Tx), \ldots, h(T^{k-1}x))\] for a diffeomorphism $T$ of a compact manifold $M$ and smooth observables $h$ on $M$. Takens' embedding theorem shows that if $k…

Let $X$ be a projective toric variety of dimension $n$ and let $L$ be a ample line bundle on $X$. For $k \geq 0$, it is in general difficult to determine whether $L^{\otimes k}$ is very ample and whether it additionally gives a projectively…

In this paper we prove that if $\phi:\C\to\C$ is a $K$-quasiconformal map, with $K>1$, and $E\subset \C$ is a compact set contained in a ball $B$, then $$\frac{\dot C_{\frac{2K}{2K+1},\frac{2K+1}{K+1}}(E)}{\diam(B)^{\frac2{K+1}}} \geq…

This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…