We investigate the compatibility of minimally coupled scalar, fermion and gauge fields with asymptotically safe quantum gravity, using nonperturbative functional Renormalization Group methods. We study d = 4, 5 and 6 dimensions and within certain approximations find that for a given number of gauge fields there is a maximal number of scalar and fermion degrees of freedom compatible with an interacting fixed point at positive Newton coupling. The bounds impose severe constraints on grand unification with fundamental Higgs scalars. Supersymmetry and universal extra dimensions are also generally disfavored. The standard model and its extensions accommodating right-handed neutrinos, the axion and dark-matter models with a single scalar are compatible with a fixed point.

Interwiners are the building blocks of spin-network states. The space of intertwiners is the quantization of a classical symplectic manifold introduced by Kapovich and Millson. Here we show that a theorem by Minkowski allows us to interpret generic configurations in this space as bounded convex polyhedra in Ê 3 : a polyhedron is uniquely described by the areas and normals to its faces. We provide a reconstruction of the geometry of the polyhedron: we give formulas for the edge lengths, the volume and the adjacency of its faces. At the quantum level, this correspondence allows us to identify an intertwiner with the state of a quantum polyhedron, thus generalizing the notion of quantum tetrahedron familiar in the loop quantum gravity literature. Moreover, coherent intertwiners result to be peaked on the classical geometry of polyhedra. We discuss the relevance of this result for loop quantum gravity. In particular, coherent spin-network states with nodes of arbitrary valence represent a collection of semiclassical polyhedra. Furthermore, we introduce an operator that measures the volume of a quantum polyhedron and examine its relation with the standard volume operator of loop quantum gravity. We also comment on the semiclassical limit of spinfoams with non-simplicial graphs.