2000 character limit reached
Sub-Laplacian comparison theorems on Riemannian foliations with minimal leaves and applications
Published 16 Sep 2025 in math.DG and math.PR | (2509.13276v1)
Abstract: We prove comparison theorems for the horizontal Laplacian of the Riemannian distance in the context of Riemannian foliations with minimal leaves. This general framework generalizes previous works and allow us to consider the sub-Laplacian of Carnot groups of arbitrary steps. The comparison theorems yield a Bonnet-Myers type theorem, stochastic completeness and Lipschitz regularization property for the sub-Riemannian semigroup.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.