Related papers: A note on the Lie complexity and beyond
We give a complete characterization of connected Lie groups with the Approximation Property for groups (AP). To this end, we introduce a strengthening of property (T), that we call property (T*), which is a natural obstruction to the AP. In…
Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…
In logic-based knowledge representation, query answering has essentially replaced mere satisfiability checking as the inferencing problem of primary interest. For knowledge bases in the basic description logic ALC, the computational…
We produce a connected real Lie group that, as a first order structure in the group language, interprets the real field expanded with a predicate for the integers. Moreover, the domain of our interpretation is definable in the group.
Lax extensions of set functors play a key role in various areas including topology, concurrent systems, and modal logic, while predicate liftings provide a generic semantics of modal operators. We take a fresh look at the connection between…
Theory of differential operators on associative algebras is not extended to the non-associative ones in a straightforward way. We consider differential operators on Lie algebras. A key point is that multiplication in a Lie algebra is its…
A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…
Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the…
We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…
We call a finite, spanning set of a semi-simple real Lie algebra a distinguished set if it satisfies the following property: The Lie bracket of any two elements out of the set is, up to some constant, another element in the set; conversely,…
We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…
In this paper we give automata-based representation of LTL-FO$^+$ properties. LTL-FO$^+$ is an extension of LTL that includes first-order quantification over bounded variable, thus greatly increasing the expressivity of the language. An…
A {\it Lie system} is a nonautonomous system of first-order differential equations admitting a {\it superposition rule}, i.e., a map expressing its general solution in terms of a generic family of particular solutions and some constants.…
We call a unital locally convex algebra $A$ a continuous inverse algebra if its unit group $A^\times$ is open and inversion is a continuous map. For any smooth action of a, possibly infinite-dimensional, connected Lie group $G$ on a…
The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…
A complex fuzzy Lie algebra is a fuzzy Lie algebra whose membership function takes values in the unit circle in the complex plane. In this paper, we deine the complex fuzzy Lie subalgebras and complex fuzzy ideals of Lie algebras. Then, we…
F-Lie algebras are natural generalisations of Lie algebras (F=1) and Lie superalgebras (F=2). We give finite dimensional examples of F-Lie algebras obtained by an inductive process from Lie algebras and Lie superalgebras. Matrix…
We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…
A study is made of real Lie algebras admitting compatible complex and product structures, including numerous 4-dimensional examples. If g is a Lie algebra with such a structure then its complexification has a hypercomplex structure. It is…
The subword complexity of a word $w$ over a finite alphabet $\mathcal{A}$ is a function that assigns for each positive integer $n$, the number of distinct subwords of length $n$ in $w$. The subword complexity of a word is a good measure of…