Related papers: CAT(0) is an algorithmic property

We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…

In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…

This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of…

We construct a family of finite 2-complexes whose universal covers are CAT(0) and have polynomial divergence of desired degree. This answers a question of Gersten, namely whether such CAT(0) complexes exist.

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

Given a finite CAT(0) cubical complex, we define a flag simplicial complex associated to it, called the crossing complex. We show that the crossing complex holds much of the combinatorial information of the original cubical complex: for…

We explore the geometry of nonpositively curved spaces with isolated flats, and its consequences for groups that act properly discontinuously, cocompactly, and isometrically on such spaces. We prove that the geometric boundary of the space…

We resurrect a standard construction of analytical mechanics dating from the last century. The technique allows one to pass from any dynamical system whose first order evolution equations are known, and whose bracket algebra is not…

Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…

Kleene Algebra with Tests (KAT) provides an elegant algebraic framework for describing non-deterministic finite-state computations. Using a small finite set of non-deterministic programming constructs (sequencing, non-deterministic choice,…

We present six Theorems on the univariate real Polynomial, using which we develop a new algorithm for deciding the existence of atleast one real root for univariate integer Polynomials. Our algorithm outputs that no positive real root…

In this paper we study the complexity of quantum query algorithms computing the value of Boolean function and its relation to the degree of algebraic polynomial representing this function. We pay special attention to Boolean functions with…

The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponential complexity, different exploration-guided adaptations…

We characterize the canonical algebras such that for all dimension vectors of homogeneous modules the corresponding module varieties are complete intersections (respectively, normal). We also investigate the sets of common zeros of…

A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…

Kleene algebra with tests (KAT) is an equational system for program verification, which is the combination of Boolean algebra (BA) and Kleene algebra (KA), the algebra of regular expressions. In particular, KAT subsumes the propositional…

We present several families of total boolean functions which have exact quantum query complexity which is a constant multiple (between 1/2 and 2/3) of their classical query complexity, and show that optimal quantum algorithms for these…

This paper studies the important problem of quantum classification of Boolean functions from a entirely novel perspective. Typically, quantum classification algorithms allow us to classify functions with a probability of $1.0$, if we are…

We study asymptotic topological regularity of CAT(0) spaces. We prove that if a purely n-dimensional, proper, geodesically complete CAT(0) space has small volume growth, then it is homeomorphic to the n-dimensional Euclidean space. We also…

We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…