Related papers: Numerical computation of braid groups
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
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…
We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…
We present a method for calculating the Brauer group of a surface given by a diagonal equation in the projective space. For diagonal quartic surfaces with coefficients in Q we determine the Brauer groups over Q and Q(i).
We generalize the Moishezon Teicher algorithm that was suggested for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curves, and enables the computation of braid monodromy not only…
A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.
We show that for every fixed non-negative integer k there is a quadratic time algorithm that decides whether a given graph has crossing number at most k and, if this is the case, computes a drawing of the graph in the plane with at most k…
An efficient algorithm for computing the branching structure of a compact Riemann surface defined via an algebraic curve is presented. Generators of the fundamental group of the base of the ramified covering punctured at the discriminant…
In this paper we give a linear time algorithm for computing the number of spanninig trees in double nested graphs.
Burau representation of the Artin braid group remains as one of the very important representations for the braid group. Partly, because of its connections to the Alexander polynomial which is one of the first and most useful invariants for…
This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…
In this paper, we give two algorithms to compute preimages of curves under polynomial endomorphisms. In particular, this gives an efficient way of computing preimages of points. Furthermore, we explain the abstract setting under which one…
We briefly describe a new general algorithm for carrying out QCD calculations to next-to-leading order in perturbation theory. The algorithm can be used for computing arbitrary jet cross sections in arbitrary processes and can be…
A program to calculate the three-particle hyperspherical brackets is presented. Test results are listed and it is seen that the program is well applicable up to very high values of the hypermomentum and orbital momenta. The listed runs show…
For $n \geq 2$ we describe an $O(l^3n)$-time algorithm that determines if a length $l$ virtual braid word in the standard presentation of the virtual braid group ${\mathcal VB}_n$ represents the trivial virtual braid.
I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…
The computation of the normaliser of a permutation group in the full symmetric group is an important and hard problem in computational group theory. This article reports on an algorithm that builds a descending chain of overgroups to…
A new method for deriving universal \v{R} matrices from braid group representation is discussed. In this case, universal \v{R} operators can be defined and expressed in terms of products of braid group generators. The advantage of this…
A new approach is presented to evaluate multi-loop integrals, which appear in the calculation of cross-sections in high-energy physics. It relies on a fully numerical method and is applicable to a wide class of integrals with various mass…
We provide an algorithm to compute generators of the orthogonal group of the discriminant group associated to an integral quadratic lattice over the integers. We give a closed formula for its order.