Related papers: Unifom chains of small transfinite rank
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
Bestvina and Feighn showed that a morphism S --> T between two simplicial trees that commutes with the action of a group G can be written as a product of elementary folding operations. Here a more general morphism between simplicial trees…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
We show that, consistently, there can be maximal subtrees of P (omega) and P (omega) / fin of arbitrary regular uncountable size below the size of the continuum. We also show that there are no maximal subtrees of P (omega) / fin with…
The following two assertions are equivalent for an o-minimal expansion of an ordered group $\mathcal M=(M,<,+,0,\ldots)$. There exists a definable bijection between a bounded interval and an unbounded interval. Any definable continuous…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
We introduce orderings between total functions f,g: N -> N which refine the pointwise "up to a constant" ordering <=cte and also insure that f(x) is often much less thang(x). With such orderings, we prove a strong hierarchy theorem for…
A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…
We study the well-quasi-order (wqo) consisting of the set of finite trees with leaf labels coming from an arbitrary wqo $Q$, ordered by tree homomorphisms which respect the order on the labels. This is a variant of the usual Kruskal tree…
Given a connected reductive group $\tilde{G}$ over a finite field $k$, and a semisimple $k$-automorphism $\varepsilon$ of $\tilde{G}$ of finite order, let $G$ denote the connected part of the group of $\varepsilon$-fixed points. Then there…
We study point-line configurations, their minimal matroids, and their associated circuit varieties. We present an algorithm for identifying the minimal matroids of these configurations with respect to dependency order, or equivalently, the…
We give in this paper a survey of results obtained in our earlier papers, and state explicitly some problems of further research, for example: are the analytic ranks bounded, or not? Twists of Carlitz modules are parametrized by polynomials…
The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…
J.-P. Thouvenot and the author showed via different approaches that the centralizer of a mixing rank-one infinite measure preserving transformation was trivial. In this note the author presents his joining proof. We also consider…
Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…
For a compact smooth manifold $M$ (with boundary) we prove that the topological rank of the diffeomorphism group Diff$_0^k(M)$ is finite for all $k\geq 1$. This extends a result from [2] where the same claim is proved in the special case of…
In this paper, we determine the relative rank of the semigroup $T(X,Y)$ of all transformations on a finite chain $X$ with restricted range $Y \subseteq X$ modulo the set $OP(X,Y)$ of all orientation-preserving transformation in $T(X,Y)$.…
We generalize Kada's definable strengthening of Dilworth's characterization of the class of quasi-orders admitting an antichain of a given finite cardinality.
We study inhomogeneous continuous-time weakly ergodic Markov chains with a finite state space. We introduce the notion of a Markov chain with the regular structure of an infinitesimal matrix and study the sharp upper bounds on the rate of…
Most comparisons of preferences are instances of single-crossing dominance. We examine the lattice structure of single-crossing dominance, proving characterisation, existence and uniqueness results for minimum upper bounds of arbitrary sets…