{"title":"通过流多边形计算两简约积的细分代数","authors":"Matias von Bell","doi":"10.1007/s00454-024-00671-9","DOIUrl":null,"url":null,"abstract":"<p>For a lattice path <span>\\(\\nu \\)</span> from the origin to a point (<i>a</i>, <i>b</i>) using steps <span>\\(E=(1,0)\\)</span> and <span>\\(N=(0,1)\\)</span>, we construct an associated flow polytope <span>\\({\\mathcal {F}}_{{\\widehat{G}}_B(\\nu )}\\)</span> arising from an acyclic graph where bidirectional edges are permitted. We show that the flow polytope <span>\\({\\mathcal {F}}_{{\\widehat{G}}_B(\\nu )}\\)</span> admits a subdivision dual to a <span>\\((w-1)\\)</span>-simplex, where <i>w</i> is the number of valleys in the path <span>\\({\\overline{\\nu }} = E\\nu N\\)</span>. Refinements of this subdivision can be obtained by reductions of a polynomial <span>\\(P_\\nu \\)</span> in a generalization of Mészáros’ subdivision algebra for acyclic root polytopes where negative roots are allowed. Via an integral equivalence between <span>\\({\\mathcal {F}}_{{\\widehat{G}}_B(\\nu )}\\)</span> and the product of simplices <span>\\(\\Delta _a\\times \\Delta _b\\)</span>, we thereby obtain a subdivision algebra for a product of two simplices. As a special case, we give a reduction order for reducing <span>\\(P_\\nu \\)</span> that yields the cyclic <span>\\(\\nu \\)</span>-Tamari complex of Ceballos, Padrol, and Sarmiento.</p>","PeriodicalId":50574,"journal":{"name":"Discrete & Computational Geometry","volume":"63 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Subdivision Algebra for a Product of Two Simplices via Flow Polytopes\",\"authors\":\"Matias von Bell\",\"doi\":\"10.1007/s00454-024-00671-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>For a lattice path <span>\\\\(\\\\nu \\\\)</span> from the origin to a point (<i>a</i>, <i>b</i>) using steps <span>\\\\(E=(1,0)\\\\)</span> and <span>\\\\(N=(0,1)\\\\)</span>, we construct an associated flow polytope <span>\\\\({\\\\mathcal {F}}_{{\\\\widehat{G}}_B(\\\\nu )}\\\\)</span> arising from an acyclic graph where bidirectional edges are permitted. We show that the flow polytope <span>\\\\({\\\\mathcal {F}}_{{\\\\widehat{G}}_B(\\\\nu )}\\\\)</span> admits a subdivision dual to a <span>\\\\((w-1)\\\\)</span>-simplex, where <i>w</i> is the number of valleys in the path <span>\\\\({\\\\overline{\\\\nu }} = E\\\\nu N\\\\)</span>. Refinements of this subdivision can be obtained by reductions of a polynomial <span>\\\\(P_\\\\nu \\\\)</span> in a generalization of Mészáros’ subdivision algebra for acyclic root polytopes where negative roots are allowed. Via an integral equivalence between <span>\\\\({\\\\mathcal {F}}_{{\\\\widehat{G}}_B(\\\\nu )}\\\\)</span> and the product of simplices <span>\\\\(\\\\Delta _a\\\\times \\\\Delta _b\\\\)</span>, we thereby obtain a subdivision algebra for a product of two simplices. As a special case, we give a reduction order for reducing <span>\\\\(P_\\\\nu \\\\)</span> that yields the cyclic <span>\\\\(\\\\nu \\\\)</span>-Tamari complex of Ceballos, Padrol, and Sarmiento.</p>\",\"PeriodicalId\":50574,\"journal\":{\"name\":\"Discrete & Computational Geometry\",\"volume\":\"63 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-06-28\",\"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-00671-9\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete & Computational Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00671-9","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
A Subdivision Algebra for a Product of Two Simplices via Flow Polytopes
For a lattice path \(\nu \) from the origin to a point (a, b) using steps \(E=(1,0)\) and \(N=(0,1)\), we construct an associated flow polytope \({\mathcal {F}}_{{\widehat{G}}_B(\nu )}\) arising from an acyclic graph where bidirectional edges are permitted. We show that the flow polytope \({\mathcal {F}}_{{\widehat{G}}_B(\nu )}\) admits a subdivision dual to a \((w-1)\)-simplex, where w is the number of valleys in the path \({\overline{\nu }} = E\nu N\). Refinements of this subdivision can be obtained by reductions of a polynomial \(P_\nu \) in a generalization of Mészáros’ subdivision algebra for acyclic root polytopes where negative roots are allowed. Via an integral equivalence between \({\mathcal {F}}_{{\widehat{G}}_B(\nu )}\) and the product of simplices \(\Delta _a\times \Delta _b\), we thereby obtain a subdivision algebra for a product of two simplices. As a special case, we give a reduction order for reducing \(P_\nu \) that yields the cyclic \(\nu \)-Tamari complex of Ceballos, Padrol, and Sarmiento.
期刊介绍:
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.