Related papers: CAT(0) is an algorithmic property

We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…

Answering connectivity queries in real algebraic sets is a fundamental problem in effective real algebraic geometry that finds many applications in e.g. robotics where motion planning issues are topical. This computational problem is…

In this paper, we propose a subgradient algorithm with a non-asymptotic convergence guarantee to solve copositive programming problems. The subproblem to be solved at each iteration is a standard quadratic programming problem, which is…

In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such…

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…

Let K be a 2-dimensional finite flag complex. We study the CAT(0) dimension of the `Bestvina-Brady group', or `Artin kernel', Gamma_K. We show that Gamma_K has CAT(0) dimension 3 unless K admits a piecewise Euclidean metric of non-positive…

We prove that a smooth, complex plane curve $C$ of odd degree can be defined by a polynomial with real coefficients if and only if $C$ is isomorphic to its complex conjugate. Counterexamples are known for curves of even degree. More…

Satisfiability (SAT) is a central problem in computer science, and advances in SAT-solving algorithms have a far-reaching impact across many fields. Recent works have proposed quantum SAT solvers based on Grover's algorithm, a quantum…

Motivated by the question of whether braid groups are CAT(0), we investigate the CAT(0) behavior of fundamental groups of plane curve complements and certain universal families. If $C$ is the branch locus of a generic projection of a…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

On logarithmic paper some real algebraic curves look like smoothed broken lines. Moreover, the broken lines can be obtained as limits of those curves. The corresponding deformation can be viewed as a quantization, in which the broken line…

We provide a necessary and sufficient condition on a finite flag simplicial complex, L, for which there exists a unique CAT(0) cube complex whose vertex links are all isomorphic to L. We then find new examples of such CAT(0) cube complexes…

Guarded Kleene Algebra with Tests (GKAT for short) is an efficient fragment of Kleene Algebra with Tests, suitable for reasoning about simple imperative while-programs. Following earlier work by Das and Pous on Kleene Algebra, we study GKAT…

Quantum computers have long been expected to efficiently solve complex classical differential equations. Most digital, fault-tolerant approaches use Carleman linearization to map nonlinear systems to linear ones and then apply quantum…

Starting with the first-order singular Lagrangian, the canonical structures of the noncommutative quantum system on a submanifold embedded in the higher-dimensional Euclidean space are investigated with the projection operator method (POM)…

We present a quantum algorithm for sampling an edge on a path between two nodes s and t in an undirected graph given as an adjacency matrix, and show that this can be done in query complexity that is asymptotically the same, up to log…

In this paper, we deal with the problem of optimizing a black-box smooth function over a full-dimensional smooth convex set. We study sets of feasible curves that allow to properly characterize stationarity of a solution and possibly carry…

We will show that if a proper complete CAT(0) space X has a visual boundary homeomorphic to the join of two Cantor sets, and X admits a geometric group action by a group containing a subgroup isomorphic to Z^2, then its Tits boundary is the…

Three algorithms are presented that determine the existence of satisfying assignments for 3SAT Boolean satisfiability expressions. One algorithm is presented for determining an instance of a satisfying assignment, where such exists. The…

We describe a unified and computationally tractable framework for finding outliers in, and maximum-diversity subsets of, finite metric spaces of strict negative type. Examples of such spaces include finite subsets of Euclidean space and…