相关论文: A note on the Lie complexity and beyond
We study a new class of infinite dimensional Lie algebras, which has important applications to the theory of integrable equations. The construction of these algebras is very similar to the one for automorphic functions and this motivates…
We construct a class of new Lie algebras by generalizing the one-variable Lie algebras generated by the quadratic conformal algebras (or corresponding Hamiltonian operators) associated to Poisson algebras and a quasi-derivation found by Xu.…
The quotient complexity of a regular language L is the number of left quotients of L, which is the same as the state complexity of L. Suppose that L and L' are binary regular languages with quotient complexities m and n, and that the…
Even though query evaluation is a fundamental task in databases, known classifications of conjunctive queries by their fine-grained complexity only apply to queries without self-joins. We study how self-joins affect enumeration complexity,…
We introduce the notion of extended affine Lie superalgebras and investigate the properties of their root systems. Extended affine Lie algebras, invariant affine reflection algebras, finite dimensional basic classical simple Lie…
For a complexity function $C$, the lower and upper $C$-complexity rates of an infinite word $\mathbf{x}$ are \[ \underline{C}(\mathbf x)=\liminf_{n\to\infty} \frac{C(\mathbf{x}\upharpoonright n)}n,\quad \overline{C}(\mathbf…
A fundamental question in computer science is: Is it harder to solve $n$ instances independently than to solve them simultaneously? This question, known as the direct sum question or direct sum theorem, has been paid much attention in…
This paper considers the complexity and properties of KLM-style preferential reasoning in the setting of propositional logic with team semantics and dependence atoms, also known as propositional dependence logic. Preferential team-based…
This paper investigates some properties of complex structures on Lie algebras. In particular, we focus on $\textit{nilpotent}$ $\textit{complex structures}$ that are characterized by a suitable $J$-invariant ascending or descending central…
The present work is devoted to the extension of some general properties of automorphisms and derivations which are known for Lie algebras to finite dimensional complex Leibniz algebras. The analogues of the Jordan-Chevalley decomposition…
We present a new algorithm for constructing a Chevalley basis for any Chevalley Lie algebra over a finite field. This is a necessary component for some constructive recognition algorithms of exceptional quasisimple groups of Lie type. When…
The subsumption problem with respect to terminologies in the description logic ALC is EXPTIME-complete. We investigate the computational complexity of fragments of this problem by means of allowed Boolean operators. Hereto we make use of…
Every metric symplectic Lie algebra has the structure of a quadratic extension. We give a standard model and describe the equivalence classes on the level of corresponding quadratic cohomology sets. Finally, we give a scheme to classify the…
Computational models typically assume that operations are applied in a fixed sequential order. In recent years several works have looked at relaxing this assumption, considering computations without any fixed causal structure and showing…
We initiate a study on a range of new generalized derivations of finite-dimensional Lie algebras over an algebraically closed field of characteristic zero. This new generalization of derivations has an analogue in the theory of associative…
This paper covers two topics: first an introduction to Algorithmic Complexity Theory: how it defines probability, some of its characteristic properties and past successful applications. Second, we apply it to problems in A.I. - where it…
We associate to a semisimple complex Lie algebra $\mathfrak{g}$ a sequence of polynomials $P_{\ell,\mathfrak{g}}(x)\in\mathbb{Q}[x]$ in $r$ variables, where $r$ is the rank of $\mathfrak{g}$ and $\ell=0,1,2,\ldots $. The polynomials…
We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding the result to existing tools for the complexity analysis of…
We provide a general theoretical framework allowing us to extend the classical Lie theory for partial differential equations to the case of equations of fractional order. We propose a general prolongation formula for the study of Lie…
The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial…