相关论文: Tanaka rigidity of graph Lie algebras

The paper gives the complete characterization of all graded nilpotent Lie algebras with infinite-dimensional Tanaka prolongation as extensions of graded nilpotent Lie algebras of lower dimension by means of a commutative ideal. We introduce…

In this paper we translate the necessary and sufficient conditions of Tanaka's theorem on the finiteness of effective prolongations of a fundamental graded Lie algebras into computationally effective criteria, involving the rank of some…

We present a construction of 2-step nilpotent Lie algebras using labeled directed simple graphs, which allows us to give a criterion to detect certain ideals and subalgebras by finding special subgraphs. We prove that if a label occurs only…

We prove that if the 0-th Tanaka prolongation $\mathfrak{g}_0=\mathfrak{der}_0(\mathfrak{m})$ of a fundamental graded nilpotent Lie algebra $\mathfrak{m}=\mathfrak{g}_{-s}\oplus\dots\oplus\mathfrak{g}_{-1}$ is irreducible on…

We prove that the C*-algebra of a directed graph $E$ is liminal iff the graph satisfies the finiteness condition: if $p$ is an infinite path or a path ending with a sink or an infinite emitter, and if $v$ is any vertex, then there are only…

We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…

We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.

Every end of an infinite graph $ G $ defines a tangle of infinite order in $ G $. These tangles indicate a highly cohesive substructure in the graph if and only if they are closed in some natural topology. We characterize, for every finite…

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

In this paper we study variations of an old result by M\"{u}ller, Reiterman, and the last author stating that a countable graph has a subgraph with infinite degrees if and only if in any labeling of the vertices (or edges) of this graph by…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…

For any finite graph Gamma and any field K of characteristic unequal to 2 we construct an algebraic variety X over K whose K-points parameterise K-Lie algebras generated by extremal elements, corresponding to the vertices of the graph, with…

We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…

For an arbitrary countable directed graph E we show that the only possible values of the stable rank of the associated Cuntz-Krieger algebra C*(E) are 1, 2 or \infty. Explicit criteria for each of these three cases are given. We…

A good edge-labelling of a simple graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. Say a graph is good if it admits a good…

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

Transitive local Lie algebras of vector fields can be easily constructed from dilations of $\mathbb{R}^n$ associating with coordinates positive weights (give me a sequence of $n$ positive integers and I will give you a transitive nilpotent…

We consider a method popular in the literature of associating a two-step nilpotent Lie algebra with a finite simple graph. We prove that the two-step nilpotent Lie algebras associated with two graphs are Lie isomorphic if and only if the…