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 ∈ N and p k : G -→ G is the definable map given by p k (x) = x k for all x ∈ G, then we
On the Euler characteristic of definable groups
✍ Scribed by Mário J. Edmundo
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 69 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 SIMILAR VOLUMES
## Abstract It is shown that through a relationship between the Euler characteristic and the cycle rank of polymer networks one has access to a quantitative description of functionality heterogeneity in these fascinating structures. This relationship is applied and extended to study heterogeneous n
For such a p-chain C we denote m j=0 N G U j by N G C , and by C we denote the length m of C. Moreover, for a given p-block B of G and a non-negative integer d, let Irr N G C B d denote the set of irreducible characters χ of N G C , such that χ belongs to a block of N G C inducing B and such that p
We show that the known algorithms used to re-write any first order quantifierfree formula over an algebraically closed field into its normal disjunctive form are essentially optimal. This result follows from an estimate of the number of sets definable by equalities and inequalities of fixed polynomi
Assuming planar 4-connectivity and spatial 6-connectivity, we first introduce the curvature indices of the boundary of a discrete object, and, using these indices of points, we define the vertex angles of discrete surfaces as an extension of the chain codes of digital curves. Second, we prove the re