Abstract We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with a particular emphasis on the set $D'$ comprised of differences between successive elements. In particular, if the burden of the structure is at most n, then the result of applying the operation $D \mapsto D'\ n$ times must be a finite set (Theorem 1.1). In the case when the structure is densely ordered and has burden $2$ , we show that any definable unary discrete set must be definable in some elementary extension of the structure $\langle \mathbb{R}; <, +, \mathbb{Z} \rangle $ (Theorem 1.3).

Given a parametric lattice with a basis given by polynomials in $\Bbb{Z}[t]$, we give an algorithm to construct an LLL-reduced basis whose elements are eventually quasi-polynomial in $t$: that is, they are given by formulas that are piecewise polynomial in $t$ (for sufficiently large $t$), such that each piece is given by a congruence class modulo a period. As a consequence, we show that there are parametric solutions of the shortest vector problem and closest vector problem that are also eventually quasi-polynomial in $t$.

Abstract We present definitions of homology groups Hn (p), n ≥ 0, associated to a complete type p. We show that if the generalized amalgamation properties hold, then the homology groups are trivial. We compute the group H2(p) for strong types in stable theories and show that any profinite abelian group can occur as the group H2 (p).

Abstract Dp-minimality is a common generalization of weak minimality and weak o-minimality. IfTis a weakly o-minimal theory then it is dp-minimal (Fact 2.2), but there are dp-minimal densely ordered groups that are not weakly o-minimal. We introduce the even more general notion of inp-minimality and prove that in an inp-minimal densely ordered group, every definable unary function is a union of finitely many continuous locally monotonic functions (Theorem 3.2).

Abstract Building on Hrushovski's work in [5], we study definable groupoids in stable theories and their relationship with 3-uniqueness and finite internal covers. We introduce the notion of retractability of a definable groupoid (which is slightly stronger than Hrushovski's notion of eliminability), give some criteria for when groupoids are retractable, and show how retractability relates to both 3-uniqueness and the splitness of finite internal covers. One application we give is a new direct method of constructing non-eliminable groupoids from witnesses to the failure of 3-uniqueness. Another application is a proof that any finite internal cover of a stable theory with a centerless liaison groupoid is almost split.