How dense is dense, or: computing in linear groups
Igor Rivin
Temple University
We will discuss algorithms to check Zariski density and profinite density for classes of finitely generated subgroups. We also discuss generic phenomena.
Back to Long Programs