Search

This paper provides an introduction to trace diagrams at a level suitable for advanced undergraduates. Trace diagrams are a non-traditional notation for linear algebra. Vectors are represented by edges in a diagram, and matrices by markings along the edges of the diagram. The notation is rigorous and permits proofs more elegant than those written using traditional notation. We begin with the definition of trace diagrams, and move directly into two special cases that help orient the reader to the diagrammatic point-of-view. We then provide an explicit description of how they are calculated. Finally, we provide the diagrammatic perspective on some questions often posed by students seeing vectors and linear algebra for the first time. We also look at some questions inspired by the diagrammatic notation. We include several examples and exercises throughout, which are particularly important for adjusting to nonstandard notation., Comment: Several figures created using PGF/TikZ

In contrast to the classical cake-cutting problem (how to fairly divide a desirable object), "chore division" is the problem of how to divide an undesirable object. We develop the first explicit algorithm for envy-free chore division among N people, a counterpart to the N-person envy-free cake-division solution of Brams-Taylor (1995). This is accomplished by exploiting a notion of "irrevocable advantage" for chores. We discuss the differences between cake-cutting and chore division and additional problems encountered in chore division., Comment: 7 pages, 1 figure. See related work at http://www.math.hmc.edu/~su/papers.html

This paper extends the theory of subset team games, a generalization of cooperative game theory requiring a payoff function that is defined for all subsets of players. This subset utility is used to define both altruistic and selfish contributions of a player to the team. We investigate properties of these games, and analyze the implications of altruism and selfishness for general situations, for prisoner's dilemma, and for a specific game with a Cobb-Douglas utility.

This note concerns a one-line diagrammatic proof of the Cayley-Hamilton Theorem. We discuss the proof's implications regarding the "core truth" of the theorem, and provide a generalization. We review the notation of trace diagrams and exhibit explicit diagrammatic descriptions of the coefficients of the characteristic polynomial, which occur as the n+1 "simplest" trace diagrams. We close with a discussion of diagrammatic polarization related to the theorem.

Let G=SL(2,C) and F_r be a rank r free group. Given an admissible weight in N^{3r-3}, there exists a class function defined on Hom(F_r,G) called a central function. We show that these functions admit a combinatorial description in terms of graphs called trace diagrams. We then describe two algorithms (implemented in Mathematica) to compute these functions., Comment: to appear in Geometriae Dedicata

Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph coloring, and prove that they may be efficiently represented in terms of matrix minors. Using this viewpoint, we provide new proofs of several standard determinant formulas and a new generalization of the Jacobi determinant theorem., Comment: This updated version includes significantly expanded proofs and a new generalization of the Jacobi determinant theorem

Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from linear algebra that offers elegant solutions to all these questions. The doodles, known as trace diagrams, are graphs labeled by matrices which have a correspondence to multilinear functions. This correspondence permits computations in linear algebra to be performed using diagrams. The result is an elegant theory from which standard constructions of linear algebra such as the determinant, the trace, the adjugate matrix, Cramer's rule, and the characteristic polynomial arise naturally. Using the diagrams, it is easy to see how little structure gives rise to these various results, as they all can be `traced' back to the definition of the determinant and inner product., Comment: Expository article intended to be accessible to a general audience

Denote the free group on 2 letters by F_2 and the SL(2,C)-representation variety of F_2 by R=Hom(F_2,SL(2,C)). The group SL(2,C) acts on R by conjugation. We construct an isomorphism between the coordinate ring C[SL(2,C)] and the ring of matrix coefficients, providing an additive basis of C[R]^SL(2,C) in terms of spin networks. Using a graphical calculus, we determine the symmetries and multiplicative structure of this basis. This gives a canonical description of the regular functions on the SL(2,C)-character variety of F_2 and a new proof of a classical result of Fricke, Klein, and Vogt., Comment: Updated historical treatment of the subject. Figures drawn with PGF/TikZ; Handbook of Teichmuller Theory II, A. Papadopoulos (ed), EMS Publishing House, Zurich, 2008