相关论文: Full graph and complete Lie algebra
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…
A complete classifications, up to isomorphism, of two-dimensional associative and diassociative algebras over any basic field are given.
We characterise the slices of the category of graphs that are algebraically universal in terms of the structure of the slicing graph. In particular, we show that algebraic universality is obtained if, and only if, the slicing graph contains…
It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.
Leibniz algebras are non-antisymmetric generalizations of Lie algebras that have attracted substantial interest due to their close relation with the latter class. A Leibniz algebra $A$ is called perfect if it coincides with its derived…
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theory, linear programming and combinatorial optimization. Claude Berge made a conjecture about them, that was proved by Chudnovsky, Robertson,…
We study the existence of post-Lie algebra structures on pairs of Lie algebras $(\mathfrak{g},\mathfrak{n})$, where one of the algebras is perfect non-semisimple, and the other one is abelian, nilpotent non-abelian, solvable non-nilpotent,…
We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…
A finite W-algebra is an associative algebra constructed from a semisimple Lie algebra and its nilpotent element. In this survey we review recent developments in the representation theory of W-algebras. We emphasize various interactions…
Let $\Lambda$ be a finite dimensional algebra such that $\mathcal{L}_{\Lambda}$ or $\mathcal{R}_{\Lambda}\neq\emptyset$. Then $\Lambda$ is $\tau$-tilting finite if and only if $\Lambda$ is representation-finite.
The aim of the paper is to study epicomplete objects in the category of $MV$-algebras. A relation between injective $MV$-algebras and epicomplete $MV$-algebras is found, an equivalence condition for an $MV$-algebra to be epicomplete is…
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semicomplete if the out-neighbourhood and the in-neighbourhood of any vertex induce a semicomplete digraph. In this paper we study various…
Supersymmetry and super-Lie algebras have been consistently generalized previously. The so-called fractional supersymmetry and $F-$Lie algebras could be constructed starting from any representation $\D$ of any Lie algebra $g$. This involves…
We give a complete classification of (n+2)-dimensional n-Lie algebras over an algebraically closed field of characteristic $2$, and provide a isomorphic criterion theorem of (n+2)-dimensional n-Lie algebras.
A problem of completing a linear map on C*-algebras to a completely positive map is analyzed. It is shown that whenever such a completion is feasible there exists a unique minimal completion. This theorem is used to show that under some…
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily 3-connected i.e. the sequence…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
There exists a complete atomless Boolean algebra that has no proper atomless complete subalgebra.
We say that a digraph is a $(t,\lambda)$-liking digraph if every $t$ vertices have exactly $\lambda$ common out-neighbors. In 1975, Plesn\'{i}k [Graphs with a homogeneity, 1975. {\it Glasnik Mathematicki} 10:9-23] proved that any…
We first characterize all faithful arc-transitive covers of complete graphs and we give a general construction of such covers. For a counterpart of cover, we say a graph $\Gamma$ is a pseudocover of its quotient $\Sigma$ if they have the…