Sobolev spaces on Lie groups: Embedding theorems and algebra properties

Let G be a noncompact connected Lie group, denote with ρ a right Haar measure and choose a family of linearly independent left-invariant vector fields X on G satisfying Hörmander's condition. Let χ be a positive character of G and consider the measure ${\mu }_{\chi }$ whose density with respect to ρ is χ. In this paper, we introduce Sobolev spaces $L_{\alpha }^p({\mu }_{\chi })$ adapted to X and ${\mu }_{\chi }$ ($1<p<\infty$, $\alpha \ge 0$) and study embedding theorems and algebra properties of these spaces. As an application, we prove local well-posedness and regularity results of solutions of some nonlinear heat and Schrödinger equations on the group.     

Capable Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field

In this paper, we classify all capable nilpotent Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field. Moreover, the explicit structure of such Lie algebras of class 3 is given.     

Maximizing the mean subtree order

This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to describe the structure of optimal trees in and , the families of all trees and caterpillars, respectively, of order . We begin by establishing a powerful tool called the Gluing Lemma, which is used to prove several of our main results. In particular, we show that if is an optimal tree in or for , then every leaf of is adjacent to a vertex of degree at least . We also use the Gluing Lemma to answer an open question of Jamison and to provide a conceptually simple proof of Jamison's result that the path has minimum mean subtree order among all trees of order . We prove that if is optimal in , then the number of leaves in is and that if is optimal in , then the number of leaves in is . Along the way, we describe the asymptotic structure of optimal trees in several narrower families of trees.     

A Tree-valued Markov Process Associated with an Admissible Family of Branching Mechanisms

Let E?R be an interval. By studying an admissible family of branching mechanisms{ψt,t ∈E} introduced in Li [Ann. Probab., 42, 41-79(2014)], we construct a decreasing Levy-CRT-valued process {Tt, t ∈ E} by pruning Lévy trees accordingly such that for each t ∈E, Tt is a ψt-Lévy tree. We also obtain an analogous process {Tt*,t ∈E} by pruning a critical Levy tree conditioned to be infinite. Under a regular condition on the admissible family of branching mechanisms, we show that the law of {Tt,t ∈E} at the ascension time A := inf{t ∈E;Tt is finite} can be represented by{Tt*,t∈E}.The results generalize those studied in Abraham and Delmas [Ann. Probab., 40, 1167-1211(2012)].