Related papers: A quasi-linear time algorithm for computing modula…
One of the oldest methods for computing invariants of ordinary differential equations is tested using the full Toda lattice model. We show that the standard method of undetermined coefficients and modern symbolic algebra tools together with…
We develop a new method for analyzing moduli problems related to the stack of pure coherent sheaves on a polarized family of projective schemes. It is an infinite-dimensional analogue of geometric invariant theory. We apply this to two…
In an important paper, Zagier proved that certain half-integral weight modular forms are generating functions for traces of polynomials in the $j$-function. It turns out that Zagier's work makes it possible to algorithmically compute…
We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…
A general method based on the polynomial deformations of the Lie algebra sl(2,R) is proposed in order to exhibit the quasi-exactly solvability of specific Hamiltonians implied by quantum physical models. This method using the…
We propose an algorithm which allows to derive the generalized Alexander polynomial invariants of knots and links with the help of the q,p-numbers, appearing in bosonic two-parameter quantum algebra. These polynomials turn into HOMFLY ones…
The aim of this paper is to give an explicit formula of the invariant distribution of a quasi-birth-and-death process in terms of the block entries of the transition probability matrix using a matrix-valued orthogonal polynomials approach.…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…
We present a bounded probability algorithm for the computation of the Chow forms of the equidimensional components of an algebraic variety. Its complexity is polynomial in the length and in the geometric degree of the input equation system…
We adapt the quasi-monotone method from [2] for composite convex minimization in the stochastic setting. For the proposed numerical scheme we derive the optimal convergence rate in terms of the last iterate, rather than on average as it is…
In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree $n$ over a finite field and their roots in the extension field in quasilinear where $N=n^2$…
We consider a generalisation of Ulam's method for approximating invariant densities of one-dimensional chaotic maps. Rather than use piecewise constant polynomials to approximate the density, we use polynomials of degree n which are defined…
We publish a table of primitive finite-type invariants of order less than or equal to six, for knots of ten or fewer crossings. We note certain mod-2 congruences, one of which leads to a chirality criterion in the Alexander polynomial. We…
Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…
Computing topological invariants in two-dimensional quasicrystals and super-moire matter is a remarkable open challenge, due to the absence of translational symmetry and the colossal number of sites inherent to these systems. Here, we…
We introduce theta-functions of VOA-modules and show that the space spanned by them has a modular invariance property.
The properties of matrix valued polynomials generated by the scalar-type Rodrigues' formulas are analyzed. A general representation of these polynomials is found in terms of products of simple differential operators. The recurrence…
In a recent paper with Sahi and Stokman, we introduced quasi-polynomial generalizations of Macdonald polynomials for arbitrary root systems via a new class of representations of the double affine Hecke algebra. These objects depend on a…
We simplify Hitchin's description of SU(2)-invariant self-dual Einstein metrics, making use of the tau-function of related four-pole Schlesinger system.