**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Hamiltonian dynamics on convex polytopes

Description

This lecture by the instructor covers Hamiltonian dynamics on convex polytopes, focusing on symplectic capacities, Ekeland-Hofer-Zehnder capacity, sub-additivity for hyperplane cuts, and maximizers of systolic ratio. The lecture delves into various conjectures, including those by Hermann, Hofer, Viterbo, and Akopyan-Karasev-Petrov. It explores the EHZ capacity, closed characteristics, and Viterbo's conjecture for simplices in R4. The main results regarding the EHZ capacity for convex polytopes are discussed, along with examples and proofs related to the systolic ratio maximizers and sub-additivity for hyperplane cuts.

Login to watch the video

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (212)

Related lectures (557)

Convex polytope

A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the -dimensional Euclidean space . Most texts use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue.

Polyhedron

In geometry, a polyhedron (: polyhedra or polyhedrons; ) is a three-dimensional shape with flat polygonal faces, straight edges and sharp corners or vertices. A convex polyhedron is a polyhedron that bounds a convex set. Every convex polyhedron can be constructed as the convex hull of its vertices, and for every finite set of points, not all on the same plane, the convex hull is a convex polyhedron. Cubes and pyramids are examples of convex polyhedra. A polyhedron is a 3-dimensional example of a polytope, a more general concept in any number of dimensions.

Regular 4-polytope

In mathematics, a regular 4-polytope is a regular four-dimensional polytope. They are the four-dimensional analogues of the regular polyhedra in three dimensions and the regular polygons in two dimensions. There are six convex and ten star regular 4-polytopes, giving a total of sixteen. The convex regular 4-polytopes were first described by the Swiss mathematician Ludwig Schläfli in the mid-19th century. He discovered that there are precisely six such figures.

Polytope

In elementary geometry, a polytope is a geometric object with flat sides (faces). Polytopes are the generalization of three-dimensional polyhedra to any number of dimensions. Polytopes may exist in any general number of dimensions n as an n-dimensional polytope or n-polytope. For example, a two-dimensional polygon is a 2-polytope and a three-dimensional polyhedron is a 3-polytope. In this context, "flat sides" means that the sides of a (k + 1)-polytope consist of k-polytopes that may have (k – 1)-polytopes in common.

Proof theory

Proof theory is a major branch of mathematical logic and theoretical computer science within which proofs are treated as formal mathematical objects, facilitating their analysis by mathematical techniques. Proofs are typically presented as inductively-defined data structures such as lists, boxed lists, or trees, which are constructed according to the axioms and rules of inference of a given logical system. Consequently, proof theory is syntactic in nature, in contrast to model theory, which is semantic in nature.

Geodesic Convexity: Theory and Applications

Explores geodesic convexity in metric spaces and its applications, discussing properties and the stability of inequalities.

Optimization for Machine Learning: Frank-Wolfe Algorithm

Covers the Frank-Wolfe algorithm, a sparse and feasible optimization method with examples and convergence analysis.

Curves with Poritsky Property and Liouville Nets

Explores curves with Poritsky property, Birkhoff integrability, and Liouville nets in billiards.

Convex Functions

Covers the properties and operations of convex functions.

Optimal Transport: Rockafellar Theorem

Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.