中文
相关论文

相关论文: CAT(0) is an algorithmic property

200 篇论文

This paper is a survey dedicated to the following question: given a group acting on some CAT(0) cube complex, how to exploit this action to determine whether or not the group is Gromov / relatively / acylindrically hyperbolic? As much as…

群论 · 数学 2019-04-29 Anthony Genevois

Decomposing an algebraic variety into irreducible or equidimensional components is a fundamental task in classical algebraic geometry and has various applications in modern geometry engineering. Several researchers studied the problem and…

交换代数 · 数学 2010-12-07 Zhenyi Ji , Yongbin Li

This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…

计算几何 · 计算机科学 2009-12-21 Gun Srijuntongsiri , Stephen A. Vavasis

We investigate Farley's CAT(0) cubical model for Thompson's group F (we adopt the classical language of F, using binary trees and piecewise linear maps). Main results include: in general, Thompson's group elements are parabolic; we find…

群论 · 数学 2012-03-27 Dan-Titus Salajan

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…

量子物理 · 物理学 2009-11-10 L. M. Ioannou , B. C. Travaglione , D. Cheung , A. K. Ekert

The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity…

量子物理 · 物理学 2020-12-14 Zekun Ye , Lvzhou Li

We introduce a $\mathbb{Z}$-valued cross ratio on Roller boundaries of ${\rm CAT(0)}$ cube complexes. We motivate its relevance by showing that every cross-ratio preserving bijection of Roller boundaries uniquely extends to a cubical…

几何拓扑 · 数学 2022-01-28 Jonas Beyrer , Elia Fioravanti , Merlin Incerti-Medici

The zero set of a real polynomial in two variable is a curve in $\mathbb R^2$. For a generic choice of its coefficients this is a non-singular curve, a collection of circles and lines properly embedded in $\mathbb R^2$. What topological…

代数几何 · 数学 2008-02-03 G. Mikhalkin

A complex elliptic curve $E$ can be defined as the quotient of the analytic space $\mathbb{C}^*$ by a discrete action of the cyclic group $q^{\mathbb{Z}}$ for $\vert q\vert \neq 1$. We study the boundary case when $\vert q\vert =1$, which…

代数几何 · 数学 2025-12-09 Michael J. Larsen , Valery Lunts

A simplicial complex is called negatively curved if all its simplices are isometric to simplices in hyperbolic space, and it satisfies Gromov's Link Condition. We prove that, subject to certain conditions, a compact graph of spaces whose…

群论 · 数学 2017-05-17 Samuel Brown

We characterise piecewise Boolean domains, that is, those domains that arise as Boolean subalgebras of a piecewise Boolean algebra. This leads to equivalent descriptions of the category of piecewise Boolean algebras: either as piecewise…

计算机科学中的逻辑 · 计算机科学 2014-07-15 Chris Heunen

Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…

最优化与控制 · 数学 2008-01-24 Didier Henrion

In the context of product-line engineering and feature models, atomic sets are sets of features that must always be selected together in order for a configuration to be valid. For many analyses and applications, these features may be…

数据结构与算法 · 计算机科学 2025-01-23 Tobias Heß , Aaron Molt

Polynomial quantified entailments with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyQEnt which is a tool for solving polynomial quantified entailments in…

For arbitrary undirected graph $G$, we are designing SATISFIABILITY problem (SAT) for HCP, using tools of Boolean algebra only. The obtained SAT be the logic formulation of conditions for Hamiltonian cycle existence, and use $m$ Boolean…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Anatoly D. Plotnikov

This paper investigates the geometry of a smooth canonically polarized surface $X$ defined over an algebraically closed field of characteristic $p>0$ in the case when the automorphism scheme of $X$ is not smooth. This is a situation that…

代数几何 · 数学 2015-07-01 Nikolaos Tziolas

An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve.…

交换代数 · 数学 2008-12-18 Daouda Niang Diatta , Bernard Mourrain , Olivier Ruatta

A sequence $a_0<a_1<\ldots<a_n$ of nonnegative integers is called a Sidon sequence if the sums of pairs $a_i+a_j$ are all different. In this paper we construct CAT(0) groups and spaces from Sidon sequences. The arithmetic condition of Sidon…

群论 · 数学 2023-09-27 Sylvain Barré , Mikaël Pichot

We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed…

计算机科学中的逻辑 · 计算机科学 2014-08-20 Simone Bova , Robert Ganian , Stefan Szeider

A noncommutative algebra corresponding to the classical catenoid is introduced together with a differential calculus of derivations. We prove that there exists a unique metric and torsion-free connection that is compatible with the complex…

量子代数 · 数学 2018-02-14 Joakim Arnlind , Christoffer Holm