Low codimensional intrinsic regular submanifolds in the Heisenberg group H^n

The thesis mainly concerns the study of intrinsically regular submanifolds of low codimension in the Heisenberg group H^n, called H-regular surfaces of low codimension, from the point of view of geometric measure theory. We consider an H-regular surface of H^n of codimension k, with k between 1 and n, parametrized by a uniformly intrinsically differentiable map acting between two homogeneous complementary subgroups of H^n, with target subgroup horizontal of dimension k. In particular the considered submanifold is the intrinsic graph of the parametrization. We extend various results of Ambrosio, Serra Cassano and Vittone, available for the case when k = 1. We prove that the uniform intrinsic differentiability of the parametrizing map is equivalent to the existence and continuity of its intrinsic differential, to the local existence of a suitable approximating family of Euclidean regular maps, and, when the domain and the codomain of the map are orthogonal, to the existence and continuity of suitably defined intrinsic partial derivatives of the function. Successively, we present a series of area formulas, proved in collaboration with V. Magnani. They allow to compute the (2n+2−k)-dimensional spherical Hausdorff measure and the (2n+2−k)-dimensional centered Hausdorff measure of the parametrized H-regular surface, with respect to any homogeneous distance fixed on H^n. Furthermore, we focus on (G,M)-regular sets of G, where G and M are two arbitrary Carnot groups. Suitable implicit function theorems ensure the local existence of an intrinsic parametrization of such a set, at any of its points. We prove that it is uniformly intrinsically differentiable. Finally, we prove a coarea-type inequality for a continuously Pansu differentiable function acting between two Carnot groups endowed with homogeneous distances. We assume that the level sets of the function are uniformly lower Ahlfors regular and that the Pansu differential is everywhere surjective.

Probabilistic Recursion Theory and Implicit Computational Complexity

In this thesis we provide a characterization of probabilistic computation in itself, from a recursion-theoretical perspective, without reducing it to deterministic computation. More specifically, we show that probabilistic computable functions, i.e., those functions which are computed by Probabilistic Turing Machines (PTM), can be characterized by a natural generalization of Kleene's partial recursive functions which includes, among initial functions, one that returns identity or successor with probability 1/2. We then prove the equi-expressivity of the obtained algebra and the class of functions computed by PTMs. In the the second part of the thesis we investigate the relations existing between our recursion-theoretical framework and sub-recursive classes, in the spirit of Implicit Computational Complexity. More precisely, endowing predicative recurrence with a random base function is proved to lead to a characterization of polynomial-time computable probabilistic functions.