Related papers: VEST is W[2]-hard

We prove the rigidity of Witten-Reshetikhin-Turaev $\mathrm{SU}(2)$ and $\mathrm{SO}(3)$ quantum representations of mapping class groups at all prime levels for closed surfaces of genus at least $7$. The proof relies on Ocneanu rigidity of…

The orthogonality dimension of a graph $G$ over $\mathbb{R}$ is the smallest integer $k$ for which one can assign a nonzero $k$-dimensional real vector to each vertex of $G$, such that every two adjacent vertices receive orthogonal vectors.…

The well-posedness of Cauchy problem of 3D compressible Euler equations is studied. By using Smith-Tataru's approach \cite{ST}, we prove the local existence, uniqueness and stability of solutions for Cauchy problem of 3D compressible Euler…

For any $\varepsilon > 0$, we prove that $k$-Dimensional Matching is hard to approximate within a factor of $k/(12 + \varepsilon)$ for large $k$ unless $\textsf{NP} \subseteq \textsf{BPP}$. Listed in Karp's 21 $\textsf{NP}$-complete…

In the Geometric Median problem with outliers, we are given a finite set of points in d-dimensional real space and an integer m, the goal is to locate a new point in space (center) and choose m of the input points to minimize the sum of the…

The problem of maximizing the $p$-th power of a $p$-norm over a halfspace-presented polytope in $\R^d$ is a convex maximization problem which plays a fundamental role in computational convexity. It has been shown in 1986 that this problem…

In this paper, we give a new class of rigid Coxeter groups. Let $(W,S)$ be a Coxeter system. Suppose that (0) for each $s,t\in S$ such that $m(s,t)$ is even, $m(s,t)=2$, (1) for each $s\neq t\in S$ such that $m(s,t)$ is odd, $\{s,t\}$ is a…

The values of the Witten invariants, $I_W$, of the lens space $L(p, 1)$ for SU(2) at level $k$ are obtained for arbitrary $p$. A duality relation for $I_W$ when $p$ and $k$ are interchanged, valid for asymptotic $k$, is observed. A method…

We prove that determining the weak saturation number of a host graph $F$ with respect to a pattern graph $H$ is already a computationally hard problem when $H$ is the triangle. As our main tool we establish a connection between weak…

In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The $k$-PATS problem is that of designing a tile assembly system with the…

It is proved that, under certain restrictions on weights, a pair of weighted Hardy spaces on the two-dimensional torus is K-closed in the pair of the corresponding weighted Lebesgue spaces. By now, K-closedness of Hardy spaces on the…

A fundamental question for simplicial complexes is to find the lowest dimensional Euclidean space in which they can be embedded. We investigate this question for order complexes of posets. We show that order complexes of thick geometric…

We show that for every fixed $k\geq 3$, the problem whether the termination/counter complexity of a given demonic VASS is $\mathcal{O}(n^k)$, $\Omega(n^{k})$, and $\Theta(n^{k})$ is coNP-complete, NP-complete, and DP-complete, respectively.…

In the Determinant Maximization problem, given an $n\times n$ positive semi-definite matrix $\bf{A}$ in $\mathbb{Q}^{n\times n}$ and an integer $k$, we are required to find a $k\times k$ principal submatrix of $\bf{A}$ having the maximum…

Motivated by Kloeckner's result on the isometry group of the quadratic Wasserstein space $\mathcal{W}_2\left(\mathbb{R}^n\right)$, we describe the isometry group $\mathrm{Isom}\left(\mathcal{W}_p (E)\right)$ for all parameters $0 < p <…

Let $G$ be a graph on $n$ vertices and $\mathrm{STAB}_k(G)$ be the convex hull of characteristic vectors of its independent sets of size at most $k$. We study extension complexity of $\mathrm{STAB}_k(G)$ with respect to a fixed parameter…

Given a metric space X, one defines its Wasserstein space W2(X) as a set of sufficiently decaying probability measures on X endowed with a metric defined from optimal transportation. In this article, we continue the geometric study of W2(X)…

Capacitated Vertex Cover is the hard-capacitated variant of Vertex Cover: given a graph, a capacity for every vertex, and an integer $k$, the task is to select at most $k$ vertices that cover all edges and assign each edge to one of its…

The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if…

Let K be a non-trivial knot in the 3-sphere and let Y be the 3-manifold obtained by surgery on K with surgery-coefficient 1. Using tools from gauge theory and symplectic topology, it is shown that the fundamental group of Y admits a…