Related papers: On the Computation of Clebsch-Gordan Coefficients …
We obtain a family of explicit "polyhedral" combinatorial expressions for multiplicities in the tensor product of two simple finite-dimensional modules over a complex semisimple Lie algebra. Here "polyhedral" means that the multiplicity in…
We present an algorithm for computing approximate $\ell_p$ Lewis weights to high precision. Given a full-rank $\mathbf{A} \in \mathbb{R}^{m \times n}$ with $m \geq n$ and a scalar $p>2$, our algorithm computes $\epsilon$-approximate…
Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued matrices building upon work for detecting the most frequent items in data streams. We continue this line of research and present new {\em…
This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…
This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…
Given a semisimple compact Lie group $G$ and a nonzero dominant integral weight $\lambda$, the highest weight $G_q$-modules $V_{n\lambda}$ form a subproduct system of finite dimensional Hilbert spaces. Using a conjectural asymptotic…
We introduce tensor numerical techniques for solving optimal control problems constrained by elliptic operators in $\mathbb{R}^d$, $d=2,3$, with variable coefficients, which can be represented in a low rank separable form. We construct a…
This document contains notes based on lectures given by Hendrik Lenstra at the PCMI summer school 2022. There are many problems in algebraic number theory which one would like to solve algorithmically, for example computation of the maximal…
In this paper, we study the Crank-Nicolson method for temporal dimension and the piecewise quadratic polynomial collocation method for spatial dimensions of time-dependent nonlocal problems. The new theoretical results of such…
There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…
We provide an algorithm of computing Clebsch-Gordan coefficients for irreducible representations, with integer weights, of the rotation group SO(3) and demonstrate the convenience of this algorithm for constructing new (to our knowledge)…
We obtain inductive and enumerative formulas for the multiplicities of the weights of the spin module for the Clifford algebra of a Levi subalgebra in a complex semisimple Lie algebra. Our formulas involve only matrices and tableaux, and…
Structured reinforcement learning and stochastic optimization often involve parameters evolving on matrix Lie groups such as rotations and rigid-body transformations. We establish a representation-optimization dichotomy for…
Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…
We obtain exact, simple and very compact expressions for the linearization coefficients of the products of orthogonal polynomials; both the conventional Clebsch-Gordan-type and the modified version. The expressions are general depending…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…
We consider the problem of computing sample points in each connected component of a semi-algebraic set defined by the non-vanishing or the positivity of an n-variate polynomial of degree d, with rational coefficients of bit size bounded by…
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…