Related papers: Automatic Differentiation With Higher Infinitesima…
Machine learning and neural network models in particular have been improving the state of the art performance on many artificial intelligence related tasks. Neural network models are typically implemented using frameworks that perform…
This paper introduces and studies a class of Weyl-type algebras \(A_{p,t,\cA} = \Weyl{e^{\pm x^{p} e^{t x}},\; e^{\cA x},\; x^{\cA}}\) constructed over exponential-polynomial rings, where \(\FF\) is a field of characteristic zero, \(\cA\)…
A new class of associative algebras referred to as affine walled Brauer algebras are introduced. These algebras are free with infinite rank over a commutative ring containing 1. Then level two walled Brauer algebras over C are defined,…
Finite W-algebras are certain associative algebras arising in Lie theory. Each W-algebra is constructed from a pair of a semisimple Lie algebra g (our base field is algebraically closed and of characteristic 0) and its nilpotent element e.…
Based on a class of associative algebras with zero-divisors which are called real-like algebras by us, we introduce a way of defining automatic differentiation and present different ways of doing automatic differentiation to compute the…
A commutative associative algebra $A$ over ${\mathbb C}$ with a derivation is one of the simplest examples of a vertex algebra. However, the differences between the modules for $A$ as a vertex algebra and the modules for $A$ as an…
The paper presents the complete classification of Automorphic Lie Algebras based on $\mathfrak{sl}_n (\mathbb{C})$, where the symmetry group $G$ is finite and the orbit is any of the exceptional $G$-orbits in $\overline{\mathbb{C}}$. A key…
The first Weyl algebra over $k$, $A_1 = k \langle x, y\rangle/(xy-yx - 1)$ admits a natural $\mathbb{Z}$-grading by letting $\operatorname{deg} x = 1$ and $\operatorname{deg} y = -1$. Paul Smith showed that $\operatorname{gr}- A_1$ is…
While LiDAR data acquisition is easy, labeling for semantic segmentation remains highly time consuming and must therefore be done selectively. Active learning (AL) provides a solution that can iteratively and intelligently label a dataset…
We implement two algorithms in MATHEMATICA for classifying automorphisms of lower-dimensional non-commutative Lie algebras. The first algorithm is a brute-force approach whereas the second is an evolutionary strategy. These algorithms are…
Given a double vector bundle $D\to M$, we define a bigraded `Weil algebra' $\mathcal{W}(D)$, which `realizes' the algebra of smooth functions on the supermanifold $D[1,1]$. We describe in detail the relations between the Weil algebras of…
If $X$ is a smooth manifold then the $\mathbb R$-algebra $C^\infty(X)$ of smooth functions $c:X\to\mathbb R$ is a $C^\infty$-$ring$. That is, for each smooth function $f:{\mathbb R}^n\to\mathbb R$ there is an $n$-fold operation…
Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist sharp degree bounds for a single triangular set in terms of intrinsic data of the…
Much of the work in loop quantum gravity and quantum geometry rests on a mathematically rigorous integration theory on spaces of distributional connections. Most notably, a diffeomorphism invariant representation of the algebra of basic…
Let V be a finite dimensional representation of the connected complex reductive group H. Denote by G the derived subgroup of H and assume that the categorical quotient of V by G is one dimensional. In this situation there exists a…
We discuss linear algebra of infinite-dimensional vector spaces in terms of algebraic (Hamel) bases. As an application we prove the surjectivity of a large class of linear partial differential operators with smooth ($\mathcal…
There are a variety of choices to be made in both computer algebra systems (CASs) and satisfiability modulo theory (SMT) solvers which can impact performance without affecting mathematical correctness. Such choices are candidates for…
Convolutional Neural Networks (CNNs) have proven to be state-of-the-art models for supervised computer vision tasks, such as image classification. However, large labeled data sets are generally needed for the training and validation of such…
In this article a new formulation of the Weyl C*-algebra, which has been invented by Fleischhack, in terms of C*-dynamical systems is presented. The quantum configuration variables are given by the holonomies along paths in a graph.…
Differentiable programming is a fresh programming paradigm which composes parameterized algorithmic components and trains them using automatic differentiation (AD). The concept emerges from deep learning but is not only limited to training…