The Work of Eugène Freyssinet: The Most Significant Bridges of his Career

From 1904, when his career began, until 1962, when he died, Eugène Freyssinet did not stop building or advising on all aspects related with his work. To give an idea of his interest in the field of bridges, we selected the following: the Veurdre and Plougastel bridges as reinforced concrete examples and the Luzancy, the Marne and the Caracas La Guaira highway bridges as prestressed concrete works. In these brief descriptions, rather than the technical nature of the design, we have focused on intuition and innovation which made these works models and which inspired many engineers to continue working respecting quality

Optimality of Geometric Local Search

International audienceUp until a decade ago, the algorithmic status of several basic NP-complete problems in geometric combinatorial optimisation was unresolved. This included the existence of polynomial-time approximation schemes (PTASs) for hitting set, set cover, dominating set, independent set, and other problems for some basic geometric objects. These past nine years have seen the resolution of all these problems—interestingly, with the same algorithm: local search. In fact, it was shown that for many of these problems, local search with radius λ gives a (1 + O(λ − 1 2))-approximation with running time n O(λ). Setting λ = Θ(epsilon^{−2}) yields a PTAS with a running time of n^O(epsilon^{−2}). On the other hand, hardness results suggest that there do not exist PTASs for these problems with running time poly(n)·f () for any arbitrary f. Thus the main question left open in previous work is in improving the exponent of n to o(epsilon^{−2}). We show that in fact the approximation guarantee of local search cannot be improved for any of these problems. The key ingredient, of independent interest, is a new lower bound on locally expanding planar graphs, which is then used to show the impossibility results. Our construction extends to other graph families with small separators. Acknowledgements We thank the referees for several helpful comments

The ?-t-Net Problem

We study a natural generalization of the classical ?-net problem (Haussler - Welzl 1987), which we call the ?-t-net problem: Given a hypergraph on n vertices and parameters t and ? ? t/n, find a minimum-sized family S of t-element subsets of vertices such that each hyperedge of size at least ? n contains a set in S. When t=1, this corresponds to the ?-net problem. We prove that any sufficiently large hypergraph with VC-dimension d admits an ?-t-net of size O((1+log t)d/? log 1/?). For some families of geometrically-defined hypergraphs (such as the dual hypergraph of regions with linear union complexity), we prove the existence of O(1/?)-sized ?-t-nets. We also present an explicit construction of ?-t-nets (including ?-nets) for hypergraphs with bounded VC-dimension. In comparison to previous constructions for the special case of ?-nets (i.e., for t=1), it does not rely on advanced derandomization techniques. To this end we introduce a variant of the notion of VC-dimension which is of independent interest

Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning

The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if every pair of sets in R have large symmetric difference, then R cannot contain too many sets. Recently it was generalized to the shallow packing lemma, applying to set systems as a function of their shallow-cell complexity. In this paper we present several new results and applications related to packings: * an optimal lower bound for shallow packings, * improved bounds on Mnets, providing a combinatorial analogue to Macbeath regions in convex geometry, * we observe that Mnets provide a general, more powerful framework from which the state-of-the-art unweighted epsilon-net results follow immediately, and * simplifying and generalizing one of the main technical tools in [Fox et al.J. of the EMS, to appear]

Gin-seng

Conservato con Copia del consulto di Leal Leali ... e altri manoscritti e opere a stampa. Legatura in cartone con titolo manoscritto sul piatto anteriore. Alcune note e segni nel testo manoscritti a matita e altra in matita blu sul piatto anteriore: 10. L'autore si ricava da un altro titolo a carta 2r. Dono di G. Dian all’Orto botanico (1905), proveniente dal patrimonio della farmacia Zannichelli a Venezia. Databile tra 1711, data della lettera riportata, e 1729, morte di G. G. Zannichelli a cui il manoscritto è appartenuto

Gin-seng

