[2211.16621] Vertex Classification of Planar C-polygons Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Mathematics > Combinatorics arXiv:2211.16621 (math) [Submitted on 29 Nov 2022] Title: Vertex Classification of Planar C-polygons Authors: Illya Ivanov , Cameron Strachan View a PDF of the paper titled Vertex Classification of Planar C-polygons, by Illya Ivanov and 1 other authors View PDF HTML (experimental) Abstract: Given a convex domain $C$, a $C$-polygon is an intersection of $n\geq 2$ homothets of $C$. If the homothets are translates of $C$ then we call the intersection a translative $C$-polygon. This paper proves that if $C$ is a strictly convex domain with $m$ singular boundary points, then the number of singular boundary points a $C$-polygon has is between $n$ and $2(n-1)+m$. For a translative $C$-polygon we show the number of singular boundary points is between $n$ and $n+m$. Subjects: Combinatorics (math.CO) ; Geometric Topology (math.GT) Cite as: arXiv:2211.16621 [math.CO] (or arXiv:2211.16621v1 [math.CO] for this version) https://doi.org/10.48550/arXiv.2211.16621 Focus to learn more arXiv-issued DOI via DataCite Related DOI : https://doi.org/10.1007/s00022-024-00734-5 Focus to learn more DOI(s) linking to related resources Submission history From: Cameron Strachan Mr. [ view email ] [v1] Tue, 29 Nov 2022 22:54:46 UTC (752 KB) Full-text links: Access Paper: View a PDF of the paper titled Vertex Classification of Planar C-polygons, by Illya Ivanov and 1 other authors View PDF HTML (experimental) TeX Source view license Current browse context: math.CO < prev | next > new | recent | 2022-11 Change to browse by: math math.GT References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from