Les compagnies aériennes, leurs menus et les religions qu'elles y reconnaissent

Partant de l’idée bien établie que la religion exerce une influence profonde sur les modes d’alimentation, trois chercheurs en théologie, en géographie et en sciences politiques ont unis leurs connaissances pour débusquer cette influence là où on ne l’attend pas, dans les menus proposés par les compagnies aériennes. Pour ce faire, ils ont identifié les menus religieux reconnus par l’IATA (hindou, halal, cacher et jaïn) ; visité les sites Internet de 34 compagnies aériennes pour savoir quelles compagnies proposent quels menus religieux ; identifié comment ces compagnies prétendent répondre aux prescriptions des différentes religions ; cherché à comprendre les logiques théologiques, géographiques et/ou politiques derrière les choix des compagnies aériennes ; évalué l’impact que les menus religieux proposés par les compagnies aériennes exercent sur la relation entre religion et alimentation

Regularization independent of the noise level: an analysis of quasi-optimality

The quasi-optimality criterion chooses the regularization parameter in inverse problems without taking into account the noise level. This rule works remarkably well in practice, although Bakushinskii has shown that there are always counterexamples with very poor performance. We propose an average case analysis of quasi-optimality for spectral cut-off estimators and we prove that the quasi-optimality criterion determines estimators which are rate-optimal {\em on average}. Its practical performance is illustrated with a calibration problem from mathematical finance.Comment: 18 pages, 3 figure

Degree Sequences and the Existence of kk-Factors

We consider sufficient conditions for a degree sequence $\pi$ to be forcibly $k$-factor graphical. We note that previous work on degrees and factors has focused primarily on finding conditions for a degree sequence to be potentially $k$-factor graphical. We first give a theorem for $\pi$ to be forcibly 1-factor graphical and, more generally, forcibly graphical with deficiency at most $\beta\ge0$. These theorems are equal in strength to Chv\'atal's well-known hamiltonian theorem, i.e., the best monotone degree condition for hamiltonicity. We then give an equally strong theorem for $\pi$ to be forcibly 2-factor graphical. Unfortunately, the number of nonredundant conditions that must be checked increases significantly in moving from $k=1$ to $k=2$, and we conjecture that the number of nonredundant conditions in a best monotone theorem for a $k$-factor will increase superpolynomially in $k$. This suggests the desirability of finding a theorem for $\pi$ to be forcibly $k$-factor graphical whose algorithmic complexity grows more slowly. In the final section, we present such a theorem for any $k\ge2$, based on Tutte's well-known factor theorem. While this theorem is not best monotone, we show that it is nevertheless tight in a precise way, and give examples illustrating this tightness.Comment: 19 page