An Improvement of the Upper Bound for the Number of Halving Lines of Planar Sets
Abstract
:1. Introduction
2. Basic Definitions
3. Asymptotic Improvement of the Upper Bound of
4. Improvement of the Upper Bound of for Small Values of
5. Better Improvements of the Upper Bound of
- If is an odd number and does not divide to , then is attained when is one of the two odd numbers that are closest to for n.
- If is an odd number and divides to , then is attained when for n.
6. Conclusions
Author Contributions
Funding
Data Availability Statement
Conflicts of Interest
References
- Ábrego, B.M.; Cetina, M.; Fernández-Merchant, S.; Leaños, J.; Salazar, G. 3-symmetric and 3-decomposable geometric drawings of Kn. Discret. Appl. Math. 2010, 158, 1240–1258. [Google Scholar] [CrossRef]
- Espinoza-Valdez, A.; Leaños, J.; Ndjatchi, C.; Ríos-Castro, L.M. An Upper Bound Asymptotically Tight for the Connectivity of the Disjointness Graph of Segments in the Plane. Symmetry 2021, 13, 1050. [Google Scholar] [CrossRef]
- Tóth, G. Point sets with many k-sets. Discret. Comput. Geom. 2001, 26, 187–194. [Google Scholar] [CrossRef]
- Dey, T.K. Improved bounds for planar k-sets and related problems. Discret. Comput. Geom. 1998, 19, 373–382. [Google Scholar] [CrossRef]
- Ábrego, B.M.; Cetina, M.; Fernández-Merchant, S.; Leaños, J.; Salazar, G. On (≤k)-edges, crossings, and halving lines of geometric drawings of Kn. Discret. Comput. Geom. 2012, 48, 192–215. [Google Scholar] [CrossRef]
- Rodrigo, J.; López, M.D. An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points. Electron. Notes Discret. Math. 2018, 68, 305–310. [Google Scholar] [CrossRef]
- Ackerman, E. On topological graphs with at most four crossings per edge. Comput. Geom. 2019, 85, 101574. [Google Scholar] [CrossRef]
- Aichholzer, O.; García, J.; Orden, D.; Ramos, P. New lower bounds for the number of ≤k-edges and the rectilinear crossing number of Kn. Discret. Comput. Geom. 2007, 38, 1–14. [Google Scholar] [CrossRef]
- Rodrigo, J.; Merchán, S.; Magistrali, D.; López, M.D. An Improvement of the Lower Bound on the Minimum Number of ≤k-Edges. Mathematics 2021, 9, 525. [Google Scholar] [CrossRef]
- Pach, J.; Radoicic, R.; Tardos, G.; Toth, G. Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. Discret. Comput. Geom. 2006, 36, 527–552. [Google Scholar] [CrossRef]
- Lovasz, L.; Vesztergombi, K.; Warner, U.; Welzl, E. Convex Quadrilaterals and k-sets. Contemp. Math. 2004, 342, 139–148. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Alonso, E.; López, M.; Rodrigo, J. An Improvement of the Upper Bound for the Number of Halving Lines of Planar Sets. Symmetry 2024, 16, 936. https://doi.org/10.3390/sym16070936
Alonso E, López M, Rodrigo J. An Improvement of the Upper Bound for the Number of Halving Lines of Planar Sets. Symmetry. 2024; 16(7):936. https://doi.org/10.3390/sym16070936
Chicago/Turabian StyleAlonso, Estrella, Mariló López, and Javier Rodrigo. 2024. "An Improvement of the Upper Bound for the Number of Halving Lines of Planar Sets" Symmetry 16, no. 7: 936. https://doi.org/10.3390/sym16070936