Related papers: Notes on the hidden subgroup problem on some semi-…
Coclass theory has been a highly successful approach towards the investigation and classification of finite nilpotent groups. Here we suggest a similar approach for finite nilpotent semigroups. This differs from the group theory setting in…
We present a quantum algorithm for the dihedral hidden subgroup problem with time and query complexity $O(\exp(C\sqrt{\log N}))$. In this problem an oracle computes a function $f$ on the dihedral group $D_N$ which is invariant under a…
In this survey, we describe a general key exchange protocol based on semidirect product of (semi)groups (more specifically, on extensions of (semi)groups by automorphisms), and then focus on practical instances of this general idea. This…
Product systems are the classifying structures for semigroups of endomorphisms of B(H), in that two $E_0$-semigroups are cocycle conjugate iff their product systems are isomorphic. Thus it is important to know that every abstract product…
We develop a structure theory of connected solvable spherical subgroups in semisimple algebraic groups. Based on this theory, we obtain an explicit classification of all such subgroups up to conjugation.
The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
We introduce the Hidden Polynomial Function Graph Problem as a natural generalization of an abelian Hidden Subgroup Problem (HSP) where the subgroups and their cosets correspond to graphs of linear functions over the finite field F_p. For…
An abstract sampling theory associated to a unitary representation of a countable discrete non abelian group $G$, which is a semi-direct product of groups, on a separable Hilbert space is studied. A suitable expression of the data samples…
In this paper homotopical methods for the description of subgroups determined by ideals in group rings are introduced. It is shown that in certain cases the subgroups determined by symmetric product of ideals in group rings can be described…
In this paper we make a step towards a time and space efficient algorithm for the hidden shift problem for groups of the form $\mathbb{Z}_k^n$. We give a solution to the case when $k$ is a power of 2, which has polynomial running time in…
We present some constructions of groupoids as: direct product, semidirect product, and we give necessary and sufficient conditions for a groupoid to be embedded into a direct product of groupoids. Also, we establish necessary and sufficient…
Discrete subgroups of SL(2,R) are well understood, and classified by the geometry of the corresponding hyperbolic surfaces. Discrete subgroups of higher-rank semisimple Lie groups, such as SL(n,R) for n>2, remain more mysterious. While…
We discuss a general framework of monotone skew-product semiflows under a connected group action. In a prior work, a compact connected group $G$-action has been considered on a strongly monotone skew-product semiflow. Here we relax the…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
First of all, we recall the well known notion of semidirect product both for classical algebraic structures (like groups and rings) and for more recent ones (digroups, left skew braces, heaps, trusses). Then we analyse the concept of…
It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\log |G|$) number of calls to the oracle function, the states corresponding to…
The paper is devoted to projective Clifford groups of quantum $N$-dimensional systems. Clearly, Clifford gates allow only the simplest quantum computations which can be simulated on a classical computer (Gottesmann-Knill theorem). However,…
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.