In this paper, we study flag structures of matroid base polytopes. We describe faces of
matroid base polytopes in terms of matroid data, and give conditions for hyperplane splits of …

This is a survey of combinatorial models for covering spaces of the complement of a
complexified hyperplane arrangement. We obtain a unified picture of the subject, and a …

… Even more, as Fj must check whether some line in the program is reachable for a given state,
this can make the computation of reachable sets using polyhedra or zonotopes very difficult…

This paper presents a description of solution approaches to the problem of output feedback
control under unknown but bounded disturbances with hard bounds on the controls and the …

In this paper, we define timed relational abstractions for verifying sampled data control
systems. Sampled data control systems consist of a plant, modeled as a hybrid system and a …

The Mathemagix project aims at the development of a ''computer analysis'' system, in which
numerical computations can be done in a mathematically sound manner. A major challenge …

The workshop Real Enumerative Questions in Complex and Tropical Geometry was devoted
to a wide discussion and exchange of ideas between the best experts representing various …

… We even know that it is hard to compute the volume of zonotopes [111] (Zonotopes are
centrally symmetric polytopes that arise as projections of cubes or, equivalently, as Minkowski …

In this paper, we use a simple discrete dynamical model to study integer partitions and their
lattice. The set of reachable configurations of the model, with the order induced by the …

This thesis examines the elegant theory of polar and Legendre duality, and its potential use
in convex geometry and geometric analysis. It derives a theorem of polar - Legendre duality …