A counter-example to the characterization of the discontinuous value function of control problems with reflectionUn contre-exemple à la caractérisation de la fonction-valeur discontinue d'un problème de contrôle réfléchi

We consider a finite horizon deterministic optimal control problem with reflection. The final cost is assumed to be merely a locally bounded function which leads to a discontinuous value function. We address the question of the characterization of the value function as the unique solution of an Hamilton–Jacobi equation with Neumann boundary conditions. We follow the discontinuous approach developed by Barles and Perthame for problems set in the whole space. We prove that the minimal and maximal discontinuous viscosity solutions of the associated Hamilton–Jacobi can be written in terms of value functions of control problems with reflection. Nethertheless, we construct a counter-example showing that the value function is not the unique solution of the equation. To cite this article: O. Ley, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 469–473.     

Structures de Hodge mixtes et faisceaux réflexifs semistablesMixed Hodge structures and semistable reflexive sheaves

Let X be a smooth projective variety over an algebraically closed field of characteristic 0. We prove that the category of μ-semistable reflexive sheaves of slope μ equivariant for the action of some group on X is Abelian. The same claim for $\text{X=}\text{P}{}^2{}_{\mathrm{<mtext>C</mtext>}}$ and a stronger semistability condition gives us a geometric proof of the fact that the category of mixed Hodge structures is Abelian. To cite this article: O. Penacchio, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 475–480.     

Degenerate nonlinear hyperbolic conservation laws: Non classical geometrical theory

Kinetic selection principles have been shown to be useful and physically reasonable in nonlinear hyperbolic problems with large amplitude phase transitions. We refer to Abeyaratne and Knowles, [A-K], for discussion on the subject. They also have been used for degenerate nonlinear problems, where the genuine nonlinearity property of Lax is violated. This is the framework of Liu, [Li], in the kinetic situation of Hayes and Le Floch, [H-L], where their so-called non classical shocks may be seen as small amplitude phase transitions. Here, we describe the local geometry generated by the generic non genuinely nonlinear assumption. A geometric kinetic criterion can be used to select indeterminate simple waves and obtain the well-posedness of the local Riemann problem. A particular case is the entropic kinetic criterion of Hayes and Le Floch.

---

Sunto Principi di selezione cinetica sono stati mostrati utili e fisicamente ragionevoli in problemi iperbolici con transizioni di fase di grande ampiezza. Ci riferiamo ad Abeyaratne e Knowles, [A-K], per discussioni sull'argomento. Detti principi sono stati usati per problemi nonlineari degeneri, dove la proprietà di genuina nonlinearità di Lax è violata. Questo è la prospettiva di Liu, [Li], nella situazione cinetica di Hayes e Le Floch, [H-L], dove i loro così detti urti non classici possono essere considerati come transizioni di fase di piccola ampiezza. Qui, descriviamo la geometria locale generata dall'ipotesi generica genuinamente nonlineare. Un criterio di geometria cinetica può essere usato per selezionare onde semplici indeterminate ed ottenere la buona posizione per il problema locale di Riemann. Un caso particolare è il criterio di entropia cinetico di Hayes e Le Floc.

     

Strengthened semidefinite programming bounds for codes

We give a hierarchy of semidefinite upper bounds for the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. At any fixed stage in the hierarchy, the bound can be computed (to an arbitrary precision) in time polynomial in n; this is based on a result of de Klerk et al. (Math Program, 2006) about the regular ∗-representation for matrix ∗-algebras. The Delsarte bound for A(n,d) is the first bound in the hierarchy, and the new bound of Schrijver (IEEE Trans. Inform. Theory 51:2859–2866, 2005) is located between the first and second bounds in the hierarchy. While computing the second bound involves a semidefinite program with O(n ⁷) variables and thus seems out of reach for interesting values of n, Schrijver’s bound can be computed via a semidefinite program of size O(n ³), a result which uses the explicit block-diagonalization of the Terwilliger algebra. We propose two strengthenings of Schrijver’s bound with the same computational complexity. Supported by the Netherlands Organisation for Scientific Research grant NWO 639.032.203.     

Expedient synthesis of villosin and its isomer (E)-labda-8(17),12,14-trien-15(16)-olide

The synthesis of the title compounds has been achieved in concise, highly regiocontrolled fashion from commercially available (+)-sclareolide. In addition, we offer evidence that the structure of a newly reported natural product from Zingiber ottensii is incorrect.     

Total synthesis of malayamycin A and analogues

The total synthesis of the bicyclic C-nucleoside malayamycin A is described starting with d-ribonolactone. A new method was developed to obtain preparatively important quantities of β-pseudouridine, which was used as an intermediate. The synthesis of a carba N-nucleoside analogue of malayamycin A is also described.