Conservato con Copia del consulto di Leal Leali ... e altri manoscritti e opere a stampa. Legatura in cartone con titolo manoscritto sul piatto anteriore. Alcune note e segni nel testo manoscritti a matita e altra in matita blu sul piatto anteriore: 10. L'autore si ricava da un altro titolo a carta 2r. Dono di G. Dian all’Orto botanico (1905), proveniente dal patrimonio della farmacia Zannichelli a Venezia. Databile tra 1711, data della lettera riportata, e 1729, morte di G. G. Zannichelli a cui il manoscritto è appartenuto

Gin-seng

Conservato con Copia del consulto di Leal Leali ... e altri manoscritti e opere a stampa. Legatura in cartone con titolo manoscritto sul piatto anteriore. Alcune note e segni nel testo manoscritti a matita e altra in matita blu sul piatto anteriore: 10. L'autore si ricava da un altro titolo a carta 2r. Dono di G. Dian all’Orto botanico (1905), proveniente dal patrimonio della farmacia Zannichelli a Venezia. Databile tra 1711, data della lettera riportata, e 1729, morte di G. G. Zannichelli a cui il manoscritto è appartenuto

Gin-seng

Conservato con Copia del consulto di Leal Leali ... e altri manoscritti e opere a stampa. Legatura in cartone con titolo manoscritto sul piatto anteriore. Alcune note e segni nel testo manoscritti a matita e altra in matita blu sul piatto anteriore: 10. L'autore si ricava da un altro titolo a carta 2r. Dono di G. Dian all’Orto botanico (1905), proveniente dal patrimonio della farmacia Zannichelli a Venezia. Databile tra 1711, data della lettera riportata, e 1729, morte di G. G. Zannichelli a cui il manoscritto è appartenuto

Sur les algorithmes d'approximation combinatoires en géométrie

The analysis of approximation techniques is a key topic in computational geometry, both for practical and theoretical reasons. In this thesis we discuss sampling tools for geometric structures and geometric approximation algorithms in combinatorial optimization. Part I focuses on the combinatorics of geometric set systems. We start by discussing packing problems in set systems, including extensions of a lemma of Haussler, mainly the so-called shallow packing lemma. For said lemma we also give an optimal lower bound that had been conjectured but not established in previous work on the topic. Then we use this lemma, together with the recently introduced polynomial partitioning technique, to study a combinatorial analogue of the Macbeath regions from convex geometry: Mnets, for which we unify previous existence results and upper bounds, and also give some lower bounds. We highlight their connection with epsilon-nets, staples of computational and combinatorial geometry, for example by observing that the unweighted epsilon-net bound of Chan et al. (SODA 2012) or Varadarajan (STOC 2010) follows directly from our results on Mnets. Part II deals with local-search techniques applied to geometric restrictions of classical combinatorial optimization problems. Over the last ten years such techniques have produced the first polynomial-time approximation schemes for various problems, such as that of computing a minimum-sized hitting set for a collection of input disks from a set of input points. In fact, it was shown that for many of these problems, local search with radius Θ(1/epsilon²) gives a (1 + epsilon)-approximation with running time n^{O(1/epsilon²)}. However the question of whether the exponent of n could be decreased to o(1/epsilon²) was left open. We answer it in the negative: the approximation guarantee of local search cannot be improved for any of these problems. The key ingredient is a new lower bound on locally expanding planar graphs, which is then used to show the impossibility resultsL'analyse des techniques d'approximation est centrale en géométrie algorithmique, pour des raisons pratiques comme théoriques. Dans cette thèse nous traitons de l'échantillonnage des structures géométriques et des algorithmes d'approximation géométriques en optimisation combinatoire. La première partie est consacrée à la combinatoire des hypergraphes. Nous débutons par les problèmes de packing, dont des extensions d'un lemme de Haussler, particulièrement le lemme dit de Shallow packing, pour lequel nous donnons aussi un minorant optimal, conjecturé mais pas établi dans les travaux antérieurs. Puis nous appliquons ledit lemme, avec la méthode de partition polynomiale récemment introduite, à l'étude d'un analogue combinatoire des régions de Macbeath de la géométrie convexe : les M-réseaux, pour lesquels nous unifions les résultats d'existence et majorations existants, et donnons aussi quelques minorants. Nous illustrons leur relation aux epsilon-réseaux, structures incontournables en géométrie combinatoire et algorithmique, notamment en observant que les majorants de Chan et al. (SODA 2012) ou Varadarajan (STOC 2010) pour les epsilon-réseaux (uniformes) découlent directement de nos résultats sur les M-réseaux. La deuxième partie traite des techniques de recherche locale appliquées aux restrictions géométriques de problèmes classiques d'optimisation combinatoire. En dix ans, ces techniques ont produit les premiers schémas d'approximation en temps polynomial pour divers problèmes tels que celui de calculer un plus petit ensemble intersectant pour un ensemble de disques donnés en entrée parmi un ensemble de points donnés en entrée. En fait, il a été montré que pour de nombreux tels problèmes, la recherche locale de rayon Θ (1/epsilon²) donne une (1 + epsilon)-approximation en temps n^{O(1/epsilon²)}. Savoir si l'exposant de n pouvait être ramené à o (1/epsilon²) demeurait une question ouverte. Nous répondons par la négative : la garantie d'approximation de la recherche locale n'est améliorable pour aucun desdits problème

