Related papers: An algorithm for the Cartan-Dieudonn\'e theorem on…

Modern advances in general-purpose computer algebra systems offer solutions to a variety of problems, which in the past required substantial time investments by trained mathematicians. An excellent example of such development are the…

We prove the following variant of Marstrand's theorem about projections of cartesian products of sets: Let $K_1,...,K_n$ Borel subsets of $\mathbb R^{m_1},... ,\mathbb R^{m_n}$ respectively, and $\pi:\mathbb R^{m_1}\times...\times\mathbb…

Stanley generalized MacMahon's classical theorem by proving a product formula for the norm-trace generating function for plane partition with unbounded parts. In his recent work on biothorgonal polynomials, Kamioka proved a finite analogue…

We derive a method to efficiently compute the Green function of on arbitrary Hamiltonians defined on semi-infinite and periodic quasi-one-dimensional lattices. Computing the Green function is the backbone of quantum transport, electronic…

The power of Clifford or, geometric, algebra lies in its ability to represent geometric operations in a concise and elegant manner. Clifford algebras provide the natural generalizations of complex, dual numbers and quaternions into…

This paper exhibits a multiplicative and minimal cellular complex which allows explicit and complete (co)homological calculations for the symmetric products of a finite two dimensional CW complex. By considering cohomology, we observe that…

The well-known classification of the Clifford algebras $Cl(r,s)$ leads to canonical forms of complex and real representations which are essentially unique by virtue of the Wedderburn theorem. For $s\ge 1$ representations of $Cl(r,s)$ on…

A set of valuable universal similarity factorization equalities is established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…

We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…

We complete Dyson's dream by cementing the links between symmetric spaces and classical random matrix ensembles. Previous work has focused on a one-to-one correspondence between symmetric spaces and many but not all of the classical random…

We prove the following theorem. Let $G$ be a finite group generated by unitary reflections in a complex Hermitian space $V=\mathbb{C}^\ell$ and let $G'$ be any reflection subgroup of $G$. Let $\mathcal{H}(G)$ be the space of $G$-harmonic…

We report on three improvements in the context of Feynman integral reduction and $\varepsilon$-factorised differential equations: Firstly, we show that with a specific choice of prefactors, we trivialise the $\varepsilon$-dependence of the…

We show that, for a certain class of partitions and an even number of variables of which half are reciprocals of the other half, Schur polynomials can be factorized into products of odd and even orthogonal characters. We also obtain related…

This is an attempt to model ambient space as a three-dimensional real affine space with a distinguished group of automorphisms containing the translations and acting freely and transitively on pairs consisting of a half-plane together with…

Elie Cartan's general equivalence problem is recast in the language of Lie algebroids. The resulting formalism, being coordinate and model-free, allows for a full geometric interpretation of Cartan's method of equivalence via reduction and…

In these lectures, we discuss some well-known facts about Clifford algebras: matrix representations, Cartan's periodicity of 8, double coverings of orthogonal groups by spin groups, Dirac equation in different formalisms, spinors in $n$…

We give a geometric method for determining the cohomology groups and the product structure of a polyhedral product, under suitable freeness conditions or with coefficients taken in a field. This is done by considering first a special class…

We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…

Krawtchouk polynomials appear in a variety of contexts, most notably as orthogonal polynomials and in coding theory via the Krawtchouk transform. We present an operator calculus formulation of the Krawtchouk transform that is suitable for…

The decomposition of a matrix, as a product of factors with particular properties, is a much used tool in numerical analysis. Here we develop methods for decomposing a matrix $C$ into a product $X Y$, where the factors $X$ and $Y$ are…