相关论文: Combinatorial complexity in o-minimal geometry

A note connecting arguments scattered in the extant literature proving that, in any o-minimal expansion of the real field, a definable family of sets has the property that the set of parameters corresponding to finite-volume fibers is…

We study definably complete locally o-minimal expansions of ordered groups in this paper. A definable continuous function defined on a closed, bounded and definable set behave like a continuous function on a compact set. We demonstrate…

We present a diagram surveying equivalence or strict implication for properties of different nature (algebraic, model theoretic, topological, etc.) about groups definable in o-minimal structures. All results are well-known and an extensive…

We define a discrete closure operation for definably complete locally o-minimal structures $\mathcal M$. The pair of the underlying set of $\mathcal M$ and the discrete closure operation forms a pregeometry. We define the rank of a…

We are concerned with topology of Hensel minimal structures on non-trivially valued fields $K$, whose axiomatic theory was introduced in a recent paper by Cluckers-Halupczok-Rideau. We additionally require that every definable subset in the…

Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…

We show that most arithmetic circuit lower bounds and relations between lower bounds naturally fit into the representation-theoretic framework suggested by geometric complexity theory (GCT), including: the partial derivatives technique…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…

This article explains and extends semialgebraic homotopy theory (developed by H. Delfs and M. Knebusch) to o-minimal homotopy theory (over a field). The homotopy category of definable CW-complexes is equivalent to the homotopy category of…

In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…

Many graph problems were first shown to be fixed-parameter tractable using the results of Robertson and Seymour on graph minors. We show that the combination of finite, computable, obstruction sets and efficient order tests is not just one…

The first papers on o-minimal structures appeared in the mid 1980s, since then the subject has grown into a wide ranging generalisation of semialgebraic, subanalytic and subpfaffian geometry. In these notes we try to show that this is in…

Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.

The o-minimal structure generated by the restricted Pfaffian functions, known as restricted sub-Pfaffian sets, admits a natural measure of complexity in terms of a format $\mathcal{F}$, recording information like the number of variables and…

We develop a general ring theory in the o-minimal setting culminating in a description of all the definable rings in an arbitrary o-minimal structure. We show that every definably connected ring with non-trivial multiplication defines an…

We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…

We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Ne\v{s}et\v{r}il-R\"{o}dl Theorem, the author's Ramsey lift of bowtie-free graphs as well…