Colored ray configurations
Ruy Fabila-Monroy, Alfredo Garc\'ia, Ferran Hurtado, Rafel, Jaume, Pablo P\'erez-Lantero, Maria Saumell, Rodrigo I. Silveira and, Javier Tejel, Jorge Urrutia

TL;DR
This paper investigates the combinatorial possibilities of colored ray configurations emanating from balanced bichromatic point sets, establishing bounds, algorithms, and differences between disjoint and crossing rays.
Contribution
It introduces bounds and algorithms for realizing color sequences from point sets, and compares configurations with disjoint and crossing rays.
Findings
Lower bound on realizable color sequences for disjoint rays
Algorithms to decide sequence realizability from point sets
Asymptotic differences between crossing and disjoint ray configurations
Abstract
We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays are required to be pairwise disjoint. We derive a lower bound on the number of color sequences that can be realized from any such fixed point set and examine color sequences that can be realized regardless of the point set, exhibiting negative examples as well. We also provide a tight upper bound on the number of configurations that can be realized from a point set, and point sets for which there are asymptotically less configurations than that number. In addition, we provide algorithms to decide whether a color sequence is realizable from a given point set in a line or in general position. We address afterwards the variant of the problem where the rays are allowed to intersect. We prove that for some…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
