Search arXivSearch

arXiv · 2511.00787

The intersection densities of transitive actions of $\operatorname{PSL}_{2}(q)$ with cyclic point stabilizers

Abstract

Given a finite transitive group $G\leq \operatorname{Sym}Ω$, the {intersection density} of $G$ is defined as the ratio between the size of the largest subsets of $G$ in which any two permutations agree on at least one element of $Ω$, and the order of a point stabilizer of $G$. In this paper, we completely determine the intersection densities of the permutation groups $\operatorname{PSL}_{2}(q)$, where $q$ is a power of an odd prime $p$, acting transitively with point stabilizers conjugate to $\mathbb{Z}_p$. Our proof uses an auxiliary graph, which is a $\operatorname{PGL}_{2}{q}$-vertex-transitive graph, in which a clique corresponds to an intersecting set of $\operaotnrame{PSL}_{2}(q)$. For the transitive action of $\psl{2}{q}$ with point stabilizers conjugate to $\mathbb{Z}_r$, where $r\mid \frac{q-1}{2}$ is an odd prime, we show that the auxiliary graph is not regular, and we construct an intersecting set which is sometimes of maximum size.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Angelot Behajaina, Roghayeh Maleki, Andriaherimanana Sarobidy Razafimahatratra. 2025-11-02. The intersection densities of transitive actions of $\operatorname{PSL}_{2}(q)$ with cyclic point stabilizers. https://arxiv.org/abs/2511.00787

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO