Here is an interesting problem I heard about during a talk by Ellen Gethner. Given a graph , the thickness of
is the least size of a collection of planar graphs on the vertices of
such that
is the union of these planar graphs. This is related to things like layering electrical circuits on a chip with multiple layers. The thickness is an interesting invariant. In particular, the following question exists: What is the maximal chromatic number of a graph of thickness
? For each
, this value is known to be one of
, though which of these is the correct answer for each
is still unknown. For
, this value is one of
. For
, this is the celebrated four-color theorem for planar graphs. A recent paper by Gethner and others in the Journal of Graph Theory (a preprint is available on Gethner’s website) provides an infinite family of chromatic number
graphs with thickness
. I think this is a beautiful problem and worthy of more attention.
Thickness of graphs
August 13, 2008 · No Comments
→ No CommentsCategories: Combinatorics
Reflections on Mathfest 2008
August 3, 2008 · No Comments
Mathfest 2008, held in beautiful Madison, WI, has just finished up. As I am sitting in a coffeehouse on State Street, I would like to share some of the mathematical highlights.
- Erik Demaine, Hedrick Lecturer. Erik Demaine gave a phenomenal triple of talks about Folding, Algorithms, Art, Magic, Transformers, Reconfigurable Robots, and other equally cool stuff. A highlight for me was the discussion on Saturday of the recent proof that given any finite set of polygons, all having equal area, in the plane, there exists a hinged dissection of one of them that allows a hinged transformation to any of the others! Amazing. Another highlight was his discussion of modern technical origami; I have not paid too much attention to origami since I was in elementary school, but examples like this blew my mind completely. A wonderful synthesis of algorithms and art.
- The minicourse I took on the Geometry of Voting from Don Saari of UC - Irvine. I highly recommend for non-mathematicians and mathematicians alike his book Chaotic Elections. Hopefully in the future I will be able to post some more thoughts about the mathematics behind elections and voting.
→ No CommentsCategories: Conferences
Pebbles on the Beach
July 21, 2008 · No Comments
The banner photo for this website is from a beach on the island of Sandon in the Stockholm Archipelago. In May and June 2008, we took a family trip to Stockholm in conjunction with my attendance at the Festive Combinatorics conference in honor of Anders Bjorner. This was a beautiful conference, certainly one of the best I have attended. Making it all the more enjoyable was that my wife completed the Stockholm Marathon the day after the conference ended! Excellent.
→ No CommentsCategories: Uncategorized
Cohen Macaulay Algebras and Non-negativity
July 18, 2008 · 1 Comment
One element of topological and algebraic combinatorics that I found very difficult to understand as a graduate student was the Cohen-Macaulay property for a graded algebra. In particular, the Hilbert series of a standard graded Cohen-Macaulay algebra has non-negative integer coefficients in the numerator polynomial when represented as a rational function. This non-negativity result is extremely powerful; for some consequences, see the book Combinatorial Commutative Algebra, by Miller and Sturmfels, section 13.4, or the book Combinatorics and Commutative Algebra by Richard Stanely. This post is an attempt to make clear, on a very basic level, why the non-negativity result is true.
In the following, assume for simplicity that all our algebras are -graded
-algebras. Let’s begin with an example.
Consider the standard two-dimensional simplex, i.e. the polytope . The cone over
, denoted
, is defined as the set of all non-negative real linear combinations of the vectors
. Consider the semigroup algebra
given by the set of all integer points in the cone over
. It is not hard to see that
For a non-negative integer , the number of lattice points in
is equal to the number of non-negative integer solutions to the equation
. This is also the number of monomials in the
graded component of
, where the grading is by the
-value. Finally, if we change variables in our example and write
and
, then
, where
is endowed with the standard grading.
The realization of as a polynomial ring in three variables is an instance of the Cohen-Macaulay condition.
Let’s see how this works in general. Given a graded algebra , an element
is called homogeneous of degree
if
for some
.
We say that homogeneous elements are algebraically independent if for all
such that
, we have
as a polynomial.
The first tool we need to introduce is the Noether Normalization Lemma, which states that our finitely generated algebra contains a polynomial ring
such that
is a finitely generated
-module.
Noether Normalization Lemma Let be a finitely generated algebra. Then there exist a finite number of homogeneous elements
such that
- the elements
are algebraically independent over
; and
- there exist a finite number of homogeneous elements
such that each element
can be expressed in the form
where each
is a polynomial in
which depends on
.
The sequence is called a system of parameters for
. It can be shown that the number
, called the Krull dimension of
, is uniquely determined by
. It is also not hard to see that the Krull dimension of
is 0 if and only if
for all sufficiently large
. A system of parameters is called regular if, for some choice of
in the second condition of the Noether Theorem, the coefficients
are unique for every
. The existence of regular systems of parameters is an important condition, earning the following special designation: A finitely generated algebra
is called Cohen-Macaulay if some system of parameters for
is regular. The Cohen-Macaulay condition implies that
is a free module over the polynomial ring, i.e. a direct sum of polynomial rings (not all necessarily generated by degree
elements).
As another example, consider the following sub-algebra of :
Following the notation of the Noether Normalization Lemma, if we let , then
is a module over
generated by
. If we set
, then each element of
has a unique representation in the form of the second condition of the Noether Lemma. This can be seen by first noting that the elements of
are linear combinations of a constant term and monomials with exponent greater than or equal to
. By looking at the residue classes of the exponents of such monomials modulo
, we can group terms by residue class and hence get our unique expression. Thus,
is Cohen-Macaulay of Krull dimension one. Specifically,
where the notation indicates that the grading on the second and third summands is increased by and
, respectively. Note that this decomposition implies that the Hilbert series of
is
Our two examples above illustrate how a finitely generated Cohen-Macaulay algebra can be represented as a direct sum of isomorphic polynomial rings, with the number of variables in the polynomial rings determined by the Krull dimension of
. As demonstrated in our second example, the grading of each summand might be shifted. One may also consider polynomial rings where the variables are not all of degree
, for example the polynomial ring
, where the degree of
is denoted by
. It is easy to see that the Hilbert series for
collapses as the following rational generating function:
Given that a Cohen-Macaulay algebra is a direct sum of polynomial rings in
variables, one would expect that the Hilbert series for
would be a (possibly shifted) sum of Hilbert series of the form in our last example. This indeed turns out to be the case; the following theorem provides the non-negativity we were looking for. It occurs because we are looking at direct sums where the summands have shifted gradings!
Theorem Suppose that is Cohen-Macaulay of Krull dimension
. Let
be a system of parameters with
of degree
. Then for some
, the Hilbert series
is of the form
with each
.
→ 1 CommentCategories: Algebra · Combinatorics
Welcome to my weblog
July 17, 2008 · No Comments
Welcome to my mathematics weblog. Please take a look at my “About” page and check back regularly for new posts.
→ No CommentsCategories: Uncategorized