Martin’s Blog

You might say that I could have spent my time better but after a few hours of work I was able to make this rather inscrutable picture. Any guesses as to what it’s doing?

1/3 is ‘correct’ by exactly Dave’s solution. I was going to provide a more detailed and motivated exposition but I don’t think I can be bothered. My knowledge of Bayesian inference comes exclusively from reading the first half of section two of McKay’s textbook Information Theory, Inference and Learning Algorithms so you can read that and know as much as I do.

So, points for Dave for doing what the book did, Yuliya for getting approximately the right answer first and Leesa for having both the worst and possibly the best answer.

The answer of 0.3 is clearly terrible: if you are a frequentist that doesn’t believe in probability representing belief then your real answer should be that the 10 flips are not at all significant.

But the 0.3485 might be pretty good. What was your prior Leesa? I can certainly believe that a prior that is normal with mean 0.5 and some smallish standard deviation is perhaps more reasonable than a uniform prior and that should give us an answer above 1/3.

You toss a (not necessarily fair) coin 10 times and get three heads. What is the probability of getting a head on the next toss?

Guesses and answers with some calculations are both acceptable.

The argument of a complex number is defined to be a number which represents the angle of the vector corresponding to the number measured from the positive real axis. If you draw a picture of this setup your first thought is that . Unfortunately this can't work because the range of is . It is true that but ever since I learnt about complex numbers 8 years ago or so I just knew that you had to draw the picture and think about it to solve this equation for .

But just a few days ago I discovered* that there does exist a formula! (well, it can’t give you an answer of but apart from that it works). It is the rather mysterious statement . Wikipedia says that it’s related to half angle trigonometry but looking at the formula you should also be able to get it from a picture of a circle.

*reading something on Wikipedia is a form of discovery, right?

So here’s one way to come up with it: Draw the point in the complex plane and then draw the circle centred at the origin that goes through the point. Now consider the following diagram.

The angle at the boundary of the circle is half of that at the centre (that’s a theorem from circle geometry but it’s pretty easy to see from the picture in this case). The radius of the circle is so you have and this time you can invert with the standard function.

This seems quite weird to me: that this function works but the other doesn’t. It’s a stereographic projection I guess and is a better coordinate than …

This formula isn’t actually that useful but it was just what I wanted to find to do a question from my complex analysis homework 0, so it was helpful to someone somewhere.

Algebraic Geometry: This was a pretty scary class and the professor on the last day said “You probably haven’t learnt anything in the last 6 months.” He may have been right in my case. The other great quote was when he said “Hartshorne was a wimp” (he later clarified that he only meant he was a wimp in how he deals with arithmetic).
We talked about schemes, sheaves, Cech cohomology and various topics like line bundles and the Riemann-Roch theorem. The nice thing about the approach taken was that it was very geometric: the horrible commutative algebra that underlies everything was kind of ignored. We didn’t prove a whole lot but I feel that I now have some idea of this vast edifice that is algebraic geometry.
There ended up being no assessment at all in this class but I did spend many hours trying to figure out what the notes I took were going on about.

Integral Lattices: This class was taught by a teaching robot – he was amazing, going for 75 minutes every Tuesday and Thursday without ever looking at his notes or stopping to breathe. He was very good at including all the details but not so good at explaining why we should be interested.
The topic of the course was lattices: basically abelian groups with a quadratic form that give you the length of a vector. Quadratic forms are used all over the place in number theory, geometry, algebra, physics, etc. but I still don’t really know what the point of some of the things we did were. I don’t really care how many even unimodular lattices of rank 24 there are. Some of the applications to sphere packing/coding theory were interesting although they are more useful to mathematicians than people in the real world. I gave a small talk about a coding theory result that implied a fact about lattices that you can look at here.

Channel Coding: This was an engineering course and required a fair bit of work but much of it was programming which is nice. I am now able to write mediocre C code, which will I’m sure be useful to me in my life.
In contrast to the high speed lectures of the two courses above this class went kind of slowly and there were lecture notes provided. It was occasionally frustrating – we covered the Berlekamp-Massey algorithm just by writing it down (no explanation of why it worked) and then going through amazingly complicated examples by hand. I certainly am pretty good at doing finite field calculations by now though.
But overall it was very nice to do something useful in the real world and see a lot of different topics.

As a postscript I realise that I may seem negative in my reviews of these courses but I do think they were taught pretty well. I would say that I’ve never taken an advanced maths course that I was entirely happy with. Still, lectures are the best way to learn things I think so I don’t really know how to improve them.

As usual, every class I have requires an end of semester project. I’m kind of obsessed with coding theory at the moment so I’m doing all my projects on topics related to that.

Algebraic Geometry – writing an expository paper on Algebraic Geometry codes (see this book for example).

Integral Lattices – giving a talk on a paper of Koch titled “On Self-Dual, Doubly Even Codes of Length 32″.

Channel Coding – Writing computer programs to simulate CRC burst error detection and Berlekamp-Massey decoding of a Reed-Solomon code.

A talk I gave today in the applied math graduate seminar. You might be sick of looking at my talks but this one has pictures and stuff – it’s meant for applied mathematicians.