Related papers: VEST is W[2]-hard

Let k be a perfect field of characteristic p and let $W_n(k)$ denote the p-typical Witt vectors of length n. For example, $W_n(\mathbb{F}_p)=\mathbb{Z}/p^n$. We study the algebraic K-theory of $W_n(k)$, and prove that $K(W_n(k))$ satisfies…

We consider the Navier-Stokes equations in $\mathbb R^d$ ($d=2,3$) with a stochastic forcing term which is white noise in time and coloured in space; the spatial covariance of the noise is not too regular, so It\^o calculus cannot be…

$\newcommand{\eps}{\varepsilon}\newcommand{\tldO}{\widetilde{O}}$Consider the problem of constructing weak $\eps$-nets where the stabbing elements are lines or $k$-flats instead of points. We study this problem in the simplest setting where…

We consider the problem of counting, in a given graph, the number of induced k-vertex subgraphs which have an even number of edges, and also the complementary problem of counting the k-vertex induced subgraphs having an odd number of edges.…

A set $S\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\geq 1$, if $G$ has a dominating set of size…

Let k>n be positive integers. We consider mappings from a subset of k-dimensional Euclidean space R^k to the Heisenberg group H^n with a variety of metric properties, each of which imply that the mapping in question satisfies some weak form…

In a representative democracy, the electoral process involves partitioning geographical space into districts which each elect a single representative. These representatives craft and vote on legislation, incentivizing political parties to…

We give a necessary and sufficient condition for that the support $\tau$-tilting poset of a finite dimensional algebra is isomorphic to the poset of symmetric group with weak order. Moreover we show that there are infinitely many finite…

In this paper, we settle the randomized $k$-sever conjecture for the following metric spaces: line, circle, Hierarchically well-separated tree (HST). Specially, we show that there are $O(\log k)$-competitive randomized $k$-sever algorithms…

In the discrete Tempotron learning problem a neuron receives time varying inputs and for a set of such input sequences ($\mathcal S_-$ set) the neuron must be sub-threshold for all times while for some other sequences ($\mathcal S_+$ set)…

We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…

We consider the well-studied Robust $(k, z)$-Clustering problem, which generalizes the classic $k$-Median, $k$-Means, and $k$-Center problems. Given a constant $z\ge 1$, the input to Robust $(k, z)$-Clustering is a set $P$ of $n$ weighted…

A balanced partition is a clustering of a graph into a given number of equal-sized parts. For instance, the Bisection problem asks to remove at most k edges in order to partition the vertices into two equal-sized parts. We prove that…

The rigidity theorem for homotopy invariant presheaves with Witt-transfers on the category of smooth affine varieties over a field $k$ with characteristic not equal to 2 is proved. Namely for such a presheaf $\mathcal F$ the isomorphism…

We introduce the van der Waerden complex ${\rm vdW}(n,k)$ defined as the simplicial complex whose facets correspond to arithmetic progressions of length $k$ in the vertex set $\{1, 2, \ldots, n\}$. We show the van der Waerden complex ${\rm…

The $(k, z)$-Clustering problem in Euclidean space $\mathbb{R}^d$ has been extensively studied. Given the scale of data involved, compression methods for the Euclidean $(k, z)$-Clustering problem, such as data compression and dimension…

Vertex deletion problems for graphs are studied intensely in classical and parameterized complexity theory. They ask whether we can delete at most k vertices from an input graph such that the resulting graph has a certain property.…

We consider the problem of finding a subcomplex K' of a simplicial complex K such that K' is homeomorphic to the 2-dimensional sphere, S^2. We study two variants of this problem. The first asks if there exists such a K' with at most k…

Given a random $n \times n$ symmetric matrix $\boldsymbol W$ drawn from the Gaussian orthogonal ensemble (GOE), we consider the problem of certifying an upper bound on the maximum value of the quadratic form $\boldsymbol x^\top \boldsymbol…

We study the higher (sequential) topological complexity, a numerical homotopy invariant for the planar polygon spaces. For these spaces with a small genetic codes and dimension $m$, Davis showed that their topological complexity is either…