Related papers: CAT(0) is an algorithmic property
We describe an algorithm to compute the geodesics in an arbitrary CAT(0) cubical complex. A key tool is a correspondence between cubical complexes of global non-positive curvature and posets with inconsistent pairs. This correspondence also…
Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…
The orthoscheme complex of a graded poset is a metrization of its order complex such that the simplex of each maximal chain is isometric to the Euclidean simplex of vertices $0, e_1,e_1+e_2,\ldots, e_1+e_2+ \cdots + e_n$. This notion was…
We show that under certain mild conditions, a metric simplicial complex which satisfies the Ptolemy inequality is a CAT(0) space. Ptolemy's inequality is closely related to inversions of metric spaces. For a large class of metric simplicial…
Exact solution to many problems in mathematical physics and quantum field theory often can be expressed in terms of an algebraic curve equipped with a meromorphic differential. Typically, the geometry of the curve can be seen most clearly…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
This article makes the key observation that when using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is not always the signs of those polynomials that are of paramount importance but…
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$…
This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…
This paper presents the first polynomial time algorithm to compute geodesics in a CAT(0) cubical complex in general dimension. The algorithm is a simple iterative method to update breakpoints of a path joining two points using Miller, Owen…
Globally non-positively curved, or CAT(0), polyhedral complexes arise in a number of applications, including evolutionary biology and robotics. These spaces have unique shortest paths and are composed of Euclidean polyhedra, yet many…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact,…
Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…
In this paper we demonstrate how the geometrically motivated algorithm to determine whether a two generator real Mobius group acting on the Poincare plane is or is not discrete can be interpreted as a non-Euclidean Euclidean algorithm. That…
Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…
We show that an automorphism of an arbitrary CAT(0) cube complex either has a fixed point or preserves some combinatorial axis. It follows that when a group contains a distorted cyclic subgroup, it admits no proper action on a discrete…
A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…
Given a CAT(0) cube complex X, we show that if Aut(X) $\neq$ Isom(X) then there exists a full subcomplex of X which decomposes as a product with $\mathbb{R}^n$. As applications, we prove that if X is $\delta$-hyperbolic, cocompact and…
We prove the arborescence of any locally finite complex that is $CAT(0)$ with a polyhedral metric for which all vertex stars are convex. In particular locally finite $CAT(0)$ cube complexes or equilateral simplicial complexes are…