University of Cambridge > Talks.cam > Discrete Analysis Seminar > A Galois counting problem

  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

A Galois counting problem

Download to your calendar using vCal

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

We count monic quartic polynomials with integer coefficients and prescribed Galois group. Among other things, we obtain the order of magnitude for D4 quartics, and show that non-S4 quartics are dominated by reducibles. The tools come from the theory of diophantine equations. Joint with Rainer Dietmann

This talk is part of the Discrete Analysis Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Seminar Room FG5, level 5 in the F & G wards, Addenbrooke's Hospital Webinar & LT2, Computer Laboratory, William Gates Building. Faculty of Education, Mary Allan Building,Boulind 8 & 9, Homerton College, Hills Road, Cambridge CB2 8PQ

Other talks

Max Perutz Lecture - Title TBC When Programmes Disagree About Programmes: Code Poetry and the Problem of Programme–Programme Communication Morning Break / Group Photo Morning Break Summer Cactus & Succulent Show Discussion I
 

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