The Warwick Mathematics Society Website

User login

Upcoming events

  • No upcoming events available

There are 538 members of the Warwick Mathematics Society, of which 0 are new today!
We're 107% of the way toward our target of 500 members.
You can join up on the UWSU website.

Who's new

  • alex367
  • Suthers
  • urszulasluse
  • kforge
  • ghaleo

Event

DG := <Morse Theory>

MorseTheorySphere.GIF
Thursday 25th February, 2:03 pm - MS.05

Morse Theory analyses manifolds by looking at the behaviour of differentiable functions on that manifold. We can gain a lot of insight into the topology of a manifold by looking at the critical points of a differentiable function on that manifold: different matrices of second partial derivatives (the Hessian) gives different local behaviours, like saddles, maxima or minima. Looking at what happens between different critical points, we can try to patch up what happens near each critical point to reconstruct our manifold somehow.

To do this, our smooth functions need to be sufficiently nice; the so called Morse functions.

We can in fact strengthen the approach by taking more care at what happens around critical points; we will then find a particularly neat way of packaging that information and passing from that information to topological information. In particular, a theorem of John Jones (with Graeme Seagal and Ralph Cohen) will make its appearance!

So make sure to come to MS.05 at 7:30 to learn about what Morse Theory is all about and why it's so amazing! After which we flow to the pub!


DG Special Event := <Know-It-Alls>

300px-Knowitalls_logo_large.jpg
Thursday 11th February, 7:30 pm - 9:00 pm - MS.05

The Warwick Mathematics Society is hosting a special event - a maths Knowitalls contest!

If you're familiar with the BBC2 show Knowitalls, this is the same idea. In the different rounds, each contestant is given a mathematical topic and he has a small amount of time to say everything he knows about the topic.

In the first round, the idea is to come up with as much information as possible, and to mention some of the key points that the jury will have prepared in order to get some sweet bonus points.

In the second round, you will need to come up with one of the key points as fast as possible.

In the third round, you have to come up with as many examples as possible of a given type.

Everyone is more than welcome; we try to make things fair by giving harder topics to third/fourth years than to first or second years. The idea is simply to have fun by trying to remember some nice mathematical facts in familiar areas, not to embarass anyone. But giving impossibly hard questions to Cosmin is also always a fun thing to do; you'll find he doesn't know much about differential geometers after Riemann, for example. Also don't worry if you don't know anything about fiber bundles, we're reserving all those questions for one particular person.

We had a test run with a few regulars last Monday and it proved tremendously fun - as long as you take it lightly, you'll be sure to amuse yourself too! Please be sure to come!


DG := <Squares and Triangles>

Thursday 4th February, 7:30 pm - 9:00 pm - MS.05

A short notice: there is a discussion group tonight by Cosmin about some topics in the combinatorics of subdivision, for example on the subject of subdividing a square into even or odd numbers of congruent triangles. But it's going to be good! See you there!

DG := <Thinking categorically>

225px-Categorical_pullback_(expanded).svg.png
Monday 25th January, 7:30 pm - 9:00 pm - MS.05

Just a short note to mention that today's Discussion Group is indeed happening; Ben Simpson will present us with his findings about category theory. Don't miss it!


DG := <The Chebotarev Density Theorem>

Chebotaryov_2.jpeg
Thursday 21st January, 7:30 pm - 9:00 pm - MS.05

Dirichlet's Theorem on primes in arithmetic progression states that for any coprime numbers $ a $ and $ n $, we can find infinitely many primes congruent to $ a $ modulo $ n $. A stronger version is in fact true: each residue class contains the same amount of prime numbers: if you write a table of all prime numbers up to $ N $ and count how many end up in a given residue class (ie how many end up being congruent to $ a $ modulo $ n $), you will find that there are approximately $ N/\varphi(n) $. This means primes are equidistributed amongst the residue classes, as there are precisely $ \varphi(n) $ integers between $ 1 $ and $ n $ that are coprime to $ n $, and hence only $ \varphi(n) $ possible infinite families.

Something somewhat similar happens when looking at the splitting of primes in the ring of Gaussian integers $ \mathbb{Z}[i] $: the behaviour is essentially described by Fermat's Theorem on primes expressible as the sum of two squares. Indeed, any prime congruent to $ 1 $ mod $ 4 $ factors as the product of two prime elements of $ \mathbb{Z}[i] $ (for example, $ 5 = (2+i)(2-i) $) whereas primes congruent to $ 3 $ mod $ 4 $ stay prime in this larger ring (lastly, $ 2 $ ramifies in this ring: $ 2 = -i(1+i)^2 $, which means that $ 2 $ gains a repeated factor). So here we see that on average, half of the primes split into two factors, and half stay prime: this is related to the fact that the degree $ [\mathbb{Q}(i):\mathbb{Q}] $, as a Galois field extension, is 2.

This last observation actually generalises much further, and in fact this generalisation was formulated by Frobenius, who was unable to prove it. The Russian mathematician Chebotarev, however, was able to come up with a proof; this generalisation also gives us Dirichlet's Theorem as a special case. The method of proof, that Chebotarev allegedly thought of while carrying water from the lower part of his town to the higher part, has been invaluable in the development of class field theory. Indeed, when Artin first formulated his acclaimed general reciprocity law, he was unable to prove it; only later, after reading Chebotarev's proof, was he able to come up with a proof of his theorem.

