Related papers: Hensel lifting algorithms for quadratic forms
The goal of this paper is to demonstrate the use of techniques from hyperbolic geometry to compute generating sets of certain subgroups of $SL^+(2,\mathbb{C})$; specifically, $SO^+(Q,\mathbb{Z})$ for $Q$ some integral quadratic form of…
For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…
Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…
We study a q-generalization of the classical Laguerre/Hermite orthogonal polynomials. Explicit results include: the recursive coefficients, matrix elements of generators for the Heisenberg algebra, and the Hankel determinants. The power of…
Matrix elements of irreducible representations of the Lorentz group are calculated on the basis of complex angular momentum. It is shown that Laplace-Beltrami operators, defined in this basis, give rise to Fuchsian differential equations.…
In recent developments, a general approach for solving Riemann--Hilbert problems numerically has been developed. We review this numerical framework, and apply it to the calculation of orthogonal polynomials on the real line. Combining this…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
We study the fundamental algorithmic rigidity problems for generic frameworks periodic with respect to a fixed lattice or a finite-order rotation in the plane. For fixed-lattice frameworks we give an $O(n^2)$ algorithm for deciding generic…
A new way of orthogonalizing ensembles of vectors by "lifting" them to higher dimensions is introduced. This method can potentially be utilized for solving quantum decision and computing problems.
We derive certain systems of differential equations for matrix elements of products and iterates of logarithmic intertwining operators among strongly graded generalized modules for a strongly graded conformal vertex algebra under suitable…
The goal of this work is to fill a gap in [Yang, SIAM J. Matrix Anal. Appl, 41 (2020), 1797--1825]. In that work, an approximation procedure was proposed for orthogonal low-rank tensor approximation; however, the approximation lower bound…
We develop coarse-graining tensor renormalization group algorithms to compute physical properties of two-dimensional lattice models on finite periodic lattices. Two different coarse-graining strategies, one based on the tensor…
We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…
We give an explicit formula for the Hankel transform of a regular sequence in terms of the coefficients of the associated orthogonal polynomials and the sequence itself. We apply this formula to some sequences of combinatorial interest,…
The aim of this paper is to study the group of isomorphism classes of torsors of finite flat group schemes of rank 2 over a commutative ring $R$. This, in particular, generalises the group of quadratic algebras (free or projective), which…
We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…
We give an algorithm to compute weighted Ehrhart functions of lattice polytopes for polynomial weights using Lagrange interpolation. We show how to compute generating functions of polynomials using those of unit cubes and Eulerian numbers,…
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…
We use generating functions to express orthogonality relations in the form of $q$-beta integrals. The integrand of such a $q$-beta integral is then used as a weight function for a new set of orthogonal or biorthogonal