Definability in the structure of words with the inclusion relation

We develop a theory of (first-order) definability in the subword partial order in parallel with similar theories for the h-quasiorder of finite k-labeled forests and for the infix order. In particular, any element is definable (provided that the words of length 1 or 2 are taken as parameters), the first-order theory of the structure is atomic and computably isomorphic to the first-order arithmetic. We also characterize the automorphism group of the structure and show that every predicate invariant under the automorphisms of the structure is definable in the structure.     

Measurable groups of low dimension

We consider low‐dimensional groups and group‐actions that are definable in a supersimple theory of finite rank. We show that any rank 1 unimodular group is (finite‐by‐Abelian)‐by‐finite, and that any 2‐dimensional asymptotic group is soluble‐by‐finite. We obtain a field‐interpretation theorem for certain measurable groups, and give an analysis of minimal normal subgroups and socles in groups definable in a supersimple theory of finite rank where infinity is definable. We prove a primitivity theorem for measurable group actions. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Dirichlet regularity in arbitrary o‐minimal structures on the field ℝ up to dimension 4

In this article we show that the set of Dirichlet regular boundary points of a bounded domain of dimension up to 4, definable in an arbitrary o‐minimal structure on the field ?, is definable in the same structure. Moreover we give estimates for the dimension of the set of non‐regular boundary points, depending on whether the structure is polynomially bounded or not. This paper extends the results from the author's Ph.D. thesis [6, 7] where the problem was solved for polynomially bounded o‐minimal structures expanding the real field. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Expansions of ordered fields without definable gaps

In this paper we are concerned with definably, with or without parameters, (Dedekind) complete expansions of ordered fields, i. e. those with no definable gaps. We present several axiomatizations, like being definably connected, in each of the two cases. As a corollary, when parameters are allowed, expansions of ordered fields are o‐minimal if and only if all their definable subsets are finite disjoint unions of definably connected (definable) subsets. We pay attention to how simply (in terms of the quantifier complexity and/or usage of parameters) a definable gap in an expansion is so. Next we prove that over parametrically definably complete expansions of ordered fields, all one‐to‐one definable (with parameters) continuous functions are monotone and open. Moreover, in both parameter and parameter‐free cases again, definably complete expansions of ordered fields satisfy definable versions of the Heine‐Borel and Extreme Value theorems and also Bounded Intersection Property for definable families of closed bounded subsets.     

On the Euler characteristic of definable groups

We show that in an arbitrary o‐minimal structure the following are equivalent: (i) conjugates of a definable subgroup of a definably connected, definably compact definable group cover the group if the o‐minimal Euler characteristic of the quotient is non zero; (ii) every infinite, definably connected, definably compact definable group has a non trivial torsion point (© 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Smooth roots of hyperbolic polynomials with definable coefficients

We prove that the roots of a definable C ^∞ curve of monic hyperbolic polynomials admit a definable C ^∞ parameterization, where ‘definable’ refers to any fixed o-minimal structure on (ℝ,+, ·). Moreover, we provide sufficient conditions, in terms of the differentiability of the coefficients and the order of contact of the roots, for the existence of C ^p (for p ∈ ℕ) arrangements of the roots in both the definable and the non-definable case. These conditions are sharp in the definable and, under an additional assumption, also in the non-definable case. In particular, we obtain a simple proof of Bronshtein’s theorem in the definable setting. We prove that the roots of definable C ^∞ curves of complex polynomials can be desingularized by means of local power substitutions t ↦ ±t ^N . For a definable continuous curve of complex polynomials we show that any continuous choice of roots is actually locally absolutely continuous.     

Stochastic flows and the C0-diffusion property

An elementary argument is used to show that the Markov semigroup of a stochastic dynamical system which has a flow consisting of diffeomorphisms necessarily preserves the space of continuous functions vanishing at infinity. In the one dimensional case this is seen to be also a sufficient condition. As a corollary there is a result proved by Kunita under slightly stronger conditions on the coefficients: a non-degenerate system on R has a flow consisting of homeomorphisms if and only if both ± ∞ are natural boundaries.     

Simple monadic theories and partition width

We study tree‐like decompositions of models of a theory and a related complexity measure called partition width. We prove a dichotomy concerning partition width and definable pairing functions: either the partition width of models is bounded, or the theory admits definable pairing functions. Our proof rests on structure results concerning indiscernible sequences and finitely satisfiable types for theories without definable pairing functions. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Vanishing homology

In this paper, we introduce a new homology theory devoted to the study of families such as semialgebraic or subanalytic families, and in general, to any family definable in an o-minimal structure (such as Denjoy–Carleman definable, or ln-exp definable sets). The idea is to study the cycles that are vanishing when we approach a special fiber. This also enables us to derive local metric invariants for germs of definable sets. We prove that the homology groups are finitely generated.     

Definable functions continuous on curves in o-minimal structures

We give necessary and sufficient conditions on a non-oscillatory curve in an o-minimal field such that, for any bounded definable function, the germ of the function on an initial segment of the curve has a definable extension to a closed set. This situation is translated into a question about types: What are the conditions on an n-type such that, for any bounded definable function, the germ of the function on the type has a definable continuous global extension? Certain categories of definable types have this property, and we give the precise conditions that are equivalent to existence of the global extension.     

A fixed point theorem for o‐minimal structures

We prove a definable analogue to Brouwer's Fixed Point Theorem for o‐minimal structures of real closed field expansions: A continuous definable function mapping from the unit simplex into itself admits a fixed point, even though the underlying space is not necessarily topologically complete. Our proof is direct and elementary; it uses a triangulation technique for o‐minimal functions, with an application of Sperner's Lemma. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Groups,group actions and fields definable in first‐order topological structures

Given a group (G, ·), G?M^m, definable in a first‐order structure $\mathcal {M}=(M,\ldots )Given a group (G, ·), G?M^m, definable in a first‐order structure $\mathcal {M}=(M,\ldots )$ equipped with a dimension function and a topology satisfying certain natural conditions, we find a large open definable subset V?G and define a new topology τ on G with which (G, ·) becomes a topological group. Moreover, τ restricted to V coincides with the topology of V inherited from M^m. Likewise we topologize transitive group actions and fields definable in $\mathcal {M}$. These results require a series of preparatory facts concerning dimension functions, some of which might be of independent interest.     

On the Boolean algebras of definable sets in weakly o‐minimal theories

We consider the sets definable in the countable models of a weakly o‐minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence T is p‐ω‐categorical), in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete (convex) subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o‐minimal theory is p‐ω‐categorical. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Minimality conditions on circularly ordered structures

