English
Related papers

Related papers: On the recognition problem for virtually special c…

200 papers

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…

Group Theory · Mathematics 2016-10-24 Jane Gilman , Linda Keen

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…

Algebraic Geometry · Mathematics 2024-02-27 Takehiko Yasuda

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…

Quantum Physics · Physics 2021-10-19 Fei Shi , Mao-Sheng Li , Mengyao Hu , Lin Chen , Man-Hong Yung , Yan-Ling Wang , Xiande Zhang

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$…

Computational Geometry · Computer Science 2015-05-26 Rémi Imbach , Guillaume Moroz , Marc Pouget

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…

Group Theory · Mathematics 2016-10-04 Bren Cavallo , Jordi Delgado , Delaram Kahrobaei , Enric Ventura

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…

Group Theory · Mathematics 2019-12-25 Anthony Genevois

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…

Algebraic Geometry · Mathematics 2021-06-29 Huu Phuoc Le , Dimitri Manevich , Daniel Plaumann

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…

Metric Geometry · Mathematics 2018-04-12 Mate Lehel Juhasz

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…

Symbolic Computation · Computer Science 2019-01-30 Kai Jin , Jin-San Cheng

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…

Computational Geometry · Computer Science 2020-08-27 Huu Phuoc Le , Mohab Safey El Din , Timo de Wolff

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…

Algebraic Geometry · Mathematics 2013-02-19 Vincent Cossart , Uwe Jannsen , Shuji Saito

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…

Algebraic Geometry · Mathematics 2016-04-18 Ekaterina Amerik , Frédéric Campana

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:…

Logic · Mathematics 2024-01-19 Bhupinder Singh Anand

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…

Number Theory · Mathematics 2017-04-03 Bjorn Poonen

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…

Algebraic Geometry · Mathematics 2011-09-09 Paola Bonacini

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…

Algebraic Geometry · Mathematics 2008-11-18 Monique Lejeune-Jalabert , Ana J. Reguera

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…

Logic · Mathematics 2019-06-07 Matthew Moore

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…

Group Theory · Mathematics 2016-08-03 Mark F. Hagen , Priyam Patel

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…

Logic · Mathematics 2019-03-14 Jennifer Chubb , Iva Bilanovic , Sam Roven

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…

Quantum Physics · Physics 2008-08-14 Jonathan Walgate , A. J. Scott