给定一个定义域为 Ω 的有限置换群 G，我们将两个自然数子集与 G 相关联，即 I(G,Ω) 和 M(G,Ω)，它们分别是 G 的所有无冗余基和极小基的基数集合。我们证明 I(G) 是一个自然数区间，而 M(G,Ω) 则不一定构成区间。此外，对于给定的自然数子集 X⊆N，我们给出了关于 X 的若干条件，这些条件确保同时存在非传递群和传递群 G，使得 I(G,Ω)=X 且 M(G,Ω)=X。
英文摘要：
Given a finite permutation group $G$ with domain $Ω$, we associate two subsets of natural numbers to $G$, namely $\mathcal{I}(G,Ω)$ and $\mathcal{M}(G,Ω)$, which are the sets of cardinalities of all the irredundant and minimal bases of $G$, respectively. We prove that $\mathcal{I}(G)$ is an interval of natural numbers, whereas $\mathcal{M}(G,Ω)$ may not necessarily form an interval. Moreover, for a given subset of natural numbers $X \subseteq \mathbb{N}$, we provide some conditions on $X$ that ensure the existence of both intransitive and transitive groups $G$ such that
$\mathcal{I}(G,Ω) = X$ and $\mathcal{M}(G,Ω) = X$.
Let $G$ be a finite permutation group on $Ω$. An ordered sequence of elements of $Ω$, $(ω_1,\dots, ω_t)$, is an irredundant base for $G$ if the pointwise stabilizer $G_{(ω_1,\dots, ω_t)}$ is trivial and no point is fixed by the stabilizer of its predecessors. If all irredundant bases of $G$ have the same size we say that $G$ is an IBIS group. In this paper we show that if a primitive permutation group is IBIS, then it must be almost simple, of affine-type, or of diagonal type. Moreover we prove that a diagonal-type primitive permutation groups is IBIS if and only if it is isomorphic to $PSL(2,…
A smallest generating set of a semigroup is a generating set of the smallest cardinality. Similarly, an irredundant generating set $X$ is a generating set such that no proper subset of $X$ is also a generating set. A semigroup $S$ is ubiquitous if every irredundant generating set of $S$ is of the same cardinality. We are motivated by a naïve algorithm to find a small generating set for a semigroup, which in practice often outputs a smallest generating set. We give a sufficient condition for a transformation semigroup to be ubiquitous and show that a transformation semigroup generated by $k$ ra…
An irredundant base $B$ for a permutation group $G\leq \mathrm{Sym}(Ω)$ is an ordered subset of $Ω$ with trivial stabiliser such that no base point is fixed by the stabiliser of its predecessors. Groups whose irredundant bases all have the same size are termed Irredundant Bases of Invariant Size (IBIS) groups, and were introduced by Cameron and Fon-Der-Flaass. In this paper, we contribute to the classification of primitive IBIS groups by classifying those that are almost simple with sporadic socle.
Let $G$ be a finite permutation group on $Ω$. An ordered sequence $(ω_1,\ldots,ω_\ell)$ of elements of $Ω$ is an irredundant base for $G$ if the pointwise stabilizer is trivial and no point is fixed by the stabilizer of its predecessors. If all irredundant bases of $G$ have the same cardinality, $G$ is said to be an IBIS group. Lucchini, Morigi and Moscatiello have proved a theorem reducing the problem of classifying finite primitive IBIS groups $G$ to the case that the socle of $G$ is either abelian or non-abelian simple. In this paper, we classify the finite primitive IBIS groups having socl…
Let $G$ be a finite permutation group on $Ω.$ An ordered sequence $(ω_1,\dots, ω_t)$ of elements of $Ω$ is an irredundant base for $G$ if the pointwise stabilizer is trivial and no point is fixed by the stabilizer of its predecessors. If all irredundant bases of $G$ have the same cardinality, $G$ is said to be an IBIS group. In this paper we give a classification of quasi-primitive soluble irreducible IBIS linear groups, and we also describe nilpotent and metacyclic IBIS linear groups and IBIS linear groups of odd order.
Let $G$ be a permutation group on a set $Ω$ of size $t$. We say that $Λ\subseteqΩ$ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $Λ$. We define the height of $G$ to be the maximum size of an independent set, and we denote this quantity $\mathrm{H}(G)$. In this paper we study $\mathrm{H}(G)$ for the case when $G$ is primitive. Our main result asserts that either $\mathrm{H}(G)< 9\log t$, or else $G$ is in a particular well-studied family (the "primitive large--base groups"). An immediate corollary of this result is a character…
Motivated by a problem from behavioral economics, we study subgroups of permutation groups that have a certain strong symmetry. Given a fixed permutation, consider the set of all permutations with disjoint inversion sets. The group is called non-nudgable, if the cardinality of this set always remains the same when replacing the initial permutation with its inverse. It is called nudgable otherwise. We show that all full permutation groups, standard dihedral groups, half of the alternating groups, and any abelian subgroup are non-nudgable. In the right probabilistic sense, it is thus quite likel…
Let $G$ be a finite transitive group on a set $Ω$, let $α\in Ω$ and let $G_α$ be the stabilizer of the point $α$ in $G$. In this paper, we are interested in the proportion $$\frac{|\{ω\in Ω\mid ω\textrm{ lies in a }G_α\textrm{-orbit of cardinality at most two}\}|}{|Ω|},$$ that is, the proportion of elements of $Ω$ lying in a suborbit of cardinality at most two. We show that, if this proportion is greater than $5/6$, then each element of $Ω$ lies in a suborbit of cardinality at most two and hence $G$ is classified by a result of Bergman and Lenstra. We also classify the permutation groups attai…
If $G$ is a group of permutations of a set $Ω$ and $α\in Ω$, then the {\em $α$-suborbits} of $G$ are the orbits of the stabilizer $G_α$ on $Ω$. The cardinality of an $α$-suborbit is called a {\em subdegree} of $G$. If the only $G$-invariant equivalence classes on $Ω$ are the trivial and universal relations, then $G$ is said to be a {\em primitive} group of permutations of $Ω$. In this paper we determine the structure of all primitive permutation groups whose subdegrees are bounded above by a finite cardinal number.
Let $G$ be a permutation group acting on a finite set $Ω$ of cardinality $n$. The number of orbits of the induced action of $G$ on the set $Ω_m$ of all size $m$ subsets of $Ω$ satisfies the trivial inequalities $|Ω_m|/|G|\leq |Ω_m/G|\leq |Ω_m|$. The paper offers improvements of the upper bound in terms of the minimal degree of $G$ or the minimal degree of some its subset with a small complement. Applications include asymptotic enumeration of point configurations in an affine space over a finite field, unlabeled graphs and hypergraphs. Finally, with references to known results of permutation gr…
We prove an analogue of the classical Erdős-Ko-Rado theorem for intersecting sets of permutations in finite 2-transitive groups. Given a finite group G acting faithfully and 2-transitively on the set X, we show that an intersecting set of maximal size in G has cardinality |G|/|X|. This generalises and gives a unifying proof of some similar recent results in the literature.
A transitive group $G$ of permutations of a set $Ω$ is primitive if the only $G$-invariant equivalence relations on $Ω$ are the trivial and universal relations. If $α\in Ω$, then the orbits of the stabiliser $G_α$ on $Ω$ are called the $α$-suborbits of $G$; when $G$ acts transitively the cardinalities of these $α$-suborbits are the subdegrees of $G$. If $G$ acts primitively on an infinite set $Ω$, and all the suborbits of $G$ are finite, Adeleke and Neumann asked if, after enumerating the subdegrees of $G$ as a non-decreasing sequence $1 = m_0 \leq m_1 \leq ...$, the subdegree growth rates of …
Given an abelian group $G$, it is natural to ask whether there exists a permutation $π$ of $G$ that "destroys" all nontrivial 3-term arithmetic progressions (APs), in the sense that $π(b) - π(a) \neq π(c) - π(b)$ for every ordered triple $(a,b,c) \in G^3$ satisfying $b-a = c-b \neq 0$. This question was resolved for infinite groups $G$ by Hegarty, who showed that there exists an AP-destroying permutation of $G$ if and only if $G/Ω_2(G)$ has the same cardinality as $G$, where $Ω_2(G)$ denotes the subgroup of all elements in $G$ whose order divides $2$. In the case when $G$ is finite, however, o…
The maximality of Abelian subgroups play a role in various parts of group theory. For example, Mycielski has extended a classical result of Lie groups and shown that a maximal Abelian subgroup of a compact connected group is connected and, furthermore, all the maximal Abelian subgroups are conjugate. For finite symmetric groups the question of the size of maximal Abelian subgroups has been examined by Burns and Goldsmith in 1989 and Winkler in 1993. We show that there is not much interest in generalizing this study to infinite symmetric groups; the cardinality of any maximal Abelian subgroup o…
We refer to $d(G)$ as the minimal cardinality of a generating set of a finite group $G$, and say that $G$ is $d$-generated if $d(G)\leq d$. A transitive permutation group $G$ is called $\frac{3}{2}$-transitive if a point stabilizer $G_α$ is nontrivial and its orbits distinct from $\{α\}$ are of the same size. We prove that $d(G)\leq4$ for every primitive $\frac{3}{2}$-transitive permutation group $G$, moreover, $G$ is $2$-generated except for the very particular solvable affine groups that we completely describe. In particular, all finite $2$-transitive and $2$-homogeneous groups are $2$-gener…
A rack of order $n$ is a binary operation $\rack$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\rack)$ is a rack provided that the map $x\mapsto x\rack y$ is a bijection for all $y\in X$, and $(x\rack y)\rack z=(x\rack z)\rack (y\rack z)$ for all $x,y,z\in X$. The paper provides upper and lower bounds of the form $2^{cn^2}$ on the number of isomorphism classes of racks of order $n$. Similar results on the number of isomorphism classes of quandles and kei are obtained. The results of the paper are established by first showing how an arb…
Some remarks on the orbit dimension of transitive groups and on the metric dimension of Johnson graphs
Scuola Galileiana di Studi Superiori, Università di Padova（高等研究伽利略学院，帕多瓦大学）；Dipartimento di Matematica “Tullio Levi-Civita”, Università di Padova（帕多瓦大学，“图利奥·莱维-奇维塔”数学系）；University of Milano-Bicocca（米兰比可卡大学）
Let $G$ be a permutation group on a set $Ω$. A base for $G$ is a subset of $Ω$ whose pointwise stabiliser is trivial, and the base size of $G$ is the minimal cardinality of a base. If $G$ has base size $2$, then the corresponding Saxl graph $Σ(G)$ has vertex set $Ω$ and two vertices are adjacent if they form a base for $G$. A recent conjecture of Burness and Giudici states that if $G$ is a finite primitive permutation group with base size $2$, then $Σ(G)$ has the property that every two vertices have a common neighbour. We investigate this conjecture when $G$ is an affine group and a point sta…
Let $G$ be a permutation group on a set $Ω$. A subset of $Ω$ 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 algebraic groups defined over an algebraically closed field. In particular, we calculate the base size for all primitive actions of simple algebraic groups, obtaining the precise value in almost all cases. We also introduce and study two new base measures, which arise naturally in this setting. We give an application concerning the essential dimension of simple algebraic…
We consider pro-isomorphic zeta functions of the groups $Γ(\mathcal{O}_K)$, where $Γ$ is a unipotent group scheme defined over $\mathbb{Z}$ and $K$ varies over all number fields. Under certain conditions, we show that these functions have a fine Euler decomposition with factors indexed by primes $\mathfrak{p}$ of $K$ and depending only on the structure of $Γ$, the degree $[K : \mathbb{Q}]$, and the cardinality of the residue field $\mathcal{O}_K / \mathfrak{p}$. We show that the factors satisfy a certain uniform rationality and study their dependence on $[K : \mathbb{Q}]$. Explicit computation…
A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the algebraic structure. In this paper we introduce a more general perspective on total symmetry, and formulate a notion of "irreducibility" for totally symmetric sets in the general linear group. We classify irreducible totally symmetric sets, as well as those of maximal cardinality.
Let $X$ be a nonempty set, and let $\mathcal{T}_X$ be the full transformation semigroup on $X$. For a partition $\mathcal{P} = \{X_i \;|\; i\in I\}$ of $X$, we consider the semigroup $T(X, \mathcal{P}) = \{f\in \mathcal{T}_X\;|\; \forall X_i\;\exists X_j,\; X_i f \subseteq X_j\}$, the subsemigroup $Σ(X, \mathcal{P}) = \{f\in T(X, \mathcal{P})\;|\; Xf \cap X_i \neq \emptyset\; \forall X_i\}$, and the group of units $S(X, \mathcal{P})$ of $T(X, \mathcal{P})$. In this paper, we first characterize the elements of $Σ(X, \mathcal{P})$. For a permutation $f$ of finite $X$, we next observe whether the…
