Related papers: Fortifying the Yomdin-Gromov Algebraic Lemma
In 1987, Yomdin proved a lemma on smooth parametrizations of semialgebraic sets as part of his solution of Shub's entropy conjecture for $C^\infty$ maps. The statement was further refined by Gromov, producing what is now known as the…
We introduce the notion of a complex cell, a complexification of the cells/cylinders used in real tame geometry. For $\delta\in(0,1)$ and a complex cell $\mathcal{C}$ we define its holomorphic extension…
We describe a class of sharply o-minimal structures, called analytically generated structures, whose definable sets and their complexity filtration are determined by the collection of definable complex cells. We prove a polynomially…
The paper concerns uniform Yomdin-Gromov parametrizations together with an estimate of their number, which generalizes a theorem by Cluckers-Forey-Loeser to arbitrary equicharacteristic zero valued fields with analytic structure. To this…
Sharply o-minimal structures (denoted \so-minimal) are a strict subclass of the o-minimal structures, aimed at capturing some finer features of structures arising from algebraic geometry and Hodge theory. Sharp o-minimality associates to…
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.…
Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…
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 notion of cell decomposition suitable for studying weak p- adic structures (reducts of p-adic fields where addition and multiplication are not (everywhere) definable). As an example, we apply this to a language with restricted…
Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…
We study a reduct L\ast of the ring language where multiplication is restricted to a neighbourhood of zero. The language is chosen such that for p-adically closed fields K, the L\ast-definable subsets of K coincide with the semi-algebraic…
We show that a strong well-based cylindrical algebraic decomposition P of a bounded semi-algebraic set is a regular cell decomposition, in any dimension and independently of the method by which P is constructed. Being well-based is a global…
In arXiv:1303.3724, the authors provide an axiomatic way of constructing new polynomially bounded o-minimal structures. However, all of the structures satisfying these axioms must also have smooth cell-decomposition. In this paper, we…
After introducing some motivations for this survey, we describe a formalism to parametrize a wide class of algebraic structures occurring naturally in various problems of topology, geometry and mathematical physics. This allows us to define…
A Cylindrical Algebraic Decomposition (CAD) is a decomposition of R^n into a finite collection of semialgebraic cells. A CAD satisfies the "frontier condition" if, for every cell C, there is a collection of cells of the decomposition whose…
We investigate a model-theoretic property that generalizes the classical notion of "preservation under substructures". We call this property \emph{preservation under substructures modulo bounded cores}, and present a syntactic…
Motivated by applications in moduli theory, we introduce a flexible and powerful language for expressing lower bounds on relative dimension of morphisms of schemes, and more generally of algebraic stacks. We show that the theory is robust…
We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…
This is an overview of higher structural constructions in physics. The main motivations of our current attempt are as follows: (i) to provide a brief introduction to derived algebraic geometry, (ii) to understand how derived objects…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…