We explore analogues of o‐minimality and weak o‐minimality for circularly ordered sets. Much of the theory goes through almost unchanged, since over a parameter the circular order yields a definable linear order. Working over ?? there are differences. Our main result is a structure theory (with infinitely many doubly transitive examples related to Jordan permutation groups) for ?₀‐categorical weakly circularly minimal structures. There is a 5‐homogeneous (or ‘5‐indiscernible’) example which is not 6‐homogeneous, but any example which is k‐homogeneous for some k ≥ 6 is k‐homogeneous for all k. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On definability of types and relative stability

In this paper, we consider the question of definability of types in non‐stable theories. In order to do this we introduce a notion of a relatively stable theory: a theory is stable up to Δ if any Δ‐type over a model has few extensions up to complete types. We prove that an n‐type over a model of a theory that is stable up to Δ is definable if and only if its Δ‐part is definable.     

On the quantifier complexity of definable canonical Henselian valuations

We discuss definability in the language of rings without parameters of the unique canonical Henselian valuation of a field. We show that in most cases where the canonical Henselian valuation is definable, it is already definable by a universal‐existential or an existential‐universal formula.     

Monodromization and Difference Equations with Meromorphic Periodic Coefficients

We consider a system of two first-order difference equations in the complex plane. We assume that the matrix of the system is a 1-periodic meromorphic function having two simple poles per period and bounded as Im z → ±∞. We prove the existence and uniqueness of minimal meromorphic solutions, i.e., solutions having simultaneously a minimal set of poles and minimal possible growth as Im z → ±∞. We consider the monodromy matrix representing the shift-byperiod operator in the space of meromorphic solutions and corresponding to a basis built of two minimal solutions. We check that it has the same functional structure as the matrix of the initial system of equations and, in particular, is a meromorphic periodic function with two simple poles per period. This implies that the initial equation is invariant with respect to the monodromization procedure, that is, a natural renormalization procedure arising when trying to extend the Floquet–Bloch theory to difference equations defined on the real line or complex plane and having periodic coefficients. Our initial system itself arises after one renormalization of a self-adjoint difference Schrödinger equation with 1-periodic meromorphic potential bounded at ±i∞ and having two poles per period.     

Nonstandard models that are definable in models of Peano Arithmetic

In this paper, we investigate definable models of Peano Arithmetic PA in a model of PA. For any definable model N without parameters in a model M, we show that N is isomorphic to M if M is elementary extension of the standard model and N is elementarily equivalent to M. On the other hand, we show that there is a model M and a definable model N with parameters in M such that N is elementarily equivalent to M but N is not isomorphic to M. We also show that there is a model M and a definable model N with parameters in M such that N is elementarily equivalent to M, and N is isomorphic to M, but N is not definably isomorphic to M. And also, we give a generalization of Tennenbaum's theorem. At the end, we give a new method to construct a definable model by a refinement of Kotlarski's method. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Definable subgroups of measure algebras

We show that type‐definable subgroups of measure algebras are definable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Infinite time aggregation for the critical Patlak‐Keller‐Segel model in ℝ2

We analyze the two‐dimensional parabolic‐elliptic Patlak‐Keller‐Segel model in the whole Euclidean space ?². Under the hypotheses of integrable initial data with finite second moment and entropy, we first show local‐in‐time existence for any mass of “free‐energy solutions,” namely weak solutions with some free‐energy estimates. We also prove that the solution exists as long as the entropy is controlled from above. The main result of the paper is to show the global existence of free‐energy solutions with initial data as before for the critical mass 8π/χ. Actually, we prove that solutions blow up as a delta Dirac at the center of mass when t → ∞ when their second moment is kept constant at any time. Furthermore, all moments larger than 2 blowup as t → ∞ if initially bounded. © 2007 Wiley Periodicals, Inc.