Resumen de Arithmetic rigidity

Wayne Raskind, Matei Stroila

• We prove an arithmetic analogue of rigidity results of Suslin and Beilinson, and then give some applications to countability of certain motivic cohomology groups of varieties over the complex numbers, assuming a finite generation of these groups for varieties over finitely generated fields.