Related papers: A note on the Lie complexity and beyond
Motivated by the classical correspondence between short exact sequences and splitting properties in module theory, this paper examines the projective and injective analogues within the category of Lie algebras. We first show that no Lie…
We generalize to the case of Lie superalgebras the classical symplectic double extension of symplectic Lie algebras introduced in [2]. We use this concept to give an inductive description of nilpotent homogeneous-symplectic Lie…
We give a comprehensive survey of the theory of finite dimensional Lie algebras over an algebraically closed field of characteristic p>0 and announce that for p>3 the classification of finite dimensional simple Lie algebras is complete. Any…
Realistic quantum mechanics based on complex probability theory is shown to have a frequency interpretation, to coexist with Bell's theorem, to be linear, to include wavefunctions which are expansions in eigenfunctions of Hermitian…
We consider finite-dimensional complex Lie algebras. Using certain complex parameters we generalize the concept of cohomology cocycles of Lie algebras. A special case is generalization of 1-cocycles with respect to the adjoint…
The Recognition Theorem for graded Lie algebras is an essential ingredient in the classification of finite-dimensional simple Lie algebras over an algebraically closed field of characteristic p > 3. The main goal of this monograph is to…
The paper "Is Complexity an Illusion?" (Bennett, 2024) provides a formalism for complexity, learning, inference, and generalization, and introduces a formal definition for a "policy". This reply shows that correct policies do not exist for…
We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently,…
Zalcman's Lemma makes significant applications in normal families, complex dynamics and related problems in complex analysis. In the present paper, we are devoted to generalizing the classical Zalcman's lemma to complex Lie groups by means…
An algebra $L$ over a field $\Bbb F$, in which product is denoted by $[\,,\,]$, is said to be \textit{ Lie type algebra} if for all elements $a,b,c\in L$ there exist $\alpha, \beta\in \Bbb F$ such that $\alpha\neq 0$ and $[[a,b],c]=\alpha…
The material presented in this paper contributes to establishing a basis deemed essential for substantial progress in Automated Deduction. It identifies and studies global features in selected problems and their proofs which offer the…
We consider finite-dimensional complex Lie algebras admitting a periodic derivation, i.e., a nonsingular derivation which has finite multiplicative order. We show that such Lie algebras are at most two-step nilpotent and give several…
We consider the problem of sequential prediction and provide tools to study the minimax value of the associated game. Classical statistical learning theory provides several useful complexity measures to study learning with i.i.d. data. Our…
Let L be some extension of classical propositional logic. The non-iterated probabilistic logic over L, is the logic PL that is defined by adding non-nested probabilistic operators in the language of L. For example in PL we can express a…
In [She82], it is shown that four basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization of this notion. In this paper, we try to extend this work, both by looking…
The paper concerns two versions of the notion of real forms of Lie superalgebras. One is the standard approach, where a real form of a complex Lie superalgebra is a real Lie superalgebra such that its complexification is the original…
We discuss the basic properties of Lie groupoids, Lie algebroids and Lie pseudo-groups in view of applying these techniques to the analysis of Jordan-H\"older resolutions and, subsequently, to the integration of partial differential…
Implicit Computational Complexity makes two aspects implicit, by manipulating programming languages rather than models of com-putation, and by internalizing the bounds rather than using external measure. We survey how automata theory…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
We characterize finite-dimensional thick representations over ${\Bbb C}$ of connected complex semi-simple Lie groups by irreducible representations which are weight multiplicity-free and whose weight posets are totally ordered sets.…