Abstract: This series of three talks is intended to present some (known as well as recent) local analytic and combinatorial methods in complex analytic geometry. I will show how one can exploit them to establish a certain level of algebraic control over the geometric complexity of a mapping, along the lines of a classical freeness criterion of Auslander. This, on the other hand, leads to effective (computable) regularity criteria in the polynomial case