Related papers: On computing the closures of solvable permutation …

Let $G$ be a permutation group on a finite set $\Omega$. The $k$-closure $G^{(k)}$ of the group $G$ is the largest subgroup of $\operatorname{Sym}(\Omega)$ having the same orbits as $G$ on the $k$-th Cartesian power $\Omega^k$ of $\Omega$.…

In this paper, we present an algorithm that enumerates a certain class of signed permutations, referred to as grid signed permutation classes. In the case of permutations, the corresponding grid classes are of interest because they are…

We consider two group actions on $m$-tuples of $n \times n$ matrices. The first is simultaneous conjugation by $\operatorname{GL}_n$ and the second is the left-right action of $\operatorname{SL}_n \times \operatorname{SL}_n$. We give…

We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let $\mu$ be a function on the subsets of vertices of a graph $G$. In the $(\mu,p,q)$-PARTITION problem, the task is to…

Let $\omega_\mathfrak{g}$ be a Lie algebra valued differential $1$-form on a manifold $M$ satisfying the structure equations $d \omega_\mathfrak{g} + \frac{1}{2} \omega_\mathfrak{g}\wedge \omega_\mathfrak{g}=0$ where $\mathfrak{g}$ is…

Let $D(M,N)$ be the set of integers that can be realized as the degree of a map between two closed connected orientable manifolds $M$ and $N$ of the same dimension. For closed $3$-manifolds with $S^3$-geometry $M$ and $N$, every such degree…

This paper presents an analysis of primitive permutation groups of degree $3p$, where $p$ is a prime number, analogous to H. Wielandt's treatment of groups of degree $2p$. It is also intended as an example of the systematic use of…

For each odd $m \geq 3$ we completely solve the problem of when an $m$-cycle system of order $u$ can be embedded in an $m$-cycle system of order $v$, barring a finite number of possible exceptions. In cases where $u$ is large compared to…

For $m=2$ and $m=3$ we prove that any connected, oriented, open manifold $M^m$ admits a simple branched covering map over $\mathbb{R}^m$. When $M$ has $k$ ends and $k$ is finite, the degree of the cover can be taken to be $mk$. Regardless…

Let G be a finite group. Denote by \psi(G) the sum \psi(G)=\sum_{x\in G}|x| where |x| denotes the order of the element x, and by o(G) the quotient o(G)=\frac{\psi(G)}{|G|}. Confirming a conjecture posed by E.I. Khukhro, A. Moreto and M.…

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

We study the random composition of a small family of O(n^3) simple permutations on {0,1}^n. Specifically we ask how many randomly selected simple permutations need be composed to yield a permutation that is close to k-wise independent. We…

Let $m$ be a positive integer and let $\rho(m,n)$ be the proportion of permutations of the symmetric group ${\rm Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where…

We prove that $n$-bit integers may be multiplied in $O(n \log n \, 4^{\log^* n})$ bit operations. This complexity bound had been achieved previously by several authors, assuming various unproved number-theoretic hypotheses. Our proof is…

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

In this paper we consider what can be computed by a user interacting with a potentially malicious server, when the server performs polynomial-time quantum computation but the user can only perform polynomial-time classical (i.e.,…

In this paper, we present a new method to construct solvable groups with derived length four and four character degrees. We then use this method to present a number of new families of groups with derived length four and four character…

We give an $O(n \log^3(n))$-time algorithm for the word problem in the mapping class group of a compact surface.

We develop an algorithm which, given a trained transformer model $\mathcal{M}$ as input, as well as a string of tokens $s$ of length $n_{fix}$ and an integer $n_{free}$, can generate a mathematical proof that $\mathcal{M}$ is…

We prove that an element $g$ of prime order $>3$ belongs to the solvable radical $R(G)$ of a finite (or, more generally, a linear) group if and only if for every $x\in G$ the subgroup generated by $g, xgx^{-1}$ is solvable. This theorem…