Closure and connected component of a planar global semianalytic set defined by analytic functions definable in o-minimal structure

We consider a global semianalytic set defined by real analytic functions definable in an o-minimal structure. When the o-minimal structure is polynomially bounded, we show that the closure of this set is a global semianalytic set defined by definable real analytic functions. We also demonstrate that a connected component of a planar global semianalytic set defined by real analytic functions definable in a substructure of the restricted analytic field is a global semianalytic set defined by definable real analytic functions.     

Definable group extensions in semi‐bounded o‐minimal structures

In this note we show: Let R = 〈R, <, +, 0, …〉 be a semi‐bounded (respectively, linear) o‐minimal expansion of an ordered group, and G a group definable in R of linear dimension m ([2]). Then G is a definable extension of a bounded (respectively, definably compact) definable group B by 〈R^m, +〉 (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Singularities of o‐minimal Peano derivatives

The notion of Peano differentiability generalizes the differentiability in the usual sense to higher order. Peano differentiable functions have derivatives which are sometimes differentiable or continuous or not even locally bounded. We give a complete characterisation of the sets in which Peano differentiable functions which are definable in an o‐minimal expansion of a real closed field are continuously differentiable. Thereby, we also distinguish between several kinds of discontinuities (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Uniform bounds on growth in o‐minimal structures

We prove that a function definable with parameters in an o‐minimal structure is bounded away from ∞ as its argument goes to ∞ by a function definable without parameters, and that this new function can be chosen independently of the parameters in the original function. This generalizes a result in [1]. Moreover, this remains true if the argument is taken to approach any element of the structure (or ±∞), and the function has limit any element of the structure (or ±∞) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Pseudo definably connected definable sets

In o‐minimal structures, every cell is definably connected and every definable set is a finite union of its definably connected components. In this note, we introduce pseudo definably connected definable sets in weakly o‐minimal structures having strong cell decomposition, and prove that every strong cell in those structures is pseudo definably connected. It follows that every definable set can be written as a finite union of its pseudo definably connected components. We also show that the projections of pseudo definably connected definable sets are pseudo definably connected. Finally, we compare pseudo definable connectedness with (recently introduced) weak definable connectedness of definable sets in weakly o‐minimal structures.     

An o-minimal structure without mild parameterization

We prove, by explicit construction, that not all sets definable in polynomially bounded o-minimal structures have mild parameterization. Our methods do not depend on the bounds particular to the definition of mildness and therefore our construction is also valid for a generalized form of parameterization, which we call G-mild. Moreover, we present a cell decomposition result for certain o-minimal structures which may be of independent interest. This allows us to show how our construction can produce polynomially bounded, model complete expansions of the real ordered field which, in addition to lacking G-mild parameterization, nonetheless still have analytic cell decomposition.     

The Łojasiewicz–Siciak Condition of the Pluricomplex Green Function

The aim of this paper is to address a problem raised originally by L. Gendre, later by W. Ple?niak and recently by L. Bia?as–Cie? and M. Kosek. This problem concerns the pluricomplex Green function and consists in finding new examples of sets with so–called ?ojasiewicz–Siciak ((?S) for short) property. So far, the known examples of such sets are rather of particular nature. We prove that each compact subset of ? ^N , treated as a subset of ? ^N , satisfies the ?ojasiewicz–Siciak condition. We also give a sufficient geometric criterion for a semialgebraic set in ?², but treated as a subset of ?, to satisfy this condition. This criterion applies more generally to a set in ? definable in a polynomially bounded o–minimal structure.     

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)     

Locally polynomially bounded structures

We prove a theorem which provides a method for constructingpoints on varieties defined by certain smooth functions. Werequire that the functions be definable in a definably completeexpansion of a real closed field and be locally definable ina fixed o-minimal and polynomially bounded reduct. As an applicationwe show that in certain o-minimal structures, definable functionsare piecewise implicitly defined over the basic functions inthe language.     

Filling certain cuts in discrete weakly o‐minimal structures

Discrete weakly o‐minimal structures, although not so stimulating as their dense counterparts, do exhibit a certain wealth of examples and pathologies. For instance they lack prime models and monotonicity for definable functions, and are not preserved by elementary equivalence. First we exhibit these features. Then we consider a countable theory of weakly o‐minimal structures with infinite definable discrete (convex) subsets and we study the Boolean algebra of definable sets of its countable models. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The Field of Reals with Multisummable Series and the Exponential Function

We show that the field of real numbers with multisummable realpower series is model complete, o-minimal and polynomially bounded.Further expansion by the exponential function yields again amodel complete and o-minimal structure which is exponentiallybounded, and in which the Gamma function on the positive realline is definable. 2000 Mathematics Subject Classification:primary 03C10, 32B05, 32B20; secondary, 26E05.     

A remark on divisibility of definable groups

We show that if G is a definably compact, definably connected definable group defined in an arbitrary o‐minimal structure, then G is divisible. Furthermore, if G is defined in an o‐minimal expansion of a field, k ∈ ? and p_k : G → G is the definable map given by p_k (x ) = x^k for all x ∈ G , then we have |(p_k )^–1(x )| ≥ k^r for all x ∈ G , where r > 0 is the maximal dimension of abelian definable subgroups of G . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Infinitely Peano differentiable functions in polynomially bounded o-minimal structures

Let R be an o-minimal expansion of a real closed field. We show that the definable infinitely Peano differentiable functions are smooth if and only if R is polynomially bounded.     

On the strong cell decomposition property for weakly o‐minimal structures

We consider a class of weakly o‐minimal structures admitting an o‐minimal style cell decomposition, for which one can construct certain canonical o‐minimal extension. The paper contains several fundamental facts concerning the structures in question. Among other things, it is proved that the strong cell decomposition property is preserved under elementary equivalences. We also investigate fiberwise properties (of definable sets and definable functions), definable equivalence relations, and conditions implying elimination of imaginaries.     

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)     

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)     

