相关论文: Subgroups of minimal index in polynomial time

The $H$-Induced Minor Containment problem ($H$-IMC) consists in deciding if a fixed graph $H$ is an induced minor of a graph $G$ given as input, that is, whether $H$ can be obtained from $G$ by deleting vertices and contracting edges.…

Suppose that a locally finite group $G$ has a $2$-element $g$ with Chernikov centralizer. It is proved that if the involution in $\langle g\rangle$ has nilpotent centralizer, then $G$ has a soluble subgroup of finite index.

We use cyclotomy to design new classes of permutation polynomials over finite fields. This allows us to generate many classes of permutation polynomials in an algorithmic way. Many of them are permutation polynomials of large indices.

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…

The asymptotic study of the conjugacy classes of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of…

We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…

We compute the small cohomology ring of the Cayley Grassmannian, that parametrizes four-dimensional subalgebras of the complexified octonions. We show that all the Gromov-Witten invariants in the multiplication table of the Schubert classes…

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

Let $F_k$ be the free group on $k$ generators, and let $H\le J\le \F_k$ be subgroups of finite rank. We present a new elementary algorithm to determine whether $H$ is a free factor of $J$. In particular, this algorithm can determine whether…

We prove that if $G$ is a finitely generated group and $Z$ is a uniformly recurrent subgroup of $G$ then there exists a minimal system $(X,G)$ with $Z$ as its stability system. This answers a query of Glasner and Weiss \cite{GW} in the case…

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

The set of all permutations with $n$ symbols is a symmetric group denoted by $S_n$. A transposition tree, $T$, is a spanning tree over its $n$ vertices $V_T=${$1, 2, 3, \ldots n$} where the vertices are the positions of a permutation $\pi$…

Let $G$ be a finite group, and let $\pi$ be a set of primes. The aim of this paper is to obtain some results concerning how much information about the $\pi$-structure of $G$ can be gathered from the knowledge of the lengths of conjugacy…

The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

We show that if G is a finite group whose commutator subgroup [G,G] has order 2p, where p is an odd prime, then every connected Cayley graph on G has a hamiltonian cycle.

Let for a prime $p$, $\mathfrak{X}$ (respectively $\mathfrak{Y}$) be the class of all $p$-biprimitively finite (respectively periodic $p$-conjugatively biprimitively finite) groups and $G\in \mathfrak{X}$ (respectively $G\in \mathfrak{Y}$),…

Let G,H be closed permutation groups on an infinite set X, with H a subgroup of G. It is shown that if G and H are orbit-equivalent, that is, have the same orbits on the collection of finite subsets of X, and G is primitive but not…

Given two subgroups $H,K$ of a finite group $G$, the probability that a pair of random elements from $H$ and $K$ commutes is denoted by $Pr(H,K)$. Suppose that a finite group $G$ admits a group of coprime automorphisms $A$ and let…

We present an algorithm that, given finite simplicial sets $X$, $A$, $Y$ with an action of a finite group $G$, computes the set $[X,Y]^A_G$ of homotopy classes of equivariant maps $\ell \colon X \to Y$ extending a given equivariant map $f…