On the simplicity of some kac-moody groups

Recently, Marcuson extended the classical construction of Tits systems in Steinberg groups to include the Kac-Moody Steinberg groups associated with the infinite dimensional versions of the great Lie algebras. If these Lie algebras and their Kac-Moody groups are viewed as limits of their finite dimensional counterparts, more direct methods may be employed. In fact, the Kac-Moody Chevalley groups of these Lie algebras are seen to be simple.     

利用单参数Lie群组的一种可解性求自治系统首次积分的方法

讨论了自治系统接受的单参数Lie群组具有一种可解性的情况下求系统的一个首次积分的具体方法.对于n阶自治系统,给出相应参数的一组确定取值,求得系统首次积分；对于三阶自治系统,当系统接受的单参数Lie群组可解时,验证求得首次积分的条件一定成立.     

Highly edge-connected factors using given lists on degrees

Let G be a 2k-edge-connected graph with and let for every . A spanning subgraph F of G is called an L-factor, if for every . In this article, we show that if for every , then G has a k-edge-connected L-factor. We also show that if and for every , then G has a k-edge-connected L-factor.     

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.     

On a family of highly regular graphs by Brouwer,Ivanov, and Klin

Highly regular graphs for which not all regularities are explainable by symmetries are fascinating creatures. Some of them like, e.g., the line graph of W. Kantor’s non-classical $GQ(5^2,5)$, are stumbling stones for existing implementations of graph isomorphism tests. They appear to be extremely rare and even once constructed it is difficult to prove their high regularity. Yet some of them, like the McLaughlin graph on 275 vertices and Ivanov’s graph on 256 vertices are of profound beauty. This alone makes it an attractive goal to strive for their complete classification or, failing this, at least to get a deep understanding of them. Recently, one of the authors discovered new methods for proving high regularity of graphs. Using these techniques, in this paper we study a classical family of strongly regular graphs, originally discovered by A.E. Brouwer, A.V. Ivanov, and M.H. Klin in the late 80s. We analyse their symmetries and show that they are $(3,5)$-regular but not 2-homogeneous. Thus we promote these graphs to the distinguished club of highly regular graphs with few symmetries.     

The prescribed Ricci curvature problem on three‐dimensional unimodular Lie groups

Let G be a three‐dimensional unimodular Lie group, and let T be a left‐invariant symmetric (0,2)‐tensor field on G. We provide the necessary and sufficient conditions on T for the existence of a pair consisting of a left‐invariant Riemannian metric g and a positive constant c such that , where is the Ricci curvature of g. We also discuss the uniqueness of such pairs and show that, in most cases, there exists at most one positive constant c such that is solvable for some left‐invariant Riemannian metric g.     

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.     

Invertible Linear Maps on the General Linear Lie Algebras Preserving Solvability

Let Mn be the algebra of all n × n complex matrices and gl(n,C) be the general linear Lie algebra,where n ≥ 2.An invertible linear map ?:gl(n,C) →gl(n,C) preserves solvability in both directions if bot...