Euler characteristic of imaginaries in o‐minimal structures

We define the notion of Euler characteristic for definable quotients in an arbitrary o‐minimal structure and prove some fundamental properties.     

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.     

Domain sensitivity analysis of the acoustic far‐field pattern

We consider acoustic scattering problems described by the mixed boundary value problem for the scalar Helmholtz equation in the exterior of a 2D bounded domain or in the exterior of a crack. The boundary of the domain is assumed to have a finite set of corner points where the scattered wave may have singular behaviour. The paper is concerned with the sensitivity of the far‐field pattern with respect to small perturbations of the shape of the scatterer. Using a modification of the method of adjoint problems, we obtain an integral representation for the Gâteaux derivative which contains only boundary values of functions easily computable by standard BEM and which depends explicitly on the perturbation of the boundary. In some cases, we show the direct influence of the singularities of the solution on the sensitivity of the far‐field pattern. In this way, we generalize the domain sensitivity analysis developed earlier for smooth domains by Hettlich, Kirsch, Kress, Potthast and others. Finally, we show that the same approach can be applied to scattering from 3D domains with smooth edges. Copyright © 2002 John Wiley & Sons, Ltd.     

DAG‐Width and Circumference of Digraphs

We prove that every digraph of circumference l has DAG‐width at most l. This is best possible and solves a recent conjecture from S. Kintali (ArXiv:1401.2662v1 [math.CO], January 2014).¹ As a consequence of this result we deduce that the k‐linkage problem is polynomially solvable for every fixed k in the class of digraphs with bounded circumference. This answers a question posed in J. Bang‐Jensen, F. Havet, and A. K. Maia (Theor Comput Sci 562 (2014), 283–303). We also prove that the weak k‐linkage problem (where we ask for arc‐disjoint paths) is polynomially solvable for every fixed k in the class of digraphs with circumference 2 as well as for digraphs with a bounded number of disjoint cycles each of length at least 3. The case of bounded circumference digraphs is still open. Finally, we prove that the minimum spanning strong subdigraph problem is NP‐hard on digraphs of DAG‐width at most 5.