We develop the affine sieve in the context of orbits of congruence subgroups of semisimple groups acting linearly on affine space. In particular, we give effective bounds for the saturation numbers for points on such orbits at which the value of a given polynomial has few prime factors. In many cases these bounds are of the same quality as what is known in the classical case of a polynomial in one variable where the orbit consists of the integers. When the orbit is the set of integral matrices of a fixed determinant, we obtain a sharp result for the saturation number, and thus establish the Zariski density of matrices all of whose entries are prime numbers. Among the key tools used are explicit approximations to the generalized Ramanujan conjectures for such groups, and sharp and uniform counting of points on such orbits when ordered by various norms.

We study geodesics in the random metric space called the Brownian map, which appears as the scaling limit of large planar maps. In particular, we completely describe geodesics starting from the distinguished point called the root, and we characterize the set$S$of all points that are connected to the root by more than one geodesic. The set$S$is dense in the Brownian map and homeomorphic to a non-compact real tree. Furthermore, for every$x$in$S$, the number of distinct geodesics from x to the root is equal to the number of connected components of$S$\{$x$}. In particular, points of the Brownian map can be connected to the root by at most three distinct geodesics. Our results have applications to the behavior of geodesics in large planar maps.

We prove the endpoint case of the multilinear Kakeya conjecture of Bennett, Carbery and Tao. The proof uses the polynomial method introduced by Dvir.