Related papers: Primitive normalisers in quasipolynomial time

We show that every finite group $T$ is isomorphic to a normalizer quotient $N_{S_n}(H)/H$ for some $n$ and a subgroup $H\leq S_n$. We show that this holds for all large enough $n\ge n_0(T)$ and also with $S_n$ replaced by $A_n$. The two…

Let $K$ be a number field and let $G$ be a finitely generated subgroup of $K^\times$. For all but finitely many primes $\mathfrak p$ of $K$, the reduction $(G \bmod \mathfrak p)$ generates a well-defined subgroup of the multiplicative group…

We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.

Let $G = X \wr H$ be the wreath product of a nontrivial finite group $X$ with $k$ conjugacy classes and a transitive permutation group $H$ of degree $n$ acting on the set of $n$ direct factors of $X^n$. If $H$ is semiprimitive, then $k(G)…

We consider the problem of enumerating all minimal transversals (also called minimal hitting sets) of a hypergraph $\mathcal{H}$. An equivalent formulation of this problem known as the \emph{transversal hypergraph} problem (or…

A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…

Power series expansions naturally arise whenever solutions of ordinary differential equations are studied in the regime of perturbation theory. In the case of quasi-periodic solutions the issue of convergence of the series is plagued of the…

A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…

The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…

Let $\mathcal P(S)$ be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup $S$ with the operation of setwise multiplication induced by $S$ itself. We call a subsemigroup $P$ of…

Let $D$ be a division ring with infinite center, $K$ a proper division subring of $D$ and $N$ an almost subnormal subgroup of the multiplicative group $D^*$ of $D$. The aim of this paper is to show that if $K$ is $N$-invariant and $N$ is…

In a recent paper, Kuperberg described the first subexponential time algorithm for solving the dihedral hidden subgroup problem. The space requirement of his algorithm is super-polynomial. We describe a modified algorithm whose running time…

The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the shortest vector problem. The celebrated polynomial-time quantum…

We obtain a characterization of the binary commutator on completely simple semigroups, using their Rees matrix representation. Consequently, we prove that a regular semigroup is nilpotent (solvable) if and only if it is simple, and all its…

Given a supersingular elliptic curve E and a non-scalar endomorphism $\alpha$ of E, we prove that the endomorphism ring of E can be computed in classical time about disc(Z[$\alpha$])^1/4 , and in quantum subexponential time, assuming the…

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

In the classical Subset Sum problem we are given a set $X$ and a target $t$, and the task is to decide whether there exists a subset of $X$ which sums to $t$. A recent line of research has resulted in $\tilde{O}(t)$-time algorithms, which…

Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G|…

Let $X$ be a finite set such that $|X|=n$, and let $k< n/2$. A group is $k$-homogeneous if it has only one orbit on the sets of size $k$. The aim of this paper is to prove some general results on permutation groups and then apply them to…

This article investigates the existence of an $r$-primitive $k$-normal polynomial, defined as the minimal polynomial of an $r$-primitive $k$-normal element in $\mathbb{F}_{q^n}$, with a specified degree $n$ and two given coefficients over…