Come to MS.05 to learn about all this, and more! After which we factor into the pub.


DG := <Cryptography>

iStock_000001965326XSmall.jpg
Monday 18th January, 7:30 pm - 9:00 pm - MS.05

Discussion Groups are back for this term, starting with a talk about cryptography by Sir Alexander Thomas Aubrey Oakes, University Number 0624729.

Cryptography can be thought of as the science of keeping secrets. While you may not have any skeletons in the closet, you probably have credit cards, e-mail accounts, personal details and less than 5 passwords that you can remember. To protect these your computer uses algorithms that are publicly known and easily looked up by anyone. If people know exactly how your private information is hidden, how come no one knows that your password is a play on "Manchester City" and that you live in Chelsea?

It's surprising what information can be given away without fully compromising what's important. It is even possible to hold a conversation in the presence of a 3rd party who knows everything you do, and communicate without the 3rd party being able to understand what is being said. This in essence is public key cryptography.

After which, we secretly move on to the pub.


Christmas Meal

futurama-204-santa-noel.png
Tuesday 8th December, 7:30 pm - 9:00 pm - The City Arms, Earlsdon

To all our friends in the Warwick Maths Society, we cordially invite you to join us for our annual Christmas get together this Tuesday.

We will be going out for a meal at The City Arms, in Earlsdon (Coventry), where we will be making the best use of Wetherspoons' steak night offer!

The plan is to gather in the pub at around 7.30, if you are on campus and are not sure how to get to Earlsdon then there will be a crew of helpers around the bus stop at 7pm. The 12 bus goes at 7.05, so don't be late!

We look forward to seeing you on Tuesday.

The WMS Exec.


DG := <Cobordism>

comultiplication.jpg
Thursday 3rd December, 7:30 pm - 9:00 pm - MS.05

Classification of manifolds up to diffeomorphism is a hard problem (deciding whether two given 4-manifolds are diffeomorphic is at least as hard as the word problem for groups). Thom's brilliant idea (which had been considered, before him, by Poincaré and Pontryagin) was to introduce a weaker equivalence relation than diffeomorphism: the equivalence relation of cobordism.

Two $ n $-manifolds are (unoriented) cobordant if their disjoint union is the boundary of an $ n+1 $-manifold with boundary. We can see that we can compose cobordisms end to end, and every manifold is cobordant to itself as we have $ M \coprod M = \partial(M \times I) $, so it is easy to check it is indeed an equivalence relation. In each dimension we can form an abelian group, with operation disjoint union, the $ n $-th cobordism group.

There are other types of cobordism, that arise by putting structure on our manifolds and requiring that the cobordisms preserve this, for example oriented cobordism: we only study oriented manifolds, and the oriented boundary of the $ n+1 $ manifold with boundary has to give the correct orientation on the $ n $-manifolds.

Pontryagin's success was to realise that certain cobordism groups end up being equal to stable homotopy groups of spheres, helping the calculation of the latter.

Thom largely reversed the process and generalised Pontryagin's idea, making an explicit correspondence between cobordism groups and homotopy groups of certain spaces, now called Thom spaces.

Another useful way to study cobordism is through characteristic classes. Many cobordism theories have particular characteristic classes associated to them, and it turns out that two manifolds are cobordant if and only if all the characteristic numbers of these two manifolds agree. This lead to great insights into the theory of characteristic classes, for example the idea of a generalised genus (a topological invariant) as a homomorphism from the cobordism ring to some other ring, for example the rationals. This is then of great interest in classifying manifolds, and allowed things such as Milnor's construction of exotic $ 7 $-spheres.

If you're already impatient to hear more, then you should come to MS.05 this thursday at 7:30 pm; you'll hear about all this and then much more (such as topological quantum field theories!).

After which we realise that we are cobordant to our future selves that are in the pub.


DG := <Algebraic Number Theory>

Monday 30th November, 7:30 pm - 9:00 pm - MS.05

LaTeX Classes

1.png
Tuesday 24th November, 12:00 pm - A0.01

If you've taken a look at any recently published book or mathematical paper, chances are you've already seen what LaTeX can do. LaTeX is, simply put, an elegant and convenient way of typing mathematics on a computer and particularly useful if you would like to typeset any type of mathematical essay or project (second year essays in particular).

Unlike word processors such as Microsoft Word and Open Office Writer, you do not work directly on something which looks like the finished document. Instead, it is much more similar to a programming language (albeit a very simple one): you have to type in text along with a series of commands which determine the mathematical equations, alignment, font size and almost everything else. This may sound daunting at first but is in fact much easier than it sounds and, as usual, the WMS is here to help you: we will be running two LaTeX classes per week during the final three weeks of term, Tuesdays 12-1 and Wednesdays 11-12 (the two classes will have exactly the same content). By the end of these, you should be able to write mathematics much better and faster than you would on a conventional word processor and be able to typeset a professional looking second year essay.


3 4 5 6 ... 10 20
<<Page 2>>