相关论文: On Complexity of the Word Problem in Braid Groups …

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…

Let $w$ be a word in $k$ variables. For a finite nilpotent group $G$, a conjecture of Amit states that $N_w(1) \ge |G|^{k-1}$, where $N_w(1)$ is the number of $k$-tuples $(g_1,...,g_k)\in G^{(k)}$ such that $w(g_1,...,g_k)=1$. Currently,…

The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…

In this work, we study the relative hardness of fundamental problems with state-of-the-art word RAM algorithms that take $O(n\sqrt{\log n})$ time for instances described in $\Theta(n)$ machine words ($\Theta(n\log n)$ bits). This complexity…

Given a tree $T$ on $n$ vertices, and $k, b, s_1, \ldots, s_b \in N$, the Tree Partitioning problem asks if at most $k$ edges can be removed from $T$ so that the resulting components can be grouped into $b$ groups such that the number of…

Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…

We investigate the computational complexity of some problems in three-dimensional topology and geometry. We show that the problem of determining a bound on the genus of a knot in a 3-manifold, is NP-complete. Using similar ideas, we show…

This paper proposes for every $n$, linear time reductions of the word and conjugacy problems on the braid groups $B_n$ to the corresponding problems on the braid monoids $B_n^+$ and moreover only using positive words representations.

The factor complexity function $C_w(n)$ of a finite or infinite word $w$ counts the number of distinct factors of $w$ of length $n$ for each $n \ge 0$. A finite word $w$ of length $|w|$ is said to be trapezoidal if the graph of its factor…

In this paper we investigate the descriptional complexity of knot theoretic problems and show upper bounds for planarity problem of signed and unsigned knot diagrams represented by Gauss words. Since a topological equivalence of knots can…

In this paper, we classify homomorphisms from the braid group of $n$ strands to the mapping class group of a genus $g$ surface. In particular, we show that when $g<n-2$, all representations are either cyclic or standard. Our result is sharp…

Waring's classical problem deals with expressing every natural number as a sum of g(k) k-th powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the k-th…

Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…

We prove that elements of the Hanoi Towers groups $\mathcal{H}_m$ have depth bounded from above by a poly-logarithmic function $O(\log^{m-2} n)$, where $n$ is the length of an element. Therefore the word problem in groups $\mathcal{H}_m$ is…

For a group G and a positive integer n write B_n(G) = {x \in G : |x^G | \le n}. If s is a positive integer and w is a group word, say that G satisfies the (n,s)-covering condition with respect to the word w if there exists a subset S of G…

In a simple pattern matching problem one has a pattern $w$ and a text $t$, which are words over a finite alphabet $\Sigma$. One may ask whether $w$ occurs in $t$, and if so, where? More generally, we may have a set $P$ of patterns and a set…

Let $\Sigma_{g,p}$ be an orientable surface of genus $g$ and of finite type without boundary (i.e. an orientable closed surface with a finite number $p$ of points removed). In this paper we study the R$_{\infty}$-property for the surface…

A non-empty word $w$ is a border of the word $u$ if $\vert w\vert<\vert u\vert$ and $w$ is both a prefix and a suffix of $u$. A word $u$ with the border $w$ is closed if $u$ has exactly two occurrences of $w$. A word $u$ is privileged if…

Balliu et al. (DISC 2020) classified the hardness of solving binary labeling problems with distributed graph algorithms; in these problems the task is to select a subset of edges in a $2$-colored tree in which white nodes of degree $d$ and…

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…