No abstract uploaded!

Using probabilistic methods, we prove new rigidity results for groups and pseudo-groups of diffeomorphisms of one dimensional manifolds with intermediate regularity class (i.e. between$C$^{1}and$C$^{2}). In particular, we show some generalizations of Denjoy theorem and the classical Kopell lemma for abelian groups. These techniques are also applied to the study of codimension-1 foliations. For instance, we obtain several generalized versions of Sacksteder theorem in class$C$^{1}. We conclude with some remarks about the stationary measure.

No abstract uploaded!

No abstract uploaded!

We associate to a finite digraph D a lattice polytope PD whose vertices are the rows of the Laplacian matrix of D. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem, we show that the normalized volume of PD equals the complexity of D, and PD contains the origin in its relative interior if and only if D is strongly connected. Interesting connections with other families of simplices are established and then used to describe reflexivity, the h∗-polynomial, and the integer decomposition property of PD in these cases. We extend Braun and Meyer’s study of cycles by considering cycle digraphs. In this setting, we characterize reflexivity and show there are only four non-trivial reflexive Laplacian simplices having the integer decomposition property.