相关论文: Finding Blocks of Imprimitivity When There is a Sm…

Let $G \leqslant {\rm Sym}(\Omega)$ be a finite permutation group and recall that the base size of $G$ is the minimal size of a subset of $\Omega$ with trivial pointwise stabiliser. There is an extensive literature on base sizes for…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

In this paper, we study the problems of abelian group isomorphism and basis construction in two models. In the {\it partially specified model} (PS-model), the algorithm does not know the group size but can access randomly chosen elements of…

A base for a permutation group $G$ acting on a set $\Omega$ is a subset $\mathcal{B}$ of $\Omega$ whose pointwise stabiliser $G_{(\mathcal{B})}$ is trivial. There is a natural greedy algorithm for constructing a base of relatively small…

We show that given generators for subgroups $G$ and $H$ of $\mathrm{S}_n$, if $G$ is primitive then generators for $\mathrm{N}_H(G)$ may be computed in quasipolynomial time, namely $2^{O(\log^3 n)}$. The previous best known bound was simply…

For a finite group $G$, the size of a minimum generating set of $G$ is denoted by $d(G)$. Given a finite group $G$ and an integer $k$, deciding if $d(G)\leq k$ is known as the minimum generating set (MIN-GEN) problem. A group $G$ of order…

A base B for a finite permutation group G acting on a set X is a subset of X with the property that only the identity of G can fix every point of B. We prove that a primitive diagonal group G has a base of size 2 unless the top group of G…

It is shown that if $G$ is a primitive permutation group on a set of size $n$, then any nilpotent quotient of $G$ has order at most $n^{\beta}$ and any solvable quotient of $G$ has order at most $n^{\alpha+1}$ where $\beta=\log 32/ \log 9$…

In this paper, we study intersecting sets in primitive and quasiprimitive permutation groups. Let $G \leqslant \mathrm{Sym}(\Omega)$ be a transitive permutation group, and ${S}$ an intersecting set. Previous results show that if $G$ is…

Let $G \leqslant {\rm Sym}(\Omega)$ be a finite almost simple primitive permutation group, with socle $G_0$ and point stabilizer $H$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer is trivial; the base size of $G$,…

In this paper we show that if $G$ is a primitive subgroup of $S_{n}$ that is not large base, then any irredundant base for $G$ has size at most $5 \log n$. This is the first logarithmic bound on the size of an irredundant base for such…

We revisit the selection problem, namely that of computing the $i$th order statistic of $n$ given elements, in particular the classic deterministic algorithm by grouping and partition due to Blum, Floyd, Pratt, Rivest, and Tarjan (1973).…

Let $\mathcal{D} = (\mathcal{P}, \mathcal{B})$ be a $2$-$(v, k, \lambda)$ design, and let $G$ be a half-flag-transitive automorphism group of ${\cal D}$. In this article, we first establish three sufficient conditions for $G$ to be…

A base for a permutation group $G$ acting on a set $\Omega$ is a sequence $\mathcal{B}$ of points of $\Omega$ such that the pointwise stabiliser $G_{\mathcal{B}}$ is trivial. The base size of $G$ is the size of a smallest base for $G$.…

A base for a permutation group $G$ acting on a set $\Omega$ is a sequence $\mathcal{B}$ of points of $\Omega$ such that the pointwise stabiliser $G_{\mathcal{B}}$ is trivial. Denote the minimum size of a base for $G$ by $b(G)$. There is a…

Let $G$ be a transitive permutation group on a finite set $\Omega$ and recall that a base for $G$ is a subset of $\Omega$ with trivial pointwise stabiliser. The base size of $G$, denoted $b(G)$, is the minimal size of a base. If $b(G)=2$…

Let $G$ be a finite primitive permutation group on a set $\Omega$ with point stabiliser $H$. Recall that a subset of $\Omega$ is a base for $G$ if its pointwise stabiliser is trivial. We define the base size of $G$, denoted $b(G,H)$, to be…

Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabilizer is trivial; the base size of $G$ is the minimal cardinality of a base. In this paper we initiate the study of bases for…

This paper studies the long-standing open problem of the reduction of Steiner 3-designs admitting a block-transitive automorphism group. We prove that if G acts as a point-primitive, block-transitive automorphism group of a nontrivial…

Let $G$ be a transitive permutation group of degree $n$ with point stabiliser $H$ and let $r$ be a prime divisor of $n$. We say that $G$ is $r$-elusive if it does not contain a derangement of order $r$. The problem of determining the…