Asymptotic enumeration of non-crossing partitions on surfaces

Rué Perna, Juan José; Sau, Ignasi; Thilikos Touloupas, Dimitrios

doi:10.1016/j.disc.2012.12.011

View/Open

VERSIO-DM.pdf (1,028Mb)

View Usage Statistics

Cita com:

Show full item record

Rué Perna, Juan José

Sau, Ignasi

Thilikos Touloupas, Dimitrios

Document typeArticle

Defense date2013-03-01

Rights accessOpen Access

Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain

ProjectEXPLOREMAPS - Combinatorial methods, from enumerative topology to random discrete structures and compact data representations. (EC-FP7-208471)

Abstract

We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface S and introduce the number CS(n) of noncrossing partitions of a set of n points laying on the boundary of S

CitationRue, J., Sau, I., Thilikos, D. Asymptotic enumeration of non-crossing partitions on surfaces. "Discrete mathematics", 1 Març 2013, vol. 313, núm. 5, p. 635-649.

URIhttp://hdl.handle.net/2117/104401

DOI10.1016/j.disc.2012.12.011

ISSN0012-365X

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
VERSIO-DM.pdf		1,028Mb	PDF	View/Open

UPCommons. Global access to UPC knowledge

Asymptotic enumeration of non-crossing partitions on surfaces

View/Open

Browse