University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > The soluble graph of a finite group

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

The soluble graph of a finite group

Download to your calendar using vCal

If you have a question about this talk, please contact nobody.

GRA2 - Groups, representations and applications: new perspectives

Let G be a finite insoluble group with soluble radical R(G). The vertices of the soluble graph of G, denoted Gamma_S(G), are labelled by the elements in G\R(G), with x and y adjacent if they generate a soluble subgroup of G. This is a natural generalisation of the widely studied commuting graph of G.   In this talk I will report on joint work with Andrea Lucchini and Daniele Nemmi, which establishes several new results on Gamma_S(G). Our main theorem states that this graph is always connected, with diameter at most 5. We can construct examples with diameter 4, so our upper bound on the diameter is close to best possible. I will explain some of the main ideas and I will present a number of open problems.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Generation to Reproduction Seminars https://zoom.us/j/95370222402 Webinar & LT2, Computer Laboratory, William Gates Building.

Other talks

Title TBC What Can a Spectrum Learn? AI Perspectives on the Kohn Laplacian of Sphere Quotients CSaP Annual Cleevely Lecture 2026 Title to be confirmed Angular analyses of b -> s ee decays at LHCb Coming soon
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity