Generalized Trace Diagram Recurrences and the Computation of nj-Symbols

Generalized Trace Diagram Recurrences and the Computation of nj-Symbols , in preparation.

Abstract: Describes a general technique that produces a recurrence formula for each closed loop in a trace diagram, with an application to the computation of nj-symbols.

Return to list of publications and talks

cattrace combinatorics in-progress nj-symbols recurrence trace-diagrams

page revision: 1, last edited: 26 Mar 2009 12:35

Edit Tags History Files Print Site tools + Options

Click here to edit contents of this page.

Click here to toggle editing of individual sections of the page (if possible). Watch headings for an "edit" link when available.

Append content without editing the whole page source.

Check out how this page has evolved in the past.

If you want to discuss contents of this page - this is the easiest way to do it.

View and manage file attachments for this page.

A few useful tools to manage this Site.

See pages that link to and include this page.

Change the name (also URL address, possibly the category) of the page.

View wiki source for this page without editing.

View/set parent page (used for creating breadcrumbs and structured layout).

Notify administrators if there is objectionable content in this page.

Something does not work as expected? Find out what you can do.

General Wikidot.com documentation and help section.

Wikidot.com Terms of Service - what you can, what you should not etc.

Wikidot.com Privacy Policy.

ElishaPeterson

Other interesting sites

Backrooms Control

塔尔塔罗斯

Sven Co-op Map Database

The Gamer Dome