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

Combinatorial optimization can be described as the problem of finding a feasible subset that maximizes a objective function. The paper discusses combinatorial optimization problems, where for each dimension the set of feasible subsets is…

These notes focus on the Lipschitz geometry of sets that are definable in o-minimal structures (expanding the real field). We show that every set which is definable in a polynomially bounded o-minimal structure admits a stratification which…

We determine the topological complexity of unordered configuration spaces on almost all punctured surfaces (both orientable and non-orientable). We also give improved bounds for the topological complexity of unordered configuration spaces…

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…

We extend the theory of complex cells introduced by Binyamini and Novikov to the sharply o-minimal setting, obtaining cellular preparation and parameterization theorems which are polynomially effective in the degrees of the relevant sets.…

We work over an o-minimal expansion of a real closed field. The o-minimal homotopy groups of a definable set are defined naturally using definable continuous maps. We prove that any two semialgebraic maps which are definably homotopic are…

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

In this paper we study a very general finite Ramsey theorem, where both the sets being colored and the homogeneous set must satisfy some largeness notion. For the homogeneous set this has already been done using the notion of…

Effective field theories consistent with quantum gravity obey surprising finiteness constraints, appearing in several distinct but interconnected forms. In this work we develop a framework that unifies these observations by proposing that…

We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…

Let ${\mathbb M}$ be an arbitrary o-minimal structure. Let $G$ be a definably compact definably connected abelian definable group of dimension $n$. Here we compute the new the intrinsic o-minimal fundamental group of $G;$ for each $k>0$,…

Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…

We establish the first global results for groups definable in tame expansions of o-minimal structures. Let $\mathcal N$ be an expansion of an o-minimal structure $\mathcal M$ that admits a good dimension theory. The setting includes dense…

A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…

Dense pairs of geometric topological fields have tame open core, that is, every definable open subset in the pair is already definable in the reduct. We fix a minor gap in the published version of van den Dries's seminal work on dense pairs…

Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…

We consider definably complete and Baire expansions of ordered fields: every definable subset of the domain of the structure has a supremum and the domain can not be written as the union of a definable increasing family of nowhere dense…

Gabrielov introduced the notion of relative closure of a Pfaffian couple as an alternative construction of the o-minimal structure generated by Khovanskii's Pfaffian functions. In this paper, use the notion of format (or complexity) of a…

We prove that the number of distinct homotopy types of limits of one-parameter semi-algebraic families of closed and bounded semi-algebraic sets is bounded singly exponentially in the additive complexity of any quantifier-free first order…