Related papers: Necklaces over a group with identity product

Let $A$, $B$, and $C$ be three $n\times n$ matrices. We investigate the problem of verifying whether $AB=C$ over the ring of integers and finding the correct product $AB$. Given that $C$ is different from $AB$ by at most $k$ entries, we…

In this paper, the cyclic codes of length $n$, where $n$ is odd with certain restrictions, over a finite chain ring $R$, have been studied using the structure of group algebra approach. The primitive idempotents of $RG$ of a finite cyclic…

Let $G$ be a finite group. A sequence over $G$ means a finite sequence of terms from $G$, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can be ordered such that their product…

Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…

We show that the commutator subgroup G' of a classical knot group G need not have subgroups of every finite index, but it will if G' has a surjective homomorphism to the integers and we give an exact criterion for that to happen. We also…

Let $M_n$ be the topological moduli space of all parallel n-cables of long framed oriented knots in 3-space. We construct in a combinatorial way for each natural number $n>1$ a 1-cocycle $R_n$ which represents a non trivial class in…

We resolve the computational complexity of two problems known as NECKLACE-SPLITTING and DISCRETE HAM SANDWICH, showing that they are PPA-complete. For NECKLACE SPLITTING, this result is specific to the important special case in which two…

The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In…

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

We generalize the classical Post correspondence problem ($\mathbf{PCP}_n$) and its non-homogeneous variation ($\mathbf{GPCP}_n$) to non-commutative groups and study the computational complexity of these new problems. We observe that…

This paper continues the study of two numbers that are associated with Lie groups. The first number is $N(G,m)$, the number of conjugacy classes of elements in $G$ whose order divides $m$. The second number is $N(G,m,s)$, the number of…

One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…

For a finite group $G,$ we define the concept of $G$-partial permutation and use it to show that the structure coefficients of the center of the wreath product $G\wr \mathcal{S}_n$ algebra are polynomials in $n$ with non-negative integer…

The necklace braid group $\mathcal{NB}_n$ is the motion group of the $n+1$ component necklace link $\mathcal{L}_n$ in Euclidean $\mathbb{R}^3$. Here $\mathcal{L}_n$ consists of $n$ pairwise unlinked Euclidean circles each linked to an…

In this article we show that if ${\cal V}$ is the variety of polynilpotent groups of class row $(c_1,c_2,...,c_s),\ {\mathcal N}_{c_1,c_2,...,c_s}$, and $G\cong{\bf {Z}}_{p^{\alpha_1}}\stackrel{n}{*}{\bf…

For a fixed $n\ge2$, the Houghton group $H_n$ consists of bijections of $X_n=\{1,\ldots,n\} \times \mathbb{N}$ that are `eventually translations' of each copy of $\mathbb{N}$. The Houghton groups have been shown to have solvable conjugacy…

For any positive integer $n$, $\mathcal{A}_n$ is the class of all groups $G$ such that, for $0\leq i\leq n$, $H^i(\hat{G},A)\cong H^i(G,A)$ for every finite discrete $\hat{G}$-module $A$. We describe certain types of free products with…

Let G denote either a special orthogonal group or a symplectic group defined over the complex numbers. We prove the following saturation result for G: given dominant weights \lambda^1, ..., \lambda^r such that the tensor product…

In this paper, we introduce a new nontrivial filtration, called F-order, for classical and virtual knot invariants; this filtration produces filtered knot invariants, which are called finite type invariants similar to Vassiliev knot…

This paper contains the first knot polynomials which can distinguish the orientations of classical knots and which make no excplicit use of the knot group. But they make extensive use of the meridian and of the longitude in a geometric way.…