Related papers: On Complexity of the Word Problem in Braid Groups …
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov and Won that the Word Problem of the one-relator Baumslag…
We prove the following results. Let w be a multilinear commutator word. If G is a profinite group in which all w-values are contained in a union of countably many periodic subgroups, then the verbal subgroup w(G) is locally finite. If G is…
Let $w=w(x_1,...,x_n)$ be a word, i.e. an element of the free group $F = \langle x_1,...,x_n \rangle$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\{ w(x_1,...,x_n) : x_1,...,x_n \in G \}$ of all…
We show that for any given n, there exists a sequence of words a_k in the generators sigma_1, ... sigma_{n-1} of the braid group B_n, representing the identity element of B_n, such that the number of braid relations of the form sigma_i…
We study the configuration space of distinct, unordered points on compact orientable surfaces of genus $g$, denoted $S_g$. Specifically, we address the section problem, which concerns the addition of $n$ distinct points to an existing…
A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in \mathbb N$, the NP-hard Geodetic Set problem asks whether there is a geodetic set of size…
We show that the class of groups with $k$-multiple context-free word problem is closed under graphs of groups with finite edge groups.
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter…
We study a geometric representation problem, where we are given a set $\cal R$ of axis-aligned rectangles with fixed dimensions and a graph with vertex set $\cal R$. The task is to place the rectangles without overlap such that two…
A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph $G$, the minimum such number (over all drawings in dimension $d \in…
We investigate the problem of the maximum number of cubic subwords (of the form $www$) in a given word. We also consider square subwords (of the form $ww$). The problem of the maximum number of squares in a word is not well understood.…
We give practical, efficient algorithms that automatically determine the asymptotic distributed round complexity of a given locally checkable graph problem in the $[\Theta(\log n), \Theta(n)]$ region, in two settings. We present one…
We combine concepts from random matrix theory and free probability together with ideas from the theory of commutator length in groups and maps from surfaces, and establish new connections between the two. More particularly, we study…
In the Colored Clustering problem, one is asked to cluster edge-colored (hyper-)graphs whose colors represent interaction types. More specifically, the goal is to select as many edges as possible without choosing two edges that share an…
Given an infinite linear group with a finite set of generators, we show that the shortest word length of an element of infinite order has an upper bound that depends only on the number of generators and the degree. This provides a…
Let $\Sigma_g$ denote the closed orientable surface of genus $g$ and fix an arbitrary simplicial triangulation of $\Sigma_g$. We construct and study a natural surjective group homomorphism from the surface braid group on $n$ strands on…
\noindent Given a Riemann surface $M$, the \emph{complexity} of a branched cover of $M$ to the Riemann sphere $S^2$, of degree $d$ and with branching set of cardinality $n \geq 3$, is defined as $d$ times the hyperbolic area of the…
A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. The problem whether every word is concise in the…
Let $N_{g,n}$ be a genus $g$ compact non-orientable surface with $n$ boundaries. We explain about relations on the level $d$ mapping class group $\mathcal{M}_d(N_{g,0})$ of $N_{g,0}$ and the level $d$ principal congruence subgroup…
Group languages are regular languages recognized by finite groups, or equivalently by finite automata in which each letter induces a permutation on the set of states. We investigate the separation problem for this class of languages: given…