Abstract:In this paper we consider the derangement graph for the group PSU(3, q) where q is a prime power. We calculate all eigenvalues for this derangement graph and use these eigenvalues to prove that PSU(3, q) has the Erdős-Ko-Rado property and, provided that q = 2, 5, another property that we call the Erdős-Ko-Rado module property.2010 Mathematics Subject Classification. Primary 05C35; Secondary 05C69, 20B05.
“…Once we define canonical cocliques (or cliques), we can discuss the EKR properties of G after identifying G with Γ(G). The EKR-module property was first formally defined by Meagher [21] in this context: a permutation group G naturally acts on the vector space W spanned by the characteristic vectors of canonical cliques, which makes W a G-module.…”
We prove that a family of pseudo-Paley graphs of square order obtained from unions of cyclotomic classes satisfies the Erdős-Ko-Rado (EKR) module property, in a sense that the characteristic vector of each maximum clique is a linear combination of characteristic vectors of canonical cliques. This extends the EKR-module property of Paley graphs of square order and solves a problem proposed by Godsil and Meagher. Different from previous works, which heavily rely on tools from number theory, our approach is purely combinatorial in nature. The main strategy is to view these graphs as block graphs of orthogonal arrays, which is of independent interest.
“…Once we define canonical cocliques (or cliques), we can discuss the EKR properties of G after identifying G with Γ(G). The EKR-module property was first formally defined by Meagher [21] in this context: a permutation group G naturally acts on the vector space W spanned by the characteristic vectors of canonical cliques, which makes W a G-module.…”
We prove that a family of pseudo-Paley graphs of square order obtained from unions of cyclotomic classes satisfies the Erdős-Ko-Rado (EKR) module property, in a sense that the characteristic vector of each maximum clique is a linear combination of characteristic vectors of canonical cliques. This extends the EKR-module property of Paley graphs of square order and solves a problem proposed by Godsil and Meagher. Different from previous works, which heavily rely on tools from number theory, our approach is purely combinatorial in nature. The main strategy is to view these graphs as block graphs of orthogonal arrays, which is of independent interest.
“…A transitive group is said to satisfy the EKR-module property if the characteristic vector of every maximum intersecting set is a linear combination of the characteristic vectors of cosets of stabilizers of points. This generalization of the wellknown permutation group version of the Erdős-Ko-Rado (EKR) theorem was introduced by K. Meagher in [28]. In this article, we present several infinite families of permutation groups satisfying the EKR-module property, which shows that permutation groups satisfying this property are quite diverse.…”
mentioning
confidence: 89%
“…the characteristic vector of the canonical intersecting set gG α , which we call a canonical vector for convenience. The next definition was first introduced in [28].…”
In recent years, the generalization of the Erdő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 intersecting set is a linear combination of the characteristic vectors of cosets of stabilizers of points. This generalization of the wellknown permutation group version of the Erdős-Ko-Rado (EKR) theorem was introduced by K. Meagher in [28]. In this article, we present several infinite families of permutation groups satisfying the EKR-module property, which shows that permutation groups satisfying this property are quite diverse.
“…Finally, Spiga showed that the maximum intersecting sets of PGL n+1 (q) acting on the points of the projective space P n q are the cosets of the stabilizer of a point and the cosets of the stabilizer of a hyperplan [15]. For more studies, we refer the reader to [7,11,14].…”
Let q be a power of a prime number and V be a 2-dimensional column vector space over a finite field F q . Assume that SL 2 (V ) < G ≤ GL 2 (V ). In this paper we prove an Erdős-Ko-Rado theorem for intersecting sets of G and we show that every maximum intersecting set of G is either a coset of the stabilizer of a point or a coset of G 〈w〉 , whereIt is also shown that every intersecting set of G is contained in a maximum intersecting set.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.