Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.17244 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912082226577408 |
|---|---|
| author | Bohnert, Martin Springer, Justus |
| author_facet | Bohnert, Martin Springer, Justus |
| contents | We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a suitable normal form. Executing our classification, we obtained a dataset of several billions of polygons covering a wide variety of cases. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_17244 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Classifying rational polygons with small denominator and few interior lattice points Bohnert, Martin Springer, Justus Combinatorics 52C05, 52B20 We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a suitable normal form. Executing our classification, we obtained a dataset of several billions of polygons covering a wide variety of cases. |
| title | Classifying rational polygons with small denominator and few interior lattice points |
| topic | Combinatorics 52C05, 52B20 |
| url | https://arxiv.org/abs/2410.17244 |