Related papers: Algebraic Complexity Classes
We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…
The computational complexity of polynomial ideals and Gr\"obner bases has been studied since the 1980s. In recent years, the related notions of polynomial subalgebras and SAGBI bases have gained more and more attention in computational…
We give an introduction to vertex algebras using elementary forward difference methods originally due to Isaac Newton.
We define a semantic complexity class based on the model of quantum computing with just one pure qubit (as introduced by Knill and Laflamme) and discuss its computational power in terms of the problem of estimating the trace of a large…
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether $S$ is a semigroup or has an identity element. If S is a monoid, we want to…
This is the text of an article that I wrote and disseminated in September 1981, except that I've updated the references, corrected a few misprints, and added a table of contents, some footnotes, and an addendum. The original article gave a…
Complexity remains one of the central challenges in science and technology. Although several approaches at defining and/or quantifying complexity have been proposed, at some point each of them seems to run into intrinsic limitations or…
Let $n>1$ be an integer. The algebras of the title, which we abbreviate as algebras of type $n$, are infinite-dimensional graded Lie algebras $L= \bigoplus_{i=1}^{\infty}L_i$, which are generated by an element of degree $1$ and an element…
In this article, we develop an algebraic framework of axioms which abstracts various high-level properties of multi-qudit representations of generalized Clifford algebras. We further construct an explicit model and prove that it satisfies…
Abstraction is essential for reducing the complexity of systems across diverse fields, yet designing effective abstraction methodology for probabilistic models is inherently challenging due to stochastic behaviors and uncertainties. Current…
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii.)…
Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since developed independent and self-contained lives and brought us some…
Integer compositions restricted by inequalities on certain pairs of parts were first considered by J\"{o}rg Arndt in 2013 and several variations have been studied recently. Here we consider a broad two-parameter generalization that scales…
This paper gives an overview of some basic properties of Leibniz algebras. Some of the results were known earlier, but in the article they are accompanied by new simple proofs. Some of the results are new. The article can be viewed as a…
This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…
After a review on the development of deformation theory of abelian complex structures from both the classical and generalized sense, we propose the concept of semi-abelian generalized complex structure. We present some observations on such…
This is a very basic introduction to some notions related to logic and complexity.
Model complexity is a fundamental problem in deep learning. In this paper we conduct a systematic overview of the latest studies on model complexity in deep learning. Model complexity of deep learning can be categorized into expressive…
The algebras of the title are infinite-dimensional graded Lie algebras $L= \bigoplus_{i=1}^{\infty}L_i$, over a field of positive characteristic $p$, that are generated by an element of degree $1$ and an element of degree $p$, and satisfy…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…