ULethbridge Number Theory and Combinatorics Seminar: Ted Dobson
Topic
Generalizations of a result of Pálfy
Speakers
Details
Abstract: The Cayley isomorphism problem asks which groups $G$ have the property that two Cayley graphs of $G$ are isomorphic if and only if they are isomorphic by a group automorphism of $G$. Such a group is called a $CI$-group with respect to graphs. The same question can be asked for other classes of combinatorial objects, and a group $G$ that is a $CI$-group with respect to every class of combinatorial objects is called a $CI$-group. Pálfy showed that a group $G$ of order n is a $CI$-group if and only if either $n=4$ or $gcd(n,φ(n))=1$, where $φ$ is Euler's totient function. This result is one of my all-time favorites, and I am very interested in generalizations of it. In this talk I will discuss my most recent results, which include showing that if $G$ has odd order and is not a $CI$-group, then $G$ is not a $CI$-group with respect to ternary relational structures; Pálfy's proof uses 4-ary relational structures. In the positive direction, for a group $G$ that is a direct product of groups, I give necessary and sufficient conditions for the Cayley isomorphism problem for $G$ to reduce to the Cayley isomorphism problems for its factors, and give examples of groups satisfying these conditions.
Additional Information
Weekly zoom links are sent through the mailing list.
To be put on the mailing list, please contact Sarobidy Razafimahatratra (sarobidy@uleth.ca).
For more information, also contact Melissa Huggan (melissa.huggan@uleth.ca) or Nicol Leong (encinicol.leong@uleth.ca).
Talks are usually 12:00pm–1:00pm (Mountain Time) on Mondays in M1060 (Markin Hall).