Research

Bounding Betti Numbers of Sets Definable in O-Minimal Structures Over the Reals


Reference:

Clutha, M., 2011. Bounding Betti Numbers of Sets Definable in O-Minimal Structures Over the Reals. Thesis (Doctor of Philosophy (PhD)). University of Bath.

Related documents:

[img]
Preview
PDF (Thesis) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (7MB) | Preview

    Abstract

    A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete measures such as the degree of polynomials, and complexity of Pfaffian functions. A generalisation of the Thom-Milnor Bound [17, 19] for sets defined by the conjunction of equations and non-strict inequalities is presented, in the new context of sets definable in o-minimal structures using the axiomatic complexity measure. Next bounds are produced for sets defined by Boolean combinations of equations and inequalities, through firstly considering sets defined by sign conditions, then using this to produce results for closed sets, and then making use of a construction to approximate any set defined by a Boolean combination of equations and inequalities by a closed set. Lastly, existing results [12] for sets defined using quantifiers on an open or closed set are generalised, using a construction from Gabrielov and Vorobjov [11] to approximate any set by a compact set. This results in a method to find a general bound for any set definable in an o-minimal structure in terms of the axiomatic complexity measure. As a consequence for the first time an upper bound for sub-Pfaffian sets defined by arbitrary formulae with quantifiers is given. This bound is singly exponential if the number of quantifier alternations is fixed.

    Details

    Item Type Thesis (Doctor of Philosophy (PhD))
    CreatorsClutha, M.
    Uncontrolled Keywordsalgebraic topology, o-minimal structures, betti numbers, complexity, thom-milnor bound
    DepartmentsFaculty of Science > Computer Science
    Publisher StatementUnivBath_PhD_2011_M_Clutha.pdf: © The Author
    StatusPublished
    ID Code30510

    Export

    Actions (login required)

    View Item

    Document Downloads

    More statistics for this item...