2000 character limit reached
Link Patterns and the Catalan Tree
Published 21 May 2013 in math.CO | (1305.4877v1)
Abstract: We demonstrate that a natural construction based on the two notions of insertion of a strand and finding the preimages of Temperley-Lieb algebra generators give an inductive means to generate all link patterns of a given number of strands. It is shown that the structure of the Catalan tree (as defined by Julian West) arises in the process of this induction, and that it can be exploited to give some refined enumerations of link patterns.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.