The Second Carnival Of Mathematics: The Math Geeks are Coming to Town!

Please make sure you read to the end. A couple of late submissions didn’t get worked into the main text, and a complete list of articles is included at the end.

Oy. So I find myself sitting in my disgustingly messy office. And I’ve got a problem. The Math Carnival is coming to town. All those geeks, and the chaos that they always cause. Oy.

Continue reading

This Year's Turing Award Winner

Today, the ACM announced the winner of the Turing award. For those who don’t know, the Turing award is the greatest award in computer science – the CS equivalent of the Nobel prize, or the Fields medal.

The winner: Fran Allen. The first woman ever to win the Turing award. And the first Turing award winner that I’ve personally known. Fran deserves it, and I’m absolutely overjoyed to see her getting the recognition she deserves. Among her many accomplishments, Fran helped design Fortran and create the worlds first optimizing compiler.

One of my fondest memories of work is from 8 years ago. My advisor, Lori Pollock, was up for tenure. Fran was picked as one of the outside reviewers for her tenure case. So in the course of doing the review, she read the papers that Lori and I wrote together – and liked them. The next time she was in my building, she came to my office to introduce herself and talk to me about the papers I’d written. I was absolutely stunned – Fran Allen came looking for me! to talk to me!

Since then, I’ve learned that that’s just the kind of person she is. Fran is a brilliant woman, one of the smartest people I’ve had to opportunity to meet: a person who has done amazing things in her career. And she’s also one of the nicest people you could ever hope to meet. She’s approachable and friendly, and has searched out many junior researchers to give them a bit of encouragement. She’s been a mentor to more people that I could hope to count. She’s just a thoroughly amazing person.

I can’t even begin to say how happy I am for her. She’s earned the greatest award that exists for computer science, and I’m thrilled to see that the ACM recognized that. And knowing Fran, I’m particularly happy that she’s the first woman recipient of the award, because she’s worked so hard in her career to help women overcome the biases of so many people in the mathematical sciences.

Congratulations, Fran!

Conservapedia and Math

Many of my fellow SBers have been mocking the recently unveiled Conservapedia. Conservapedia claims to be a reaction to the liberal bias of Wikipedia. Ed, PZ, Afarensis, Tim, John, and Orac have all piled on already. But why should they get to have all the fun?

Conservapedia has an extensive list of what they claim to be examples of the liberal bias of Wikipedia. My SciBlings have already covered most of the nonsense to be found within, but one point is clearly mine to mock: grievance number 16:

Wikipedia has many entries on mathematical concepts, but lacks any entry on the basic concept of an elementary proof. Elementary proofs require a rigor lacking in many mathematical claims promoted on Wikipedia.

Continue reading

Using Monads for Control: Maybe it's worth a look?

So, after our last installment, describing the theory of monads, and the previous posts, which focused on representing things like state and I/O, I thought it was worth taking a moment to look at a different kind of thing that can be done with monads. We so often think of them as being state wrappers; and yet, that’s only really a part of what we can get from them. Monads are ways of tying together almost anything that involves sequences.

Continue reading

The Koufax Awards

So as many other folks have been pointing out, the Koufax awards have come out with their “Best Expert Blog” nominations, and I’m incredibly pleased to say that GM/BM was nominated!

In case you’re not familiar, the Koufaxes are one of the really serious, prestigious web-awards, aimed primarily at the left-leaning blogosphere.

I realize that my chances of actually winning are pretty damned slim; on the other hand, since PZ is disqualified because he won last year, that means that the rest of us have a chance. Voting isn’t open yet, but when it is, I’ll mention it here. I would really like to make a good showing. The BlogAwards, where GM/BM came in fourth are a very sloppily run silly award; the Koufaxes mean something.

Thanks to whoever nominated me!

Another Revolution in Physics Crackpottery: Electromagnetic Gravity

It’s that time again – yes, we have yet another wacko reinvention of physics that pretends to have math on its side. This time, it’s “The Electro-Magnetic Radiation Pressure Gravity Theory”, by “Engineer Xavier Borg”. (Yes, he signs all of his papers that way – it’s always with the title “Engineer”.) This one is as wacky as Neal Adams and his PMPs, except that the author seems to be less clueless.

At first I wondered if this were a hoax – I mean, “Engineer Borg”? It seems like a deliberately goofy name for someone with a crackpot theory of physics… But on reading through his web-pages, the quantity and depth of his writing has me leaning towards believing that this stuff is legit.

Continue reading

The Order of the Science Scouts of Exemplary Repute and Above Average Physique

Many of my fellow ScienceBloggers have recently declared their membership in
Order of the Science Scouts of Exemplary Repute and Above Average Physique. I’ve been busy, so I haven’t been able to get around to signing up until now. That’s a shame, since some of the badges appear to have been designed specifically for me!

