An Adaptive Grid Algorithm for Computing the Homology Group of Semialgebraic Set

03/04/2019
by   Han Jiadong, et al.
0

Looking for an efficient algorithm for the computation of the homology groups of an algebraic set or even a semi-algebraic set is an important problem in the effective real algebraic geometry. Recently, Peter Burgisser, Felipe Cucker and Pierre Lairez wrote a paper [1], which made a step forward by giving an algorithm of weak exponential time. However, the algorithm is not not practical. In my thesis, I will introduce my improvement of this algorithm using an adaptive grid algorithm on the unit sphere.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/11/2020

Smooth Points on Semi-algebraic Sets

Many algorithms for determining properties of real algebraic or semi-alg...
research
09/18/2018

Degree bound for toric envelope of a linear algebraic group

Algorithms working with linear algebraic groups often represent them via...
research
12/06/2022

Improved Algebraic Degeneracy Testing

In the classical linear degeneracy testing problem, we are given n real ...
research
03/12/2020

Algorithms in Linear Algebraic Groups

This paper presents some algorithms in linear algebraic groups. These al...
research
12/26/2018

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications

Guth showed that given a family S of n g-dimensional semi-algebraic sets...
research
06/22/2017

Computing the homology of basic semialgebraic sets in weak exponential time

We describe and analyze an algorithm for computing the homology (Betti n...
research
05/02/2019

Learning Algebraic Structures: Preliminary Investigations

We employ techniques of machine-learning, exemplified by support vector ...

Please sign up or login with your details

Forgot password? Click here to reset