University of Auckland
Time: 16:00-18:00 (GMT+8), Tuesday March 22nd, 2022
Location: Tencent Meeting
Abstract: Identifying the local actions in a graph can help determining many properties of this graph. As one may expect, it is generally difficult to extend some properties of undirected graphs to digraphs. One of the reasons is that there are two non-isomorphic local actions in a digraph, instead of a unique one up to isomorphism in the undirected case. With this motivation in mind, we say two permutation groups are compatible if they correspond to the two local actions in a digraph up to permutation isomorphism.
In this talk, we will consider the compatibility of permutation groups. I will give some necessary conditions and sufficient conditions of the compatibility. In particular, we will focus on the regular case. Finally, we will turn to an algorithm of determining compatibility.
Keywords: digraph, paired subconstituents, compatible pairs
Host: 黄弘毅 Hong Yi Huang