Efficient computations with counting functions on free groups and free monoids

09/30/2021
by   Tobias Hartnick, et al.
0

We present efficient algorithms to decide whether two given counting functions on non-abelian free groups or monoids are at bounded distance from each other and to decide whether two given counting quasimorphisms on non-abelian free groups are cohomologous. We work in the multi-tape Turing machine model with non-constant time arithmetic operations. In the case of integer coefficients we construct an algorithm of linear space and time complexity (assuming that the rank is at least 3 in the monoid case). In the case of rational coefficients we prove that the time complexity is O(Nlog N), where N denotes the size of the input, i.e. it is as fast as addition of rational numbers (implemented using the Harvey–van der Hoeven algorithm for integer multiplication). These algorithms are based on our previous work which characterizes bounded counting functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/13/2020

Transforming ODEs and PDEs with radical coefficients into rational coefficients

We present an algorithm that transforms, if possible, a given ODE or PDE...
research
04/20/2003

Whitehead method and Genetic Algorithms

In this paper we discuss a genetic version (GWA) of the Whitehead's algo...
research
10/16/2020

Near-Linear Time Homomorphism Counting in Bounded Degeneracy Graphs: The Barrier of Long Induced Cycles

Counting homomorphisms of a constant sized pattern graph H in an input g...
research
03/26/2018

Left-eigenvectors are certificates of the Orbit Problem

This paper investigates the connexion between the Kannan-Lipton Orbit Pr...
research
08/20/2023

Computational complexity of counting coincidences

Can you decide if there is a coincidence in the numbers counting two dif...
research
05/10/2019

Integrality and arithmeticity of solvable linear groups

We develop a practical algorithm to decide whether a finitely generated ...
research
10/12/2020

On lattice point counting in Δ-modular polyhedra

Let a polyhedron P be defined by one of the following ways: (i) P = {x...

Please sign up or login with your details

Forgot password? Click here to reset