Related papers: An algorithm for the Cartan-Dieudonn\'e theorem on…
Solutions to a linear Diophantine system, or lattice points in a rational convex polytope, are important concepts in algebraic combinatorics and computational geometry. The enumeration problem is fundamental and has been well studied,…
We develop a holonomy reduction procedure for general Cartan geometries. We show that, given a reduction of holonomy, the underlying manifold naturally decomposes into a disjoint union of initial submanifolds. Each such submanifold…
We give a new version of the adversary method for proving lower bounds on quantum query algorithms. The new method is based on analyzing the eigenspace structure of the problem at hand. We use it to prove a new and optimal strong direct…
Superanalysis can be deformed with a fermionic star product into a Clifford calculus that is equivalent to geometric algebra. With this multivector formalism it is then possible to formulate Riemannian geometry and an inhomogeneous…
We generalize a special case of a theorem of Proctor on the enumeration of lozenge tilings of a hexagon with a maximal staircase removed, using Kuo's graphical condensation method. Additionally, we prove a formula for a weighted version of…
Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…
In this paper we prove some general theorems about representations of finite groups arising from the inner semidirect product of groups. We show how these results can be used for standard applications of group theory in quantum chemistry…
An explicit algorithmic construction is given for orthogonal bases for spaces of homogeneous polynomials, in the context of Hermitean Clifford analysis, which is a higher dimensional function theory centred around the simultaneous null…
Consider a finite collection of affine hyperplanes in $\mathbb R^d$. The hyperplanes dissect $\mathbb R^d$ into finitely many polyhedral chambers. For a point $x\in \mathbb R^d$ and a chamber $P$ the metric projection of $x$ onto $P$ is the…
We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…
We discuss the folklore construction of the Gray tensor product of 2-categories as obtained by factoring the map from the funny tensor product to the cartesian product. We show that this factorisation can be obtained without using a…
Reduction algebras (also known as generalized Mickelsson algebras, Zhelobenko algebras, or transvector algebras) are well-studied associative algebras appearing in the representation theory of Lie algebras. In the 1990s, Zhelobenko noted…
We prove factorization of the generating functional of connected tree diagrams by exploring that it is the Legendre transform of the action. This theorem is then applied to the example of a massive real scalar field theory in 2D. In the…
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
Using the quadratic transformation and the generating function method we Perform the Fourier transformation of the wave function of coordinates of hydrogen atom and we find the analytic expression of the wave function in momentum space. We…
A strengthened form of Schur's triangularization theorem is given for quaternion matrices with real spectrum (for complex matrices it was given by Littlewood). Littlewood's algorithm for reducing a complex matrix to a canonical form under…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We introduce Clifford Group Equivariant Neural Networks: a novel approach for constructing $\mathrm{O}(n)$- and $\mathrm{E}(n)$-equivariant models. We identify and study the $\textit{Clifford group}$, a subgroup inside the Clifford algebra…
This paper provides an accurate method to obtain the bidiagonal factorization of many generalized Pascal matrices, which in turn can be used to compute with high relative accuracy the eigenvalues, singular values and inverses of these…
Using Dwork's theory, we prove a broad generalisation of his famous p-adic formal congruences theorem. This enables us to prove certain p-adic congruences for the generalized hypergeometric series with rational parameters; in particular,…