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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

A Galois counting problem

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

ICT4D: ICT for Development UK~IRC Summit Meeting the Challenge of Healthy Ageing in the 21st Century

Other talks

TBC A novel mechanosensor in the endothelium that regulates the site-specific distribution of atherosclerosis Gates Annual Lecture: Irina Bokova, Director General of UNESCO (2009-2017): Why Heritage Matters. Annual WiSETI Lecture: The Adolescent Brain Livestock Associated Methicillin Resistant Staphylococcus aureus (LA MRSA ST398) in Relation to Pig Farming in the UK From cures to courts of justice: medical encounters, the issue of generation, and social order in early modern Spain Cross-Border Cooperation (CBC) Directions and Principles: Fostering sustainable development for EU Territories. Projects and Strategies
 

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