Related papers: VEST is W[2]-hard

For each two-dimensional vector space $V$ of commuting $n\times n$ matrices over a field $\mathbb F$ with at least 3 elements, we denote by $\widetilde V$ the vector space of all $(n+1)\times(n+1)$ matrices of the form…

We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

The Geometric Bin Packing (GBP) problem is a generalization of Bin Packing where the input is a set of $d$-dimensional rectangles, and the goal is to pack them into unit $d$-dimensional cubes efficiently. It is NP-Hard to obtain a PTAS for…

$\newcommand{\eps}{\varepsilon} $We prove that for any $\eps > 0$ it is $\textsf{NP}$-hard to approximate the non-commutative Grothendieck problem to within a factor $1/2 + \eps$, which matches the approximation ratio of the algorithm of…

In the Disjoint Paths problem, one is given a graph with a set of $k$ vertex pairs $(s_i,t_i)$ and the task is to connect each $s_i$ to $t_i$ with a path, so that the $k$ paths are pairwise disjoint. In the optimization variant, Max…

We study the parameterized complexity of winner determination problems for three prevalent $k$-committee selection rules, namely the minimax approval voting (MAV), the proportional approval voting (PAV), and the Chamberlin-Courant's…

Given a metric space $(V, d)$ along with an integer $k$, the $k$-Median problem asks to open $k$ centers $C \subseteq V$ to minimize $\sum_{v \in V} d(v, C)$, where $d(v, C) := \min_{c \in C} d(v, c)$. While the best-known approximation…

The homotopy group $\pi_{n-k} ({\bf C}^{n+1}-V)$ where $V$ is a hypersurface with a singular locus of dimension $k$ and good behavior at infinity is described using generic pencils. This is analogous to the van Kampen procedure for finding…

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

Take n>k>1 such that n-k is odd. In this paper we consider mapping a from (n-k+1)-dimensional closed ball into the space of (n \times k)--matrices such that its restriction to a sphere goes into the Stiefel manifold V_k(R^n). We construct a…

Let $D$ be the set of $n\times n$ positive semidefinite matrices of trace equal to one, also known as the set of density matrices. We prove two results on the hardness of approximating $D$ with polytopes. First, we show that if $0 <…

Our first focus is the Capacitated Partition Vertex Cover (C-PVC) problem in hypergraphs. In C-PVC, we are given a hypergraph with capacities on its vertices and a partition of the hyperedge set into $\omega$ distinct groups. The objective…

Treewidth is a useful tool in designing graph algorithms. Although many NP-hard graph problems can be solved in linear time when the input graphs have small treewidth, there are problems which remain hard on graphs of bounded treewidth. In…

Let E(n) and T(m) for nonnegative integers n and m denote the Johnson-Wilson and the Ravenel spectra, respectively. Given a spectrum whose E(n)_*-homology is E(n)_*(T(m))/(v_1,...,v_{n-1}), then each homotopy group of it estimates the order…

In the weighted partial vertex cover problem (WPVC), we are given a graph $G=(V,E)$, cost function $c:V\rightarrow N$, profit function $p:E\rightarrow N$, and positive integers $R$ and $L$. The goal is to check whether there is a subset…

The solvability in $W^{2}_{p}(\bR^{d})$ spaces is proved for second-order elliptic equations with coefficients which are measurable in one direction and VMO in the orthogonal directions in each small ball with the direction depending on the…

We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak-near-unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is…

We prove that level $5$ Witten-Reshetikhin-Turaev $\mathrm{SO}(3)$ quantum representations, also known as the Fibonacci representations, of mapping class groups are locally rigid. More generally, for any prime level $\ell$, we prove that…

Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…