Large bichromatic point sets admit empty monochromatic 4-gons

We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES(k) such that any set S of at least fES(k) points in general position in the plane has a subset of k points that are the vertices of a convex k-gon. In our setting the points of S are colored, and we say that a (not necessarily convex) spanned polygon is monochromatic if all its vertices have the same color. Moreover, a polygon is called empty if it does not contain any points of S in its interior. We show that any bichromatic set of n ≥ 5044 points in R2 in general position determines at least one empty, monochromatic quadrilateral (and thus linearly many).Postprint (published version

Dynamical Directions in Numeration

International audienceWe survey definitions and properties of numeration from a dynamical point of view. That is we focuse on numeration systems, their associated compactifications, and the dynamical systems that can be naturally defined on them. The exposition is unified by the notion of fibred numeration system. A lot of examples are discussed. Various numerations on natural, integral, real or complex numbers are presented with a special attention payed to beta-numeration and its generalisations, abstract numeration systems and shift radix systems. A section of applications ends the paper

High Resolution Maps of the Vasculature of An Entire Organ

The structure of vascular networks represents a great, unsolved problem in anatomy. Network geometry and topology differ dramatically from left to right and person to person as evidenced by the superficial venation of the hands and the vasculature of the retinae. Mathematically, we may state that there is no conserved topology in vascular networks. Efficiency demands that these networks be regular on a statistical level and perhaps optimal. We have taken the first steps towards elucidating the principles underlying vascular organization, creating the rst map of the hierarchical vasculature (above the capillaries) of an entire organ. Using serial blockface microscopy and fluorescence imaging, we are able to identify vasculature at 5 μm resolution. We have designed image analysis software to segment, align, and skeletonize the resulting data, yielding a map of the individual vessels. We transformed these data into a mathematical graph, allowing computationally efficient storage and the calculation of geometric and topological statistics for the network. Our data revealed a complexity of structure unexpected by theory. We observe loops at all scales that complicate the assignment of hierarchy within the network and the existence of set length scales, implying a distinctly non-fractal structure of components within