Related papers: Machine Learning Clifford invariants of ADE Coxete…
Let $E$ be a Koszul Frobenius algebra. A Clifford deformation of $E$ is a finite dimensional $\mathbb Z_2$-graded algebra $E(\theta)$, which corresponds to a noncommutative quadric hypersurface $E^!/(z)$, for some central regular element…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…
We propose a nonlinear manifold learning technique based on deep convolutional autoencoders that is appropriate for model order reduction of physical systems in complex geometries. Convolutional neural networks have proven to be highly…
Starting from the geometric calculus based on Clifford algebra, the idea that physical quantities are Clifford aggregates ("polyvectors") is explored. A generalized point particle action ("polyvector action") is proposed. It is shown that…
A phylogenetic variety is an algebraic variety parameterized by a statistical model of the evolution of biological sequences along a tree. Understanding this variety is an important problem in the area of algebraic statistics with…
For functions that take values in the Clifford algebra, we study the Clifford-Fourier transform on $R^m$ defined with a kernel function $K(x,y) := e^{\frac{i \pi}{2} \Gamma_{y}}e^{-i <x,y>}$, replacing the kernel $e^{i <x,y>}$ of the…
We define and study generalized nil-Coxeter algebras associated to Coxeter groups. Motivated by a question of Coxeter (1957), we construct the first examples of such finite-dimensional algebras that are not the 'usual' nil-Coxeter algebras:…
We review the properties of the finite Coxeter groups which are most useful for applications to cohomological invariants, namely their classes of involutions and their "cubes" (abelian subgroups generated by reflections).
A theorem of Pfister asserts that every $12$-dimensional quadratic form with trivial discriminant and trivial Clifford invariant over a field of characteristic different from $2$ decomposes as a tensor product of a binary quadratic form and…
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…
In this study, a novel feature coding method that exploits invariance for transformations represented by a finite group of orthogonal matrices is proposed. We prove that the group-invariant feature vector contains sufficient discriminative…
Fast linear algebra in deep learning usually comes with a choice: fixed geometry and exact computation, as in the Fourier transform, or adaptive geometry paid for by dense parameters, random features, or low-rank surrogates. To move beyond…
Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…
We study the cohomology with modular coefficients of Deligne-Lusztig varieties associated to Coxeter elements. Under some torsion-free assumption on the cohomology we derive several results on the principal l-block of a finite reductive…
In certain situations, neural networks are trained upon data that obey underlying symmetries. However, the predictions do not respect the symmetries exactly unless embedded in the network structure. In this work, we introduce architectures…
We present Clifford-Steerable Convolutional Neural Networks (CS-CNNs), a novel class of $\mathrm{E}(p, q)$-equivariant CNNs. CS-CNNs process multivector fields on pseudo-Euclidean spaces $\mathbb{R}^{p,q}$. They cover, for instance,…
The recent advancement of edge computing enables researchers to optimize various deep learning architectures to employ them in edge devices. In this study, we aim to optimize Xception architecture which is one of the most popular deep…
Statistical learning methods show great promise in providing an accurate prediction of materials and molecular properties, while minimizing the need for computationally demanding electronic structure calculations. The accuracy and…
We give a Clifford correspondence for an algebra A over an algebraically closed field, that is an algorithm for constructing some finite-dimensional simple A-modules from simple modules for a subalgebra and endomorphism algebras. This…
Representation learning is central to graph machine learning, powering tasks such as link prediction and node classification. However, most graph embeddings are hard to interpret, offering limited insight into how learned features relate to…