Related papers: The word problem in Hanoi Towers groups
Let $G$ be a solvable subgroup of the group $\diff{}{n}$ of local complex analytic diffeomorphisms. Analogously as for groups of matrices we bound the solvable length of $G$ by a function of $n$. Moreover we provide the best possible bounds…
On the one hand, it is well known that the only subquadratic Dehn function of finitely presented groups is the linear one. On the other hand there is a huge class of Dehn functions $d(n)$ with growth at least $n^4$ (essentially all possible…
The invariant subalgebra H^+ of the Heisenberg vertex algebra H under its automorphism group Z/2Z was shown by Dong-Nagatomo to be a W-algebra of type W(2,4). Similarly, the rank n Heisenberg vertex algebra H(n) has the orthogonal group…
Let $H\leq K$ be subgroups of a group G. We say that H is strongly closed in K with respect to G if whenever $a^g \in K$ where $a \in H, g \in G,$ then $a^g \in H.$ In this paper, we investigate the structure of a group G under the…
In this paper we prove two new results about closed semigroups in the family of solvable groups H_{mn} that are semidirect products of R^m and R^n, and for which the structure homomorphism maps nontrivially into the center of Aut(R^n). The…
Given a multiset $S$ of $n$ positive integers and a target integer $t$, the subset sum problem is to decide if there is a subset of $S$ that sums up to $t$. We present a new divide-and-conquer algorithm that computes all the realizable…
We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…
Given a set $P$ of $n$ weighted points and a set $S$ of $m$ disks in the plane, the hitting set problem is to compute a subset $P'$ of points of $P$ such that each disk contains at least one point of $P'$ and the total weight of all points…
It is known that $N(n)$, the maximum number of mutually orthogonal latin squares of order $n$, satisfies the lower bound $N(n) \ge n^{1/14.8}$ for large $n$. For $h\ge 2$, relatively little is known about the quantity $N(h^n)$, which…
We prove the exact formulae for the expected number of moves to solve several variants of the Tower of Hanoi puzzle with 3 pegs and n disks, when each move is chosen uniformly randomly from the set of all valid moves. We further present an…
For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…
Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of…
A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…
We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining…
A large number of NP-hard graph problems can be solved in $f(w)n^{O(1)}$ time and space when the input graph is provided together with a tree decomposition of width $w$, in many cases with a modest exponential dependence $f(w)$ on $w$.…
The celebrated Time Hierarchy Theorem for Turing machines states, informally, that more problems can be solved given more time. The extent to which a time hierarchy-type theorem holds in the distributed LOCAL model has been open for many…
The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…
We prove the subsolution theorem for the complex Hessian equations in a smoothly bounded strongly $m$-pseudoconvex domain, $1 < m < n$, in $\bC^n$.
We consider the {\em Shaped Partition Problem} of partitioning $n$ given vectors in real $k$-space into $p$ parts so as to maximize an arbitrary objective function which is convex on the sum of vectors in each part, subject to arbitrary…
Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…