Topological order complexes and resolutions of discriminant sets.
Cet article étudie, sur l’ensemble des points extrémaux d’un convexe compact , des topologies faciales dont les fermés sont les traces de faces “parallélisables” (il existe une plus grande face disjointe de , et tout de s’écrit , avec unique). Les topologies faciales uniformisables sont en bijection avec les sous-espaces réticulés fermés et contenant 1 de l’espace des fonctions affines continues sur . Ceci redonne des résultats classiques sur les simplexes, et permet une étude...
Continuing earlier work by Székelyhidi, we describe the topological and geometric structure of so-called T4-configurations which are the most prominent examples of nontrivial rank-one convex hulls. It turns out that the structure of T4-configurations in is very rich; in particular, their collection is open as a subset of . Moreover a previously purely algebraic criterion is given a geometric interpretation. As a consequence, we sketch an improved algorithm to detect T4-configurations. ...
This work contains an extended version of a course given in Arrangements in Pyrénées. School on hyperplane arrangements and related topics held at Pau (France) in June 2012. In the first part, we recall the computation of the fundamental group of the complement of a line arrangement. In the second part, we deal with characteristic varieties of line arrangements focusing on two aspects: the relationship with the position of the singular points (relative to projective curves of some prescribed degrees)...
In this article a novel model framework to simulate cells and their internal structure is described. The model is agent-based and suitable to simulate single cells with a detailed internal structure as well as multi-cellular compounds. Cells are simulated as a set of many interacting particles, with neighborhood relations defined via a Delaunay triangulation. The interacting sub-particles of a cell can assume specific roles – i.e., membrane sub-particle, internal sub-particle, organelles, etc –,...
Every sequence of positive or negative homothetic copies of a planar convex body whose total area does not exceed times the area of can be translatively packed in .
Let S be a square and let S' be a square of unit area with a diagonal parallel to a side of S. Any (finite or infinite) sequence of homothetic copies of S whose total area does not exceed 4/9 can be packed translatively into S'.