Efficient algorithms for computing the Euler-Poincar\'e characteristic of symmetric semi-algebraic sets

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic subsets of $\mathrm{R}^k$, which are defined by symmetric polynomials with coefficients in $\mathrm{D}$. We give algorithms for computing the generalized Euler-Poincar\'e characteristic of such sets, whose complexities measured by the number the number of arithmetic operations in $\mathrm{D}$, are polynomially bounded in terms of $k$ and the number of polynomials in the input, assuming that the degrees of the input polynomials are bounded by a constant. This is in contrast to the best complexity of the known algorithms for the same problems in the non-symmetric situation, which are singly exponential. This singly exponential complexity for the latter problem is unlikely to be improved because of hardness result ($\#\mathbf{P}$-hardness) coming from discrete complexity theory.Comment: 29 pages, 1 Figure. arXiv admin note: substantial text overlap with arXiv:1312.658

The arithmetic of QM-abelian surfaces through their Galois representations

This note provides an insight to the diophantine properties of abelian surfaces with quaternionic multiplication over number fields. We study the fields of definition of the endomorphisms on these abelian varieties and the images of the Galois representations on their Tate modules. We illustrate our results with several explicit examples.Comment: To appear in J. Algebr

Geometrically closed rings

We develop the basic theory of geometrically closed rings as a generalisation of algebraically closed fields, on the grounds of notions coming from positive model theory and affine algebraic geometry. For this purpose we consider several connections between finitely presented rings and ultraproducts, affine varieties and definable sets, and we introduce the key notion of an arithmetic theory as a purely algebraic version of coherent logic for rings.Comment: 18 page