University of Cambridge > Talks.cam > Junior Algebra and Number Theory seminar > Prime graphs, simple groups and Goldbach's conjecture.

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹ️ Information

Prime graphs, simple groups and Goldbach's conjecture.

Download to your calendar using vCal

  • UserElisa Covato University of Bristol
  • ClockFriday 13 February 2015, 15:00-16:00
  • HouseCMS, MR14.

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

Let G be a finite group. The prime graph of G is a graph with vertex set the set of primes dividing the order of G, and two vertices p and q are adjacent if and only if G contains an element of order pq. This notion has been studied extensively in recent years, with a particular focus on the prime graphs of simple groups. In this talk, I will determine all the pairs (G,H), where G is simple and H is a proper subgroup of G such that G and H have the same prime graph. Moreover, I will show that if G is the alternating group A_n and H is an intransitive subgroup, the problem of determining whether or not they have the same prime graph depends on some formidable open problems in number theory, such as Goldbach’s conjecture.

This talk is part of the Junior Algebra and Number Theory seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

https://maths-cam-ac-uk.zoom.us/j/95531783868?pwd=U3pPbmYxTXZYRVZMWFBVTkVnWmUvZz09 Lenguaje integral Zoom link: https://maths-cam-ac-uk.zoom.us/j/98016675669

Other talks

Reproducibility In Astrophysical Simulations: The AGORA Initiative and a 14-Year Human Experiment (In Memory of Joel Primack) Morning Tea and Coffee Differences between Robin and Neumann eigenvalues Machine Learning for Spectral Geometry and Vice Versa Title to be confirmed CONFERENCE: Chemical and material sciences enabled by AI and automation
 

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