REVIEW
Upper bound on the number of collisions of pinned billiard balls
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
Upper bound on the number of collisions of pinned billiard balls
read the original abstract
We consider systems of "pinned balls," i.e., balls that have fixed positions and pseudo-velocities. Pseudo-velocities change according to the same rules as those for velocities of totally elastic collisions between moving balls. The times of possible pseudo-collisions for different pairs of pinned balls are chosen in an exogenous way. We give an explicit upper bound for the maximum number of pseudo-collisions for a system of $n$ pinned balls in a $d$-dimensional space. The proof is based on analysis of foldings, i.e., mappings that formalize the idea of folding a piece of paper along a crease. We prove an upper bound for the size of an orbit of a point subjected to foldings.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.