Related papers: Effective computation of $\mathrm{SO}(3)$ and $\ma…
This paper introduces a SAT-based technique that calculates a compact and complete symmetry-break for finite model finding, with the focus on structures with a single binary operation (magmas). Classes of algebraic structures are typically…
The local geometry of a Riemannian symmetric space is described completely by the Riemannian metric and the Riemannian curvature tensor of the space. In the present article I describe how to compute these tensors for any Riemannian…
We develope a new scheme for the construction of explicit complex-valued proper biharmonic functions on Riemannian Lie groups. We exploit this and manufacture many infinite series of uncountable families of new solutions on the special…
We introduce an algorithm to decompose orthogonal matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The…
We present a full list of all representations of the special linear group $\mathrm{SL}_n$ over the complex numbers with complete intersection invariant ring, completing the classification of Shmelkin. For this task, we combine three…
This document presents a series of open questions arising in matrix computations, i.e., the numerical solution of linear algebra problems. It is a result of working groups at the workshop Linear Systems and Eigenvalue Problems, which was…
Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…
Representations of $SO(5)_{q}$ are constructed explicitly on the Chevalley basis for all $q$, generic and root of unity. Matrix elements of the generators are obtained for all representations depending on three variable indices, the maximal…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
In this article, we classify (non-compact) $3$-manifolds with uniformly positive scalar curvature. Precisely, we show that an oriented $3$-manifold has a complete metric with uniformly positive scalar curvature if and only if it is…
The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…
We classify the subalgebras of the real forms the complex linear algebra $\mathfrak{sl}_3(\mathbb{C})$, namely the real special linear algebra $\mathfrak{sl}_3(\mathbb{R})$, the special unitary algebra $\mathfrak{su}(3)$, and the…
We present a collection of numerical bootstrap computations for 3d CFTs with a U(1) global symmetry. We test the accuracy of our method and fix conventions through a computation of bounds on the OPE coefficients for low-lying operators in…
A set of Maple V R.3/4 computer algebra routines for the analytical solving of 1st. order ODEs, using Lie group symmetry methods, is presented. The set of commands includes a 1st. order ODE-solver and routines for, among other things: the…
The problem of classification into symmetry integrable classes is solved for a family of second order nonlinear evolution equations labeled by arbitrary functions. Four nonequivalent symmetry integrable classes are thus obtained and the…
On a constraint manifold we give an explicit formula for the Hessian matrix of a cost function that involves the Hessian matrix of a prolonged function and the Hessian matrices of the constraint functions. We give an explicit formula for…
A graph is $k$-degenerate if any induced subgraph has a vertex of degree at most $k$. In this paper we prove new algorithms for cliques and similar structures for these graphs. We design linear time Fixed-Parameter Tractable algorithms for…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
We provide a technique to obtain explicit bounds for problems that can be reduced to linear forms in three complex logarithms of algebraic numbers. This technique can produce bounds significantly better than general results on lower bounds…