Related papers: On the recognition problem for virtually special c…
Given an elliptic curve E over a field of positive characteristic p, we consider how to efficiently determine whether E is ordinary or supersingular. We analyze the complexity of several existing algorithms and then present a new approach…
We characterize those regular, holomorphic or formal maps into the orbit space $V/G$ of a complex representation of a finite group $G$ which admit a regular, holomorphic or formal lift to the representation space $V$. In particular, the…
We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…
We classify the Lie algebras of infinitesimal CR automorphisms of weakly pseudoconvex hypersurfaces of finite multitype in $\mathbb C^N$. In particular, we prove that such manifolds admit neither nonlinear rigid automorphisms, nor real or…
Tashiro and Tachibana proved that there exist no totally umbilical hypersurfaces in complex space forms with nonzero constant holomorphic sectional curvature, and it is also known that the shape operator of such hypersurfaces cannot be…
For several instances of metric largeness like enlargeability or having hyperspherical universal covers, we construct non-large vector subspaces in the rational homology of finitely generated groups. The functorial properties of this…
We give an algorithm that decides whether a single equation in a group that is virtually a class $2$ nilpotent group with a virtually cyclic commutator subgroup, such as the Heisenberg group, admits a solution. This generalises the work of…
We consider the following classification problem: Given a population of individuals characterized by a set of attributes represented as a vector in ${\mathbb R}^N$, the goal is to find a hyperplane in ${\mathbb R}^N$ that separates two sets…
We show that there is no subexponential time algorithm for computing the exact solution of the maximum independent set problem in d-regular graphs unless ETH fails. We expand our method to show that it helps to provide lower bounds for…
Let $X$ and $Y$ be finite simplicial sets (e.g. finite simplicial complexes), both equipped with a free simplicial action of a finite group $G$. Assuming that $Y$ is $d$-connected and $\dim X\le 2d$, for some $d\geq 1$, we provide an…
Using the theory of resolving classes, we show that if $X$ is a CW complex of finite type such that $\map_*(X, S^{2n+1})\sim *$ for all sufficiently large $n$, then $\map_*(X, K) \sim *$ for every simply-connected finite-dimensional CW…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
We focus on the non-locality concerning local copying and local discrimination, especially for a set of orthogonal maximally entangled states in prime dimensional systems, as a study of non-locality of a set of states. As a result, for such…
It is proved that on a smooth algebraic variety, fibered into cubic surfaces over the projective line and sufficiently ``twisted'' over the base, there is only one pencil of rational surfaces -- that is, this very pencil of cubics. In…
The paper presents an algorithm for topological classification of nondegenerate saddle-focus singularities of integrable Hamiltonian systems with three degrees of freedom up to semi-local equivalence. In particular, we prove that any…
The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. In this work, we propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in…
We prove that there exist hypersurfaces that contain a given closed subscheme $Z$ of the projective space over a finite field and intersect a given smooth scheme $X$ off of $Z$ smoothly, if the intersection $V = Z \cap X$ is smooth.…
Community detection in graphs is a problem that is likely to be relevant whenever network data appears, and consequently the problem has received much attention with many different methods and algorithms applied. However, many of these…
We study decision problems on geometric tilings. First, we study a variant of the Domino problem where square tiles are replaced by geometric tiles of arbitrary shape. We show that this variant is undecidable regardless of the shapes,…
While today's robots are able to perform sophisticated tasks, they can only act on objects they have been trained to recognize. This is a severe limitation: any robot will inevitably see new objects in unconstrained settings, and thus will…