Ok, back to curves. We’d wandered a bit in the direction of this topic before, having discussed Bezout’s Theorem and the Riemann-Roch Theorem. Today we’ll talk about the Hurwitz formula, also called the Riemann-Hurwitz formula. It’s a rather nice result, and combined with Riemann-Roch can be used to prove a huge amount about curves and maps between curves.

### July 2008

July 31, 2008

## Hurwitz’s Theorem

Posted by Charles Siegel under AG From the Beginning, Algebraic Geometry, Big Theorems, Curves1 Comment

July 30, 2008

## Computing Hilbert Functions

Posted by Charles Siegel under AG From the Beginning, Algebraic Geometry, Computational Methods1 Comment

Today, we’ll link the computational thread back to the thread involving Hilbert schemes, by working out how to compute the Hilbert function (and thus polynomial) for any ideal in the ring . The trick involves Groebner bases and flat families, and really ties a lot of threads together so that we can move on to something else (because my attention span is short and there are a lot of cool things to talk about.) (more…)

July 29, 2008

## Resultants

Posted by Charles Siegel under AG From the Beginning, Algebraic Geometry, Computational Methods[8] Comments

Let’s say that you have two polynomials, and you REALLY need to know if they have a common root. Now, if they’re quadratic, you’re in luck, because we can solve them both completely and just check. In fact, if you’re patient, you can do it whenever the Galois group is solvable, in particular, you can do it for cubics and quartics. But in general? What if I gave you a degree 100 polynomial and a degree 103 polynomial? Well, you can still do it, without having to solve anything.

July 28, 2008

## Elimination and Extension Theorems

Posted by Charles Siegel under AG From the Beginning, Algebraic Geometry, Big Theorems, Computational Methods[11] Comments

Last time we talked about Groebner bases and Buchberger’s algorithm, so today we’ll do an application of them. In fact, a few, because the Elimination Theorem and the Extension Theorem are extremely useful results, and we’ll talk a bit about their geometric consequences. But first, the algebra:

July 25, 2008

Well, I’m taking the day off, but instead of looking for my stuff, you can all go over to the Logic Nest and read the 37th Carnival of Mathematics. Hmm…I had been intending to write something for it, but it slipped my mind. Oh well.

July 24, 2008

## Groebner Bases and Buchberger’s Algorithm

Posted by Charles Siegel under AG From the Beginning, Algebraic Geometry, Big Theorems, Computational Methods[7] Comments

After all that technical work and careful but rather abstract technique developed for the construction of a bunch of moduli spaces, I’ve decided to take a break from that line of reasoning and to look to one that’s rather dear to me. It’s probably just that these methods were my first real introduction to algebraic geometry, and I use them to construct examples routinely. We’re not just dropping back to varieties here, we’re going all the way back to affine varieties over an algebraically closed field for a bit, and eventually will be stepping all the way back to characteristic zero for some stuff related to representation theory. Well, truthfully, it’s time for algebra in the coordinate ring.

July 24, 2008

I’ve seen a lot of people playing with Wordle on their blogs lately, so here’s a wordle picture to represent the Algebraic Geometry from the Beginning series. I’ve removed some English words, removed plurals on a lot of words, and changed things like to “Tensor Product” to make it more representative. Here it is: