相关论文: Permutation groups and normal subgroups

Extending earlier work of Guralnick and of Cai and Zhang, we classify the almost simple groups which have transitive permutation representations of prime power degree $p^k$, and those which have $p$-complements (stabilisers of order coprime…

Leading towards the classification of primitive commutative association schemes as the ultimate goal, Bannai and some of his school have been trying to * identify the major sources of (primitive) commutative association schemes, * collect…

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

We prove a broad generalization of a theorem of W. Burnside on real characters using permutation characters. Under a necessary hypothesis, We can give some control on multiplicities (a result that needs the Classification of Finite Simple…

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…

A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…

If $G$ is a group of permutations of a set $\Omega$ and $\alpha \in \Omega$, then the {\em $\alpha$-suborbits} of $G$ are the orbits of the stabilizer $G_\alpha$ on $\Omega$. The cardinality of an $\alpha$-suborbit is called a {\em…

We consider a constructive modification of quantum-mechanical formalism. Replacement of a general unitary group by unitary representations of finite groups makes it possible to reproduce quantum formalism without loss of its empirical…

We classify finite groups in which the centralisers of certain non-central elements are soluble. This includes a full structural description of groups whose non-central element centralisers are all soluble, and a reduction theorem for the…

We consider compact matrix quantum groups whose fundamental corepresentation matrix has entries which are partial isometries with central support. We show that such quantum groups have a simple representation as semi-direct product quantum…

The famous Burnside-Schur theorem states that every primitive finite permutation group containing a regular cyclic subgroup is either 2-transitive or isomorphic to a subgroup of a 1-dimensional affine group of prime degree. It is known that…

We introduce the notion of primitive elements in arbitrary truncated $p$-divisible groups. By design, the scheme of primitive elements is finite and locally free over the base. Primitive elements generalize the "points of exact order $N$,"…

The classification of flag-transitive generalised quadrangles is a long-standing open problem at the interface of finite geometry and permutation group theory. Given that all known flag-transitive generalised quadrangles are also…

A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

Motivated by situations in which the removal of a zero (a.k.a., an absorbing element) from a semigroup yields a subsemigroup with another zero, sets of quasi-zeros (a.k.a., quasi-absorbing elements) are introduced as well as primitive…

We describe all closed permutation groups which act on the set of vectors of a countable vector space $V$ over a prime field of odd order and which contain all automorphisms of $V$. In particular, we prove that their number is finite. These…

A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the…

Delta finite-type invariants are defined analogously to finite-type invariants, using delta moves instead of crossing changes. We show that they are closely related to the lower central series of the commutator subgroup of the pure braid…

We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.