Counting Collisions in an N-Billiard System Using Angles Between Collision Subspaces

The principal angles between binary collision subspaces in an N-billiard system in d-dimensional Euclidean space are computed. These angles are computed for equal masses and arbitrary masses. We then provide a bound on the number of collisions in the planar 3-billiard system problem. Comparison of this result with known billiard collision bounds in lower dimensions is discussed.

A Factorization of Least-Squares Projection Schemes for Ill-Posed Problems

We give a factorization formula to least-squares projection schemes, from which new convergence conditions together with formulas estimating the rate of convergence can be derived. We prove that the convergence of the method (including the rate of convergence) can be completely determined by the principal angles between {T^{\dagger}T(X_{n})} and {T^{*}T(X_{n})}, and the principal angles between {X_{n}\cap(\mathcal{N}(T)\cap X_{n})^{\perp}} and {(\mathcal{N}(T)+X_{n})\cap\mathcal{N}(T)^{\perp}}. At the end, we consider several specific cases and examples to further illustrate our theorems.

Rational Trigonometry in Higher Dimensions and a Diagonal Rule for $2$-planes in Four-dimensional Space

We extend rational trigonometry to higher dimensions by introducing rational invariants between $k$-subspaces of $n$-dimensional space to give an alternative to the canonical or principal angles studied by Jordan and many others, and their angular variants. We study in particular the cross, spread and det-cross of $2$-subspaces of four-dimensional space, and show that Pythagoras theorem, or the Diagonal Rule, has a natural generalization forsuch $2$-subspaces.