On finite imaginaries

We study finite imaginaries in certain valued fields, and prove a conjecture of Cluckers and Denef.Comment: 15p

Groupoids, imaginaries and internal covers

Let $T$ be a first-order theory. A correspondence is established between internal covers of models of $T$ and definable groupoids within $T$. We also consider amalgamations of independent diagrams of algebraically closed substructures, and find strong relation between: covers, uniqueness for 3-amalgamation, existence of 4-amalgamation, imaginaries of T^\si, and definable groupoids. As a corollary, we describe the imaginary elements of families of finite-dimensional vector spaces over pseudo-finite fields.Comment: Local improvements; thanks to referee of Turkish Mathematical Journal. First appeared in the proceedings of the Paris VII seminar: structures alg\'ebriques ordonn\'ee (2004/5

Tensor structure for Nori motives

We construct a tensor product on Freyd's universal abelian category attached to an additive tensor category or a tensor quiver and establish a universal property. This is used to give an alternative construction for the tensor product on Nori motives.Comment: Revised & updated version, 23 page

Definability of linear equation systems over groups and rings

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and rings from the viewpoint of logical (inter-)definability. All problems that we consider are decidable in polynomial time, but not expressible in fixed-point logic with counting. They also provide natural candidates for a separation of polynomial time from rank logics, which extend fixed-point logics by operators for determining the rank of definable matrices and which are sufficient for solvability problems over fields. Based on the structure theory of finite rings, we establish logical reductions among various solvability problems. Our results indicate that all solvability problems for linear equation systems that separate fixed-point logic with counting from PTIME can be reduced to solvability over commutative rings. Moreover, we prove closure properties for classes of queries that reduce to solvability over rings, which provides normal forms for logics extended with solvability operators. We conclude by studying the extent to which fixed-point logic with counting can express problems in linear algebra over finite commutative rings, generalising known results on the logical definability of linear-algebraic problems over finite fields