Continue reading

Carnival of Mathematics is coming soon!

Just a quick reminder: the second Carnival of Mathematics is coming up this friday, to be hosted here at GM/BM. If you’ve written any math related articles, get me a link by thursday at the latest. You can either send it to me here at markcc at gmail.com, or via the carnival submission form.

Building Towards Homology: Vector Spaces and Modules

One of the more advanced topics in topology that I’d like to get to is homology. Homology is a major topic that goes beyond just algebraic topology, and it’s really very interesting. But to understand it, it’s useful to have some understandings of some basics that I’ve never written about. In particular, homology uses chains of modules. Modules, in turn, are a generalization of the idea of a vector space. I’ve said a little bit about vector spaces when I was writing about the gluing axiom, but I wasn’t complete or formal in my description of them. (Not to mention the amount of confusion that I caused by sloppy writing in those posts!) So I think it’s a good idea to cover the idea in a fresh setting here.

So, what’s a vector space? It’s yet another kind of abstract algebra. In this case, it’s an algebra built on top of a field (like the real numbers), where the values are a set of objects where there are two operations: addition of two vectors, and scaling a vector by a value from the field.

To define a vector space, we start by taking something like the real numbers: a set whose values form a field. We’ll call that basic field F, and the elements of F we’ll call scalars. We can then define a vector space over F as a set V whose members are called vectors, and which has two operations:

Vector Addition
An operation mapping two vectors to a third vector, +:V×VV
Scalar Multiplication
An operation mapping a scalar and a vector to another scalar: *:F×VV

Vector addition forms an abelian group over V, and scalar multiplication is distributive over vector addition and multiplication in the scalar field. To be complete, this means that the following properties hold:

  • (V,+) are an Abelian group
    • Vector addition is associative: ∀a,b,c∈V: a+(b+c)=(a+b)+c
    • Vector addition has an identity element, 0; ∀a∈V:a+0=0+a=a.
    • Vector addition has an inverse element: ∀a∈V:(∃b∈V:a+b=0.) The additive inverse of a vector a is normally written -a. (Up to this point, this defines (V,+) is a group.)
    • Vector addition is commutative: ∀a,b∈V: a+b=b+a. (The addition of this commutative rule is what makes it an abelian group.)
  • Scalar Multiplication is Distributive
    • Scalar multiplication is distributive over vector addition: ∀a∈F,∀b,c∈V, a*(b+c)=a*b+a*c
    • Scalar multiplication is distributive over addition in F: ∀a,b∈F,∀c∈V: (a+b)*c = (a*c) + (b*c).
    • Scalar multiplication is associative with multiplication in F: ∀a,b∈F,c∈V: (a*b)*c = a*(b*c).
    • The multiplicative identity for multiplication in F is also the identity element for scalar multiplication: ∀a∈V: 1*a=a.

So what does all of this mean? It really means that a vector space is a structure over a field where the elements can be added (vector addition) or scaled (scalar multiplication). Hey, isn’t that exactly what I said at the beginning?

One obvious example of a vector space is a Euclidean space. Vectors are arrows from the origin to some point in the space – and so they can be represented as ordered tuples. So for example, ℜ3 is the three-dimensional euclidean space; points (x,y,z) are vectors. Adding two vectors (a,b,c)+(d,e,f)=(a+d,b+e,c+f); and scalar multiplication x(a,b,c)=(xa,xb,xc).

Following the same basic idea as the euclidean spaces, we can generalize to matrices of a particular size, each of which is a vector space. There are also ways of creating vector spaces using polynomials, various kinds of functions, differential equations, etc.

In homology, we’ll actually be interested in modules. A module is just a generalization of the idea of a vector space. But instead of using a field as a basis the way that you do in a vector space, in a module, the basis is just a general ring; so the basis is less constrained: a field is a commutative ring with multiplicative inverses of all values except 0, and distinct additive and multiplicative identities. So a module does not require multiplicative inverse for the scalars; nor does it require scalar multiplication to be commutative.

Basics: Optimization

Yet another term that we frequently hear, but which is often not properly understood, is the concept of optimization. What is optimization? And how does it work?

The idea of optimization is quite simple. You have some complex situation, where
some variable of interest (called the target) is based on a complex
relationship with some other variables. Optimization is the process of trying to find
an assignment of values to the other variables (called parameters) that produces a maximum or minimum value of the target variable, called
the optimum or optimal value

The practice of optimization is quite a bit harder. It depends greatly
on the relationships between the other variables. The general process of finding
an optimum is called programming – not like programming a computer; the term predates the invention of computers.

Continue reading