The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations (Q2236813): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SageMath / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.37236/9556 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3211215452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdös–Ko–Rado Theorem—22 Years Later / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Properties of Systems of Finite Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating a random permutation with random transpositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Setwise intersecting families of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hook Graphs of the Symmetric Group / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of permutations with given maximal or minimal distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős–Ko–Rado Theorems: Algebraic Approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the Erdős-Chao Ko-Rado theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets of maximal size in Kneser-type graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: All 2-transitive groups have the EKR-module property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716065 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:33, 26 July 2024

scientific article
Language Label Description Also known as
English
The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations
scientific article

    Statements

    The Erdős-Ko-Rado theorem for 2-pointwise and 2-setwise intersecting permutations (English)
    0 references
    26 October 2021
    0 references
    The set of permutations of \([n] := \{1, \dots, n\}\) is denoted by \(\mbox{Sym}(n)\). A subset \(\mathcal{A}\) of \(\mbox{Sym}(n)\) is said to be \(t\)-pointwise intersecting if for every \(\sigma, \tau \in \mathcal{A}\) there exists some \(t\)-subset \(S\) of \([n]\) such that \(\sigma(x) = \tau(x)\) for each \(x \in S\). A subset \(\mathcal{A}\) of \(\mbox{Sym}(n)\) is said to be \(t\)-setwise intersecting if for every \(\sigma, \tau \in \mathcal{A}\) there exists some \(t\)-subset \(S\) of \([n]\) such that \(\{\sigma(x) \colon x \in S\} = \{\tau(x) \colon x \in S\}\). We say that \(\mbox{Sym}(n)\) has the \(t\)-pointwise star property if the size of a largest \(t\)-pointwise intersecting subset of \(\mbox{Sym}(n)\) is the size \((n-t)!\) of the \(t\)-pointwise intersecting subset \(\{\sigma \in \mbox{Sym}(n) \colon \sigma(i) = i \mbox{ for each } i \in [t]\}\). We say that \(\mbox{Sym}(n)\) has the \(t\)-setwise star property if the size of a largest \(t\)-setwise intersecting subset of \(\mbox{Sym}(n)\) is the size \(t!(n-t)!\) of the \(t\)-setwise intersecting subset \(\{\sigma \in \mbox{Sym}(n) \colon \{\sigma(1), \dots, \sigma(t)\} = [t]\}\). \textit{P. Frankl} and \textit{M. Deza} [J. Comb. Theory, Ser. A 22, 352--360 (1977; Zbl 0352.05003)] proved that \(\mbox{Sym}(n)\) has the \(1\)-pointwise star property. This is an analogue of the Erdős-Ko-Rado Theorem [\textit{P. Erdős} et al., Q. J. Math., Oxf. II. Ser. 12, 313--320 (1961; Zbl 0100.01902)]. Deza and Frankl conjectured that \(\mbox{Sym}(n)\) has the \(t\)-pointwise star property if \(n\) is sufficiently large depending on \(t\). \textit{D. Ellis} et al. [J. Am. Math. Soc. 24, No. 3, 649--682 (2011; Zbl 1285.05171)] proved this conjecture, and they conjectured that \(\mbox{Sym}(n)\) has the \(t\)-pointwise star property for \(n \geq 2t+1\). \textit{D. Ellis} [J. Comb. Theory, Ser. A 119, No. 4, 825--849 (2012; Zbl 1237.05210)] conjectured that \(\mbox{Sym}(n)\) has the \(t\)-setwise star property for \(n \geq t\), and he proved this for \(n\) sufficiently large depending on \(t\). The authors prove that for \(n \geq 2\), \(\mbox{Sym}(n)\) has the \(2\)-pointwise star property and the \(2\)-setwise star property.
    0 references
    0 references
    intersecting permutations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references