Related papers: A note on the Lie complexity and beyond
We make a start on one of George McNulty's Dozen Easy Problems: "Which finite automatic algebras are dualizable?" We give some necessary and some sufficient conditions for dualizability. For example, we prove that a finite automatic algebra…
This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…
The notion of a Lie conformal superalgebra encodes an axiomatic descrption of singular parts of the operator product expansions of chiral fields in conformal field theory. In the paper we give a detailed proof of the classification of all…
We introduce a notion of a length function exponentially distorted on a (compactly generated) subgroup of a locally compact group. We prove that for a connected linear complex Lie group there is a maximum equivalence class of length…
Claude Chevalley provided a basis for a {finite dimensional} simple complex Lie algebra called the Chevalley basis. This basis has the distinguishing property that all the structure constants are integers. Chevalley groups, which are…
Let $q=p^r$ be a power of an odd prime $p$. We study binary sequences $\sigma=(\sigma_0,\sigma_1,\ldots)$ with entries in $\{0,1\}$ defined by using the quadratic character $\chi$ of the finite field $\mathbb{F}_q$: $$ \sigma_n=\left\{…
Lie-Yamaguti algebras generalize both the notions of Lie algebras and Lie triple systems. In this paper, we consider the inducibility problem for automorphisms of extensions of Lie-Yamaguti algebras. More precisely, given an abelian…
Following the structure theory approach for rings, the aim of this paper is to study some distinguished classes of Lie algebras. We introduce the notion of a Lie-module and discuss some relations of it with various classes of ideals of a…
The procedure "Lie group --> Lie algebra" has a generalization "simplicial manifold --> L_infinity algebra", or yet better, "presheaf on the category of surjective submersions --> L_infinity algebra". We describe this generalization,…
We develop a unified second-order parameterized complexity theory for spaces of integrable functions. This generalizes the well-established case of second-order parameterized complexity theory for spaces of continuous functions.…
One of the algebraic structures that has emerged recently in the study of the operator product expansions of chiral fields in conformal field theory is that of a Lie conformal algebra [K]. A Lie pseudoalgebra is a generalization of the…
We prove nilpotency results for Lie algebras over an arbitrary field admitting a derivation, which satisfies a given polynomial identity $r(t)=0$. For the polynomial $r=t^n-1$ we obtain results on the nilpotency of Lie algebras admitting a…
It is well known that a finite-dimensional Lie algebra over a field of characteristic zero is simple exactly when its derivation algebra is simple. In this paper we characterize those Lie algebras of arbitrary dimension over any field that…
We investigate a dynamical complexity measure defined for finite automata with translucent letters (FAwtl). Roughly, this measure counts the minimal number of necessary jumps for such an automaton in order to accept an input. The model…
For every commutative differential algebra one can define the Lie algebra of special derivations. It is known for years that not every Lie algebra can be embedded to the Lie algebra of special derivations of some differential algebra. More…
We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages are known to be prefix-closed. We get tight bounds on both…
Given the pressing need for assuring algorithmic transparency, Explainable AI (XAI) has emerged as one of the key areas of AI research. In this paper, we develop a novel Bayesian extension to the LIME framework, one of the most widely used…
We introduce a theoretical framework for understanding and predicting the complexity of sequence classification tasks, using a novel extension of the theory of Boolean function sensitivity. The sensitivity of a function, given a…
We initiate the study of the complexity-theoretic properties of convex logics in team semantics. We focus on the extension of classical propositional logic with the nonemptiness atom NE, a logic known to be both convex and union closed. We…
We discuss the use of negative bases in automatic sequences. Recently the theorem-prover Walnut has been extended to allow the use of base (-k) to express variables, thus permitting quantification over Z instead of N. This enables us to…