Papers
Topics
Authors
Recent
Search
2000 character limit reached

Billiard complexity in rational polyhedra

Published 20 Mar 2012 in math.DS | (1203.4350v1)

Abstract: We give a new proof for the directional billiard complexity in the cube, which was conjectured in \cite{Ra} and proven in \cite{Ar.Ma.Sh.Ta}. Our technique gives us a similar theorem for some rational polyhedra.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Nicolas Bedaride 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up