English
Related papers

Related papers: On the Erdos-Ko-Rado property for finite Groups

200 papers

We prove an analogue of the classical Erd\H{o}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…

Combinatorics · Mathematics 2015-07-24 Karen Meagher , Pablo Spiga , Pham Huu Tiep

A subset in a group $G \leq Sym(n)$ is intersecting if for any pair of permutations $\pi,\sigma$ in the subset there is an $i \in \{1,2,\dots,n\}$ such that $\pi(i) = \sigma(i)$. If the stabilizer of a point is the largest intersecting set…

Combinatorics · Mathematics 2013-11-28 Bahman Ahmadi , Karen Meagher

In the recent years, the generalization of the Erd\H{o}s-Ko-Rado (EKR) theorem to permutation groups has been of much interest. A transitive group is said to satisfy the EKR-module property if the characteristic vector of every maximum…

Combinatorics · Mathematics 2024-04-17 Cai Heng Li , Venkata Raghu Tej

For a permutation group $G$ acting on a set $V$, a subset $\mathcal{F}$ of $G$ is said to be an intersecting set if for every pair of elements $g,h\in \mathcal{F}$ there exists $v \in V$ such that $g(v) = h(v)$. The intersection density…

Combinatorics · Mathematics 2022-01-27 Ademir Hujdurović , István Kovács , Klavdija Kutnar , Dragan Marušič

A subset of a group G of Sym(n) is intersecting if for any pair of permutations $\pi,\sigma \in G$ there is an $i$ in {1,2,...,n} such that $\pi(i) = \sigma(i)$. It has been shown, using an algebraic approach, that the largest intersecting…

Combinatorics · Mathematics 2013-08-06 Bahman Ahmadi , Karen Meagher

We study profinite actions of residually finite groups in terms of weak containment. We show that two strongly ergodic profinite actions of a group are weakly equivalent if and only if they are isomorphic. This allows us to construct…

Group Theory · Mathematics 2011-09-20 Miklós Abért , Gábor Elek

A subset $S$ of the alternating group on $n$ points is {\it intersecting} if for any pair of permutations $\pi,\sigma$ in $S$, there is an element $i\in \{1,\dots,n\}$ such that $\pi(i)=\sigma(i)$. We prove that if $S$ is intersecting, then…

Combinatorics · Mathematics 2013-03-01 Bahman Ahmadi , Karen Meagher

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…

Combinatorics · Mathematics 2021-01-19 Cai Heng Li , Shu Jiao Song , Venkata Raghu Tej Pantangi

The \emph{intersection density} of a finite transitive group $G\leq \operatorname{Sym}(\Omega)$ is the rational number $\rho(G)$ given by the ratio between the maximum size of a subset of $G$ in which any two permutations agree on some…

Combinatorics · Mathematics 2023-09-19 Roghayeh Maleki , Andriaherimanana Sarobidy Razafimahatratra

An action of a group $G$ is highly transitive if $G$ acts transitively on $k$-tuples of distinct points for all $k \geq 1$. Many examples of groups with a rich geometric or dynamical action admit highly transitive actions. We prove that if…

Group Theory · Mathematics 2021-11-22 Adrien Le Boudec , Nicolás Matte Bon

If $G$ is a finite $\ell$-group acting on an affine space $\mathbb{A}^n$ over a finite field $K$ of cardinality prime to $\ell$, Serre has shown that there exists a rational fixed point. We generalize this to the case where $K$ is a…

Algebraic Geometry · Mathematics 2011-02-02 Hélène Esnault , Johannes Nicaise

Two families $\mathcal{A}$ and $\mathcal{B}$, of $k$-subsets of an $n$-set, are {\em cross $t$-intersecting} if for every choice of subsets $A \in \mathcal{A}$ and $B \in \mathcal{B}$ we have $|A \cap B| \geq t$. We address the following…

Combinatorics · Mathematics 2015-03-17 Peter Frankl , Sang June Lee , Mark Siggers , Norihide Tokushige

We prove that every 2-transitive group has a property called the EKR-module property. This property gives a characterization of the maximum intersecting sets of permutations in the group. Specifically, the characteristic vector of any…

Combinatorics · Mathematics 2022-07-13 Karen Meagher , Peter Sin

A family of subsets $\mathcal{F}\subseteq {[n]\choose k}$ is called intersecting if any two of its members share a common element. Consider an intersecting family, a direct problem is to determine its maximal size and the inverse problem is…

Combinatorics · Mathematics 2020-04-06 Xiangliang Kong , Gennian Ge

In this paper we study a question related to the classical Erd\H{o}s-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 2017-11-30 Peter Frankl , Andrey Kupavskii

A hovel is a generalization of the Bruhat-Tits building that is associated to an almost split Kac-Moody group G over a non-Archimedean local field. In particular, G acts strongly transitively on its corresponding hovel $\Delta$ as well as…

Group Theory · Mathematics 2017-03-03 Corina Ciobotaru , Guy Rousseau

The well-known Erdos-Ko-Rado Theorem states that if F is a family of k-element subsets of {1,2,...,n} (n>2k-1) such that every pair of elements in F has a nonempty intersection, then |F| is at most $\binom{n-1}{k-1}$. The theorem also…

Combinatorics · Mathematics 2008-08-08 Greg Brockman , Bill Kay

For a permutation group $G$ acting on a set $V$, a subset $I$ of $G$ is said to be an intersecting set if for every pair of elements $g,h\in I$ there exists $v \in V$ such that $g(v) = h(v)$. The intersection density $\rho(G)$ of a…

Combinatorics · Mathematics 2021-08-23 Ademir Hujdurović , Klavdija Kutnar , Dragan Marušič , Štefko Miklavič

A conjecture of Leader, Russell and Walters in Euclidean Ramsey theory says that a finite set is Ramsey if and only if it is congruent to a subset of a set whose symmetry group acts transitively. As they have shown the ``if" direction of…

Combinatorics · Mathematics 2019-05-14 Vassilis Kanellopoulos , Miltiadis Karamanlis

There are many generalizations of the Erd\H{o}s-Ko-Rado theorem. We give new results (and problems) concerning families of $t$-intersecting $k$-element multisets of an $n$-set and point out connections to coding theory and classical…

Combinatorics · Mathematics 2014-03-11 Zoltán Füredi , Dániel Gerbner , Máté Vizer
‹ Prev 1 2 3 10 Next ›