Related papers: On the recognition problem for virtually special c…
We give divisibility results for the (global) characteristic varieties of hypersurface complements expressed in terms of the local characteristic varieties at points along one of the irreducible components of the hypersurface. As an…
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…
We define an integer-valued invariant of special cube complexes called the genus, and prove that having genus one characterizes special cube complexes with abelian fundamental group. Using the genus, we obtain a new proof that the…
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher even degree) is globally convex. This solves a problem that has…
We classify two-qubit commuting Hamiltonians in terms of their computational complexity. Suppose one has a two-qubit commuting Hamiltonian H which one can apply to any pair of qubits, starting in a computational basis state. We prove a…
Fitting geometric models onto outlier contaminated data is provably intractable. Many computer vision systems rely on random sampling heuristics to solve robust fitting, which do not provide optimality guarantees and error bounds. It is…
For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…
In this article we prove in main Theorem A that any infinity type real hyperplane arrangement $\mathcal{H}_n^m$ (Definition 2.11) with the associated normal system $\mathcal{N}$ (Definitions [2.2,2.4] can be represented isomorphically…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
We show that there is no algorithm to decide whether or not a given 4-manifold is homeomorphic to the connected sum of 12 copies of S^2 \times S^2.
We show how a type of multi-Frobenius nonclassicality of a curve defined over a finite field $\mathbb{F}_q$ of characteristic $p$ reflects on the geometry of its strict dual curve. In particular, in such cases we may describe all the…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
The Hirzebruch-Milnor class is given by the difference between the homology Hirzebruch characteristic class and the virtual one. It is known that the Hirzebruch-Milnor class for a certain singular hypersurface can be calculated by using the…
In this note we prove an effective characterization of when two finite-degree covers of a connected, orientable surface of negative Euler characteristic are isomorphic in terms of which curves have simple elevations, weakening the…
A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…
For tensor decompositions such as HOSVD and ParaFac, the objective functions are nonconvex. This implies, theoretically, there exists a large number of local optimas: starting from different starting point, the iteratively improved solution…
We study an irreducible component H(X) of the Hilbert scheme Hilb^{2t+2}(X) of a smooth cubic hypersurface X containing two disjoint lines. For cubic threefolds, H(X) is always smooth, as shown in arXiv:2010.11622. We provide a second proof…
The success of deep neural networks in image classification and learning can be partly attributed to the features they extract from images. It is often speculated about the properties of a low-dimensional manifold that models extract and…
We consider a recently proposed generalisation of the abelian hidden subgroup problem: the shifted subset problem. The problem is to determine a subset S of some abelian group, given access to quantum states of the form |S+x>, for some…