Le panneau de vitrail du Fils prodigue chassé d'une auberge de Bais (Ille-et-Vilaine) copié d'une gravure néerlandaise d'après Martin de Vos. Une nouvelle approche des rapports entre gravure et vitrail

The golden age of stained glass in Brittany is generally fixed between 1620 and 1650. This period can correspond with the blooming of the engraving's school of Anvers which has been radiant on many countries, as far as Asia or South America. The impact of the netherlandish artistic expansion in Brittany has over all been considered about Low Brittany during the 15th and 16th centuries. But the High Brittany's important economic and commercial development as far back at the end of the 16th century explains then its regular relations with Low Countries and the likely importation of netherlandish engravings in the region and on the territory of Ille-et-Vilaine. This supposition is confirmed by the great similitude that exists between a stained glass window of Bais (Ille-et-Vilaine) dated from 1632, and two points depicting an épisode of the Prodigal Son's Parable after a Martin de Vos's drawing. That asks so once more the question of the utilization of prints as models by the artists in stained glass, and of the relations between engraving and stained glass.L'âge d'or du vitrail en Bretagne est généralement défini entre 1520 et 1560. Cette période peut correspondre à l'essor de l'école de gravure anversoise qui a rayonné sur de nombreux pays, jusqu'en Asie ou en Amérique du Sud. L'impact de l'expression artistique néerlandaise en Bretagne a surtout été considérée en Basse-Bretagne, aux XVe et XVIe siècles. Mais l'important développement économique et commercial de la Haute-Bretagne dès la fin du XVIe siècle explique alors ses rapports réguliers avec les Pays-Bas, et l'importation probable de gravures néerlandaises en Haute-Bretagne et sur le territoire de l'Ille-et-Vllaine. La grande similitude existant entre un panneau du vitrail de Bais (Ille-et-Vilaine) daté de 1632, et deux estampes représentant un épisode de la Parabole du Fils Prodigue, d'après un dessin de Martin de Vos, confirme cette hypothèse. Le problème de l'utilisation de gravures comme modèles par les peintres-verriers, et des rapports entre gravure et vitrail est ainsi posé de nouveau.Jartoux Céline. Le panneau de vitrail du Fils prodigue chassé d'une auberge de Bais (Ille-et-Vilaine) copié d'une gravure néerlandaise d'après Martin de Vos. Une nouvelle approche des rapports entre gravure et vitrail. In: Annales de Bretagne et des pays de l'Ouest. Tome 107, numéro 1, 2000. pp. 41-50