Related papers: An Algorithm for Computing with Brauer's Group Equ…
There is strong interest in developing mathematical methods that can be used to understand complex neural networks used in image analysis. In this paper, we introduce techniques from Linear Algebra to model neural network layers as maps…
In this work the matrix exponential function is solved analytically for the special orthogonal groups $SO(n)$ up to $n=9$. The number of occurring $k$-th matrix powers gets limited to $0\leq k \leq n-1$ by exploiting the Cayley-Hamilton…
We define an extension of the affine Brauer algebra, the type B/C affine Brauer algebra. This new algebra contains the hyperoctahedral group and it naturally acts on $END_K(X \otimes V^{\otimes k})$ for Orthogonal and Symplectic groups.…
Previous work on symmetric group equivariant neural networks generally only considered the case where the group acts by permuting the elements of a single vector. In this paper we derive formulae for general permutation equivariant layers,…
It is noted that two-by-two S-matrices in multilayer optics can be represented by the Sp(2) group whose algebraic property is the same as the group of Lorentz transformations applicable to two space-like and one time-like dimensions. It is…
Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…
The orthogonal group acts on the space of several $n\times n$ matrices by simultaneous conjugation. For an infinite field of characteristic different from two, relations between generators for the algebra of invariants are described. As an…
We find the R matrix for the inhomogeneous quantum groups whose homogeneous part is $GL_q(n)$, or its restrictions to $SL_q(n)$,$U_q(n)$ and $SU_q(n)$. The quantum Yang-Baxter equation for R holds because of the Hecke relation for the…
We propose, implement, and compare with competitors a new architecture of equivariant neural networks based on geometric (Clifford) algebras: Generalized Lipschitz Group Equivariant Neural Networks (GLGENN). These networks are equivariant…
A new method for deriving universal \v{R} matrices from braid group representation is discussed. In this case, universal \v{R} operators can be defined and expressed in terms of products of braid group generators. The advantage of this…
Classifiers and rating scores are prone to implicitly codifying biases, which may be present in the training data, against protected classes (i.e., age, gender, or race). So it is important to understand how to design classifiers and scores…
Neural gates compute functions based on weighted sums of the input variables. The expressive power of neural gates (number of distinct functions it can compute) depends on the weight sizes and, in general, large weights (exponential in the…
In this note we extend kernel function approximation results for neural networks with Gaussian-distributed weights to single-layer networks initialized using Haar-distributed random orthogonal matrices (with possible rescaling). This is…
The classical characteristic map associates symmetric functions to characters of the symmetric groups. There are two natural analogues of this map involving the Brauer algebra. The first of them relies on the action of the orthogonal or…
Assuming the Tate conjecture and the computability of \'etale cohomology with finite coefficients, we give an algorithm that computes the N\'eron-Severi group of any smooth projective geometrically integral variety, and also the rank of the…
We compute the Brauer group of the moduli stack of hyperelliptic curves $\mathcal{H}_g$ over any field of characteristic zero. In positive characteristic, we compute the part of the Brauer group whose order is prime to the characteristic of…
We present a new class of equivariant neural networks, hereby dubbed Lattice-Equivariant Neural Networks (LENNs), designed to satisfy local symmetries of a lattice structure. Our approach develops within a recently introduced framework…
We provide a computational framework for approximating a class of structured matrices; here, the term structure is very general, and may refer to a regular sparsity pattern (e.g., block-banded), or be more highly structured (e.g., symmetric…
Let $\text{GL}(n) = \text{GL}(n, {\mathbb C})$ denote the complex general linear group and let $G \subset \text{GL}(n)$ be one of the classical complex subgroups $\text{O}(n)$, $\text{SO}(n)$, and $\text{Sp}(2k)$ (in the case $n = 2k$). We…
Let $m, n\in{\mathbb N}$. In this paper we study the right permutation action of the symmetric group ${\mathfrak S}_{2n}$ on the set of all the Brauer $n$-diagrams. A new basis for the free ${\mathbb Z}$-module ${\mathfrak B}_n$ spanned by…