English
Related papers

Related papers: Intersecting subsets in finite permutation groups

200 papers

We study definably primitive pseudo-finite permutation groups of finite $SU$-rank. We show that if $(G,X)$ is such a permutation group, then the rank of $G$ can be bounded in terms of the rank of $X$, providing an analogue of a theorem of…

Logic · Mathematics 2025-11-25 Ulla Karhumäki , Nicholas Ramsey

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Group Theory · Mathematics 2021-09-14 Grechkoseeva Mariya

Let $G$ be a nontrivial transitive permutation group on a finite set $\Omega$. By a classical theorem of Jordan, $G$ contains a derangement, which is an element with no fixed points on $\Omega$. Given a prime divisor $r$ of $|\Omega|$, we…

Group Theory · Mathematics 2025-11-25 Timothy C. Burness , Mikko Korhonen

A subgroup $H\leq G$ is said to be almost normal if every conjugate of $H$ is commensurable to $H$. If $H$ is almost normal, there is a well-defined quotient space $G/H$. We show that if a group $G$ has type $F_{n+1}$ and contains an almost…

Group Theory · Mathematics 2021-09-15 Alexander Margolis

Although $S_\infty$ (the group of all permutations of $\mathbb{N}$) is size continuum, both it and its closed subgroups can be presented as the set of paths through a countable tree. The subgroups of $S_\infty$ that can be presented this…

Logic · Mathematics 2025-08-08 Jason Block

Letting $p$ vary over all primes and $E$ vary over all elliptic curves over the finite field $\mathbb{F}_p$, we study the frequency to which a given group $G$ arises as a group of points $E(\mathbb{F}_p)$. It is well-known that the only…

Number Theory · Mathematics 2019-08-15 Vorrapan Chandee , Chantal David , Dimitris Koukoulopoulos , Ethan Smith

A base for a permutation group $G$ acting on a set $\Omega$ is a subset $\mathcal{B}$ of $\Omega$ such that the pointwise stabiliser $G_{(\mathcal{B})}$ is trivial. Let $n$ and $r$ be positive integers with $n>2r$. The symmetric and…

Group Theory · Mathematics 2023-08-09 Coen del Valle , Colva M. Roney-Dougal

In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a $G$-vertex-transitive graph $\Gamma$. In the main result the group $G$ is quasiprimitive or biquasiprimitive on the vertices of $\Gamma$, and we…

Combinatorics · Mathematics 2011-02-09 Cheryl E. Praeger , Pablo Spiga , Gabriel Verret

A family $\mathcal{A}$ of sets is said to be intersecting if every two sets in $\mathcal{A}$ intersect. An intersecting family is said to be \emph{trivial} it its sets have a common element. A graph $G$ is said to be $r$-EKR if at least one…

Combinatorics · Mathematics 2019-08-26 Peter Borg , Carl Feghali

A transitive smooth action of a connected Lie group G on a manifold M is called almost primitive (resp. primitive) if G doesn't contain any proper subgroup (resp. any proper normal subgroup) whose induced action on M is transitive as well.…

Differential Geometry · Mathematics 2007-05-23 Michel Nguiffo Boyom

The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of…

Group Theory · Mathematics 2016-11-25 J. Araújo , J. P. Araújo , P. J. Cameron , T. Dobson , A. Hulpke , P. Lopes

Let $\mathcal{D}$ be a non-trivial quasi-symmetric $2$-design with two block intersection numbers $x=0$ and $2\leq y\leq10$, and suppose that $G$ is an automorphism group of $\mathcal{D}$. If $G$ is flag-transitive and point-primitive, then…

Combinatorics · Mathematics 2025-06-13 Jianbing Lu

Elements $a,b$ of a semigroup $S$ are said to be \emph{primarily conjugate} or just \emph{p-conjugate}, if there exist $x,y\in S^1$ such that $a=xy$ and $b=yx$. The p-conjugacy relation generalizes conjugacy in groups, but for general…

Group Theory · Mathematics 2019-11-19 Maria Borralho

Let $G$ be a collineation group of a thick finite generalised hexagon or generalised octagon $\Gamma$. If $G$ acts primitively on the points of $\Gamma$, then a recent result of Bamberg et al. shows that $G$ must be an almost simple group…

Group Theory · Mathematics 2015-08-25 Luke Morgan , Tomasz Popiel

A family of sets is said to be \emph{intersecting} if any two sets in the family have nonempty intersection. In 1973, Erd\H{o}s raised the problem of determining the maximum possible size of a union of $r$ different intersecting families of…

Combinatorics · Mathematics 2019-10-09 David Ellis , Noam Lifshitz

For infinite-dimensional groups $G\supset K$ the double cosets $K\setminus G/K$ quite often admit a structure of a semigroup; these semigroups act in $K$-fixed vectors of unitary representations of $G$. We show that such semigroups can be…

Representation Theory · Mathematics 2012-11-28 Yury A. Neretin

Given a finite abelian group $G$ and a subset $J\subset G$ with $0\in J$, let $D_{G}(J,N)$ be the maximum size of $A\subset G^{N}$ such that the difference set $A-A$ and $J^{N}$ have no non-trivial intersection. Recently, this extremal…

Combinatorics · Mathematics 2026-01-06 Zixiang Xu , Chi Hoi Yip

Let $\mathcal{A}$ and $\matchcal{B}$ denote two families of subsets of an $n$-element set. The pair $(\mathcal{A},\mathcal{B})$ is said to be $\ell$-cross-intersecting iff $|A\cap B| = \ell$ for all $A\in\mathcal{A}$ and $B\in\mathcal{B}$.…

Combinatorics · Mathematics 2007-05-23 Noga Alon , Eyal Lubetzky

The following problem is considered: if $H$ is a semiregular abelian subgroup of a transitive permutation group $G$ acting on a finite set $X$, find conditions for (non) existence of $G$-invariant partitions of $X$. Conditions presented in…

Group Theory · Mathematics 2014-04-04 Istvan Kovacs , Aleksander Malnic , Dragan Marusic , Stefko Miklavic

In this paper we study two directions of extending the classical Erd\H os-Ko-Rado theorem which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…

Combinatorics · Mathematics 2019-05-31 Peter Frankl , Andrey Kupavskii