Related papers: Primitive normalisers in quasipolynomial time

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 show that several problems that figure prominently in quantum computing, including Hidden Coset, Hidden Shift, and Orbit Coset, are equivalent or reducible to Hidden Subgroup for a large variety of groups. We also show that, over…

We discuss space-time symmetric Hamiltonian operators of the form $% H=H_{0}+igH^{\prime}$, where $H_{0}$ is Hermitian and $g$ real. $H_{0}$ is invariant under the unitary operations of a point group $G$ while $H^{\prime}$ is invariant…

Given a transitive permutation group G of degree n , we seek to determine whether or not G is primitive, and to find a system of blocks of imprimitivity in the case that G is imprimitive. An algorithm of Atkinson solves this problem in time…

This paper considers submodular function minimization (SFM) restricted to a family of subsets. We show that SFM over complements of families with certain hierarchical structures can be solved in polynomial-time. This yields a…

We study the Identity Problem, the problem of determining if a finitely generated semigroup of matrices contains the identity matrix; see Problem 3 (Chapter 10.3) in ``Unsolved Problems in Mathematical Systems and Control Theory'' by…

The paper extends three results regarding the nth root problem by embedding classes of Hilbert-space operators into the class of posinormal operators. For instance, it is shown that (i) for coposinormal operators, if T is paranormal and T^n…

We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…

Let $\mathfrak F$ be a formation and let $G$ be a group. A subgroup $H$ of $G$ is $\mathrm{K}\mathfrak F$-subnormal (submodular) in $G$ if there is a subgroup chain $H=H_0\le \ H_1 \le \ \ldots \le H_i \leq H_{i+1}\le \ldots \le \ H_n=G$…

Let $G$ be a finite group and let $H$ be a proper subgroup of $G$ of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing $|G : H|$ for a permutation group $G$. Moreover, we find $H$…

We consider the following general hidden hubs model: an $n \times n$ random matrix $A$ with a subset $S$ of $k$ special rows (hubs): entries in rows outside $S$ are generated from the probability distribution $p_0 \sim N(0,\sigma_0^2)$; for…

We first compare several algebraic notions of normality, from a categorical viewpoint. Then we introduce an intrinsic description of Higgins' commutator for ideal-determined categories, and we define a new notion of normality in terms of…

We examine two natural operations to create numerical semigroups. We say that a numerical semigroup $\mathcal{S}$ is $k$-normalescent if it is the projection of the set of integer points in a $k$-dimensional polyhedral cone, and we say that…

Let $G$ be a finite solvable group and $H$ a non-normal core-free subgroup of $G$. We show that if the normalizer of any non-trivial normal subgroup of $Fit(H)$ is equal $H$, then $H$ has a nilpotent normal complement $K$ such that $G=KH$…

Let $P\in Sp(2n)$ satisfying $P^{k}=I_{2n}$, we consider the minimal $P$-symmetric period problem of the autonomous nonlinear Hamiltonian system \begin{equation*} \dot x(t) = JH^{\prime}(x(t)). \end{equation*} For some symplectic matrices…

Let $G=F\ast_\varphi t$ be an HNN extension of a free group $F$ with two equal associated normal subgroups $H_1 = H_2$ of finite index. We prove that the word problem in $G$ is decidable in polynomial time. This result extends to the case…

Let $p$ be a prime number, $G$ be a $p$-solvable finite group and $P$ be a Sylow $p$-subgroup of $G$. We prove that $G$ is $p$-supersolvable if $N_G(P)$ is $p$-supersolvable and if there is a subgroup $H$ of $P$ with $P' \le H \le \Phi(P)$…

This paper concerns the general problem of classifying the finite deterministic automata that admit a synchronizing (or reset) word. (For our purposes it is irrelevant if the automata has initial or final states.) Our departure point is the…

We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…

Let $X$ be a finite set such that $|X|=n$. Let $\trans$ and $\sym$ denote respectively the transformation monoid and the symmetric group on $n$ points. Given $a\in \trans\setminus \sym$, we say that a group $G\leq \sym$ is $a$-normalizing…