Stability for intersecting families in PGL(2,q)
Summary: We consider the action of the \(2\)-dimensional projective general linear group \(\mathrm{PGL}(2,q)\) on the projective line \(\mathrm{PG}(1,q)\). A subset \(S\) of \(\mathrm{PGL}(2,q)\) is said to be an intersecting family if for every \(g_1,g_2 \in S\), there exists \(\alpha \in\mathrm{PG}(1,q)\) such that \(\alpha^{g_1}= \alpha^{g_2}\). It was proved by \textit{K. Meagher} and \textit{P. Spiga} [J. Comb. Theory, Ser. A 118, No. 2, 532--544 (2011; Zbl 1227.05163)] that the intersecting families of maximum size in \(\mathrm{PGL}(2,q)\) are precisely the cosets of point stabilizers. We prove that if an intersecting family \(S \subset \mathrm{PGL}(2,q)\) has size close to the maximum then it must be ``close in structure to a coset of a point stabilizer. This phenomenon is known as stability. We use this stability result proved here to show that if the size of \(S\) is close enough to the maximum then \(S\) must be contained in a coset of a point stabilizer.
- Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\)
- An Erdős-Ko-Rado theorem for the derangement graph of PGL(\(2,q\)) acting on the projective line
- On the largest intersecting set in \(\mathrm{GL}_2(q)\) and some of its subgroups
- An Erdős-Ko-Rado theorem for the derangement graph of \(\mathrm{PGL}_3(q)\) acting on the projective plane
- The Erdős-Ko-Rado theorem for the derangement graph of the projective general linear group acting on the projective space
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- A proof of the Cameron-Ku conjecture
- A quasi-stability result for dictatorships in S_n
- A stability result for balanced dictatorships in S_n
- An Erdős-Ko-Rado theorem for the derangement graph of PGL(\(2,q\)) acting on the projective line
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Complex Representations of 𝐺𝐿(2,𝐾) for Finite Fields 𝐾
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Fourier analysis and large independent sets in powers of complete graphs
- Generating a random permutation with random transpositions
- Graph products, Fourier analysis and spectral techniques
- Intersecting families of permutations
- On the maximum number of permutations with given maximal or minimal distance
- On the Shannon capacity of a graph
- Spectra of Cayley graphs
- Stability for t-intersecting families of permutations
- Stable sets of maximal size in Kneser-type graphs
- The exact bound in the Erdős-Ko-Rado theorem
- Triangle-intersecting families of graphs
- Families of stable quasipolynomials
- Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\)
- Maximal intersecting families and affine regular polygons in PG(2,q)
- On the intersection density of primitive groups of degree a product of two odd primes
- Boolean function analysis on high-dimensional expanders
- Boolean function analysis on high-dimensional expanders
- All \(3\)-transitive groups satisfy the strict-Erdős-Ko-Rado property
This page was built for publication: Stability for intersecting families in \(\mathrm{PGL}(2,q)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q907232)
