Related papers: Class polynomials for nonholomorphic modular funct…
Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…
CFTs are naturally defined on Riemann surfaces. The rational ones can be solved using methods from algebraic geometry. One particular feature is the covariance of the partition function under the mapping class group. In genus $g=1$, this…
Computation of the spherical harmonic rotation coefficients or elements of Wigner's d-matrix is important in a number of quantum mechanics and mathematical physics applications. Particularly, this is important for the Fast Multipole Methods…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
We realise non-unitary fusion categories using subfactor-like methods, and compute their quantum doubles and modular data. For concreteness we focus on generalising the Haagerup-Izumi family of Q-systems. For example, we construct…
In this note we provide an algorithm for computing the fractional integrals of orthogonal polynomials, which is more stable than that using the expression of the polynomials w.r.t. the canonical basis. This algorithm is aimed at solving…
Planar holomorphic systems $\dot{x}=u(x,y)$, $\dot{y}=v(x,y)$ are those that $u=\operatorname{Re}(f)$ and $v=\operatorname{Im}(f)$ for some holomorphic function $f(z)$. They have important dynamical properties, highlighting, for example,…
The Fokker-Planck equation models rare events across sciences, but its high-dimensional nature challenges classical computers. Quantum algorithms for such non-unitary dynamics often suffer from exponential {decay in} success probability. We…
We introduce a fluid dynamics algorithm that performs with nearly spectral accuracy, but uses finite-differences instead of FFTs to compute gradients and thus executes 10 times faster. The finite differencing is not based on a high-order…
We introduce a type of graph integrals on elliptic curves from the heat kernel. We show that such graph integrals have modular properties under the modular group $SL(2, \Z)$, and prove the polynomial nature of the anti-holomorphic…
We perform a study of the moduli space of framed torsion-free sheaves on Hirzebruch surfaces by using localization techniques. We discuss some general properties of this moduli space by studying it in the framework of Huybrechts-Lehn theory…
We present a new algorithm which is named the Dynamical Functional Particle Method, DFPM. It is based on the idea of formulating a finite dimensional damped dynamical system whose stationary points are the solution to the original…
We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…
We propose an approach to determine the continual progression of algorithmic efficiency, as an alternative to standard calculations of time complexity, likely, but not exclusively, when dealing with data structures with unknown maximum…
This note provides new methods for constructing quadratic nonresidues in finite fields of characteristic p. It will be shown that there is an effective deterministic polynomial time algorithm for constructing quadratic nonresidues in finite…
In this paper, we consider nonlocal, nonlinear partial differential equations to model anisotropic dynamics of complex root sets of random polynomials under differentiation. These equations aim to generalise the recent PDE obtained by…
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
For smooth finite fields $F_q$ (i.e., when $q-1$ factors into small primes) the Fast Fourier Transform (FFT) leads to the fastest known algebraic algorithms for many basic polynomial operations, such as multiplication, division,…
We give a deterministic polynomial time algorithm to compute the endomorphism ring of a supersingular elliptic curve in characteristic p, provided that we are given two noncommuting endomorphisms and the factorization of the discriminant of…