cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A029729 Degree of the variety of pairs of commuting n X n matrices.

Original entry on oeis.org

1, 3, 31, 1145, 154881, 77899563, 147226330175, 1053765855157617, 28736455088578690945, 3000127124463666294963283, 1203831304687539089648950490463, 1862632561783036151478238040096092649, 11143500837236042423379349834982088594105985
Offset: 1

Views

Author

Nolan R. Wallach (nwallach(AT)euclid.ucsd.edu), Dec 11 1999

Keywords

Comments

Also, ratio of vector elements of the ground state in the loop representation of the braid-monoid Hamiltonian H = Sum_i (3 - 2 e_i - b_i) with size 2n and periodic boundary conditions. Specifically the smallest element that corresponds to a non-crossing chord diagram, divided by the overall smallest element. We reduce the standard braid-monoid algebra to the Brauer algebra B_{2n}(1). - B. Nienhuis & J. de Gier (B.Nienhuis(AT)UvA.NL), May 13 2004. For a proof that this is the same sequence, see the articles by P. Di Francesco and P. Zinn-Justin and A. Knutson and P. Zinn-Justin.
These numbers arise in a similar way to A005130 and related sequences appear in the groundstate of the integrable Temperley-Lieb Hamiltonian.
It is also the weighted enumeration of lattice paths on an n X n square lattice going from the left side to the top side, with same initial and final orders of paths, and with a weight of 2 per vertex where a path turns 90 degrees. - Paul Zinn-Justin, Mar 05 2023

Examples

			n=1: Degree of C X C which is 1. n=2: The degree can be calculated by hand to be 3. n=3: See Macaulay manual (link above): one of steps in proof that variety for 3 X 3 is Cohen-Macaulay is to compute the degree which is 31. (n=4) Matt Clegg (CS at UCSD) and Nolan Wallach using 10 Sun Workstations and a distributed Grobner Basis package (in 1993).
(2(e1 + e2 + e3 + e4) + b1 + b2 + b3 + b4)(G + G e2 + b2)(e1 e3 b2) = 12 (G + G e2 + b2)(e1 e3 b2) with G = 3, therefore a(2) = 3
		

Crossrefs

Cf. A005130.

Formula

There is a formula in terms of divided differences operators (too complicated to reproduce here).

Extensions

Entry revised based on comments from Paul Zinn-Justin, Mar 14 2005
Terms a(12) and beyond from Paul Zinn-Justin, Mar 05 2023