Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userWhen different norms lead to same billiard trajectories?
53
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper, extending the works of Milena Radnovic and Serge Tabachnikov, we establish conditions for two different non-symmetric norms to define the same billiard reflection law.
rate research
Read More
A Wasserstein spaces is a metric space of sufficiently concentrated probability measures over a general metric space. The main goal of this paper is to estimate the largeness of Wasserstein spaces, in a sense to be precised. In a first part, we generalize the Hausdorff dimension by defining a family of bi-Lipschitz invariants, called critical parameters, that measure largeness for infinite-dimensional metric spaces. Basic properties of these invariants are given, and they are estimated for a naturel set of spaces generalizing the usual Hilbert cube. In a second part, we estimate the value of these new invariants in the case of some Wasserstein spaces, as well as the dynamical complexity of push-forward maps. The lower bounds rely on several embedding results; for example we provide bi-Lipschitz embeddings of all powers of any space inside its Wasserstein space, with uniform bound and we prove that the Wasserstein space of a d-manifold has power-exponential critical parameter equal to d.
We prove some recent experimental observations of D. Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the one-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.
A rigidity theory is developed for bar-joint frameworks in linear matrix spaces endowed with a unitarily invariant norm. Analogues of Maxwells counting criteria are obtained and minimally rigid matrix frameworks are shown to belong to the matroidal class of (k,l)-sparse graphs for suitable k and l. A characterisation of infinitesimal rigidity is obtained for product norms and it is shown that K_6 - e (respectively, K_7) is the smallest minimally rigid graph for the class of 2 x 2 symmetric (respectively, hermitian) matrices with the trace norm.
In this note we apply the billiard technique to deduce some results on Viterbos conjectured inequality between volume of a convex body and its symplectic capacity. We show that the product of a permutohedron and a simplex (properly related to each other) delivers equality in Viterbos conjecture. Using this result as well as previously known equality cases, we prove some special cases of Viterbos conjecture and interpret them as isoperimetric-like inequalities for billiard trajectories.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
