Related papers: Analytically generated sharply o-minimal structure…
In this paper, we show that some fundamental results for smooth mappings (e.g., the Brouwer degree formula, the implicit function and inverse function theorems, the mean value theorem, Sard's theorem, Hadamard's global invertibility…
We study $\mathbb{R}_{\textrm{an},\exp}$-definable functions $f:\mathbb{R}\to \mathbb{R}$ that take integer values at all sufficiently large positive integers. If $|f(x)|= O\big(2^{(1+10^{-5})x}\big)$, then we find polynomials $P_1, P_2$…
We present a new, far simpler family of counter-examples to Kushnirenko's Conjecture. Along the way, we illustrate a computer-assisted approach to finding sparse polynomial systems with maximally many real roots, thus shedding light on the…
We present a definable smooth version of the Thom transversality theorem. We show further that the set of non-transverse definable smooth maps is nowhere dense in the definable smooth topology. Finally, we prove a definable version of a…
Empirical properties of generating systems for complex reflection groups and their braid groups have been observed by Orlik-Solomon and Brou\'e-Malle-Rouquier, using Shephard-Todd classification. We give a general existence result for…
Michael Gromov has recently initiated what he calls ``symbolic algebraic geometry", in which objects are proalgebraic varieties: a proalgebraic variety is by definition the projective limit of a projective system of algebraic varieties. In…
This document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…
Given a finitely generated free monoid $X$ and a morphism $\phi : X\to X$, we show that one can construct an algebra, which we call an iterative algebra, in a natural way. We show that many ring theoretic properties of iterative algebras…
This survey paper was primarily written as as the support for a course pesented at the JNCF2025: it aims to present some material that illustrates the kind of estimates one can obtain in effective algebraic geometry, for affine polynomial…
$ \newcommand{\ie}{i.\,e.} $We introduce a hitting set generator for Polynomial Identity Testing based on evaluations of low-degree univariate rational functions at abscissas associated with the variables. We establish an equivalence up to…
We prove a new weak mean ergodic theorem (Theorem A) for 1-cocycles associated to weakly mixing representations of amenable groups. Let $G$ be a finitely generated, discrete, amenable group $G$ which admits a controlled Folner sequence. We…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
We construct finitely generated nil algebras with prescribed growth rate. In particular, any increasing submultiplicative function is realized as the growth function of a nil algebra up to a polynomial error term and an arbitrarily slow…
The outlines of a "Galois theory" for bimeromorphic geometry is here developed, via the study of model-theoretic definable binding groups in the theory CCM of compact complex spaces. As an application, a structure theorem about principal…
We show that the set of complex points in the moduli space of polynomials of degree d corresponding to post-critically finite polynomials is a set of algebraic points of bounded height. It follows that for any B, the set of conjugacy…
Quasianalytic classes are classes of infinitely differentiable functions that satisfy the analytic continuation property enjoyed by analytic functions. Two general examples are quasianalytic Denjoy-Carleman classes (of origin in the…
We give a new proof of Gromov's theorem that any finitely generated group of polynomial growth has a finite index nilpotent subgroup. Unlike the original proof, it does not rely on the Montgomery-Zippin-Yamabe structure theory of locally…
This expository paper gives an account of the Pila-Wilkie counting theorem and some of its extensions and generalizations. We use semialgebraic cell decomposition to simplify part of the original proof. We also include complete treatments…
In 1974 Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let data be finite binary strings and models be finite sets of binary strings. Consider model classes consisting of models of given maximal…
We study the predictability of emergent phenomena in complex systems. Using nearest neighbor, one-dimensional Cellular Automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's…