On the intersection of tame subgroups in groups acting on trees

Let $G$ be a group acting on a tree $T$ with finite edge stabilizers of bounded order. We provide, in some very interesting cases, upper bounds for the complexity of the intersection $H\cap K$ of two tame subgroups $H$ and $K$ of $G$ in terms of the complexities of $H$ and $K$. In particular, we obtain bounds for the Kurosh rank $Kr(H\cap K)$ of the intersection in terms of Kurosh ranks $Kr(H)$ and $Kr(K)$, in the case where $H$ and $K$ act freely on the edges of $T$.Comment: 15 pages. v2 updated to mention recent work by other researchers. Minor changes. v3 revised version following the referee's comments. Statement of Theorem 3.3 correcte

A portuguese perspective

Commentary on the Nuffield Report from a Portuguese Perspective (Nuffield Council on Bioethics (2007). The forensic use of bioinformation: ethical issues. Cambridge (18 September) (retrieved from http://www.nuffieldbioethics.org/fileLibrary/pdf/ The_forensic_use_of_bioinformation_-_ethical_issues.pdf).This is a document which is of considerable interest to professionals working in the criminal justice system, to key stakeholders, and to scholars and students focused on the forensic applications of bioinformation.Fundação para a Ciência e a Tecnologia (FCT)

Preparing the ground for the CBM content debate:What information builds confidence?

Working Paper submitted by Switzerland to the BWC Meeting of States Partie