Stella Cohen, Michael Dougherty, Andrew D. Harsh, Spencer Park Martin
{"title":"Noncrossing Partition Lattices from Planar Configurations","authors":"Stella Cohen, Michael Dougherty, Andrew D. Harsh, Spencer Park Martin","doi":"10.1007/s00454-024-00682-6","DOIUrl":null,"url":null,"abstract":"<p>The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large family of new noncrossing partition lattices with both of these properties, each parametrized by a configuration of <i>n</i> points in the plane.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"1 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00682-6","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large family of new noncrossing partition lattices with both of these properties, each parametrized by a configuration of n points in the plane.
期刊介绍：
Discrete & Computational Geometry (DCG) is an international journal of mathematics and computer science, covering a broad range of topics in which geometry plays a fundamental role. It publishes papers on such topics as configurations and arrangements, spatial subdivision, packing, covering, and tiling, geometric complexity, polytopes, point location, geometric probability, geometric range searching, combinatorial and computational topology, probabilistic techniques in computational geometry, geometric graphs, geometry of numbers, and motion planning.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
