REVIEW 2 cited by
The maximum number of cycles in a triangular-grid billiards system with a given perimeter
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Given a (simple) grid polygon $P$ in a grid of equilateral triangles, Defant and Jiradilok considered a billiards system where beams of light bounce around inside of $P$. We study the relationship between the perimeter $\operatorname{perim}(P)$ of $P$ and the number of different trajectories $\operatorname{cyc}(P)$ that the billiards system has. Resolving a conjecture of Defant and Jiradilok, we prove the sharp inequality $\operatorname{cyc}(P) \leq (\operatorname{perim}(P) + 2)/4$ and characterize the equality cases.
Forward citations
Cited by 2 Pith papers
-
Homology in Combinatorial Refraction Billiards
A graph is expelling, sending every billiard loop around the torus non-contractibly, exactly when it is bipartite; ensnaring graphs have a partial structural theory.
-
Random Subwords and Billiard Walks in Affine Weyl Groups
For random subwords of b^K in an irreducible affine Weyl group, the normalized alcove position converges to a central spherical Gaussian, with an explicit variance formula.
Discussion (0). Continue with ORCID to comment.