Related papers: On the recognition problem for virtually special c…
The discreteness problem, that is, the problem of determining whether or not a given finitely generated group G of orientation preserving isometries of hyperbolic three-space is discrete as a subgroup of the whole isometry group of…
We discuss the isomorphism problem of projective schemes; given two projective schemes, can we algorithmically decide whether they are isomorphic? We give affirmative answers in the case of one-dimensional projective schemes, the case of…
A set of multipartite orthogonal product states is strongly nonlocal if it is locally irreducible in every bipartition. Most known constructions of strongly nonlocal orthogonal product set (OPS) are limited to tripartite systems, and they…
Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…
We prove that one cannot algorithmically decide whether a finitely presented $\mathbb{Z}$-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the…
This article is dedicated to the characterisation of the relative hyperbolicity of Haglund and Wise's special groups. More precise, we introduce a new combinatorial formalism to study (virtually) special groups, and we prove that, given a…
Given a real algebraic curve, embedded in projective space, we study the computational problem of deciding whether there exists a hyperplane meeting the curve in real points only. More generally, given any divisor on such a curve, we may…
In a previous article, a universal linear algebraic model was proposed for describing homogeneous conformal geometries, such as the spherical, Euclidean, hyperbolic, Minkowski, anti-de Sitter and Galilei planes. This formalism was…
In this paper, we present a deterministic algorithm to find a strong generic position for an algebraic space curve. We modify our existing algorithm for computing the topology of an algebraic space curve and analyze the bit complexity of…
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
We prove the existence of resolution of singularities for arbitrary (not necessarily reduced or irreducible) excellent two-dimensional schemes, via permissible blow-ups. The resolution is canonical, and functorial with respect to…
We prove that the characteristic foliation $F$ on a non-singular divisor $D$ in an irreducible projective hyperkaehler manifold $X$ cannot be algebraic, unless the leaves of $F$ are rational curves or $X$ is a surface. More generally, we…
We distinguish finitarily between algorithmic verifiability, and algorithmic computability, to show that Goedel's 'formally' unprovable, but 'numeral-wise' provable, arithmetical proposition [(Ax)R(x)] can be finitarily evidenced as:…
Fix a number field k. We prove that if there is an algorithm for deciding whether a smooth projective geometrically integral k-variety has a k-point, then there is an algorithm for deciding whether an arbitrary k-variety has a k-point and…
Given $\mathbb P^4_k$, with $k$ algebraically closed field of characteristic $p>0$, and $X\subset \mathbb P^4_k$ integral surface of degree $d$, let $Y=X\cap H$ be the general hyperplane section of $X$. We suppose that $h^0\mathscr…
We prove that, if X is a variety over an uncountable algebraically closed field k of characteristic zero, then any irreducible exceptional divisor E on a resolution of singularities of X which is not uniruled, belongs to the image of the…
For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…
We give a new, effective proof of the separability of cubically convex-cocompact subgroups of special groups. As a consequence, we show that if $G$ is a virtually compact special hyperbolic group, and $Q\leq G$ is a $K$-quasiconvex…
We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…
A subspace of a multipartite Hilbert space is completely entangled if it contains no product states. Such subspaces can be large with a known maximum size, S, approaching the full dimension of the system, D. We show that almost all…