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.

     

Perspectives on Advanced Mathematical Thinking

This article sets the stage for the following 3 articles. It opens with a brief history of attempts to characterize advanced mathematical thinking, beginning with the deliberations of the Advanced Mathematical Thinking Working Group of the International Group for the Psychology of Mathematics Education. It then locates the articles within 4 recurring themes: (a) the distinction between identifying kinds of thinking that might be regarded as advanced at any grade level, and taking as advanced any thinking about mathematical topics considered advanced; (b) the utility of characterizing such thinking for integrating the entire curriculum; (c) general tests, or criteria, for identifying advanced mathematical thinking; and (d) an emphasis on advancing mathematical practices. Finally, it points out some commonalities and differences among the 3 following articles.     

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.     

Large Scale Linear Programs and Heuristics for the Design of Survivable Telecommunication Networks

We consider the problem of providing a minimum cost multi-service network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hop-paths. We provide a large scale linear programming formulation and propose and test two effective heuristics.     

Rational approximation of vertical segments

In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.     

Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing

We define events so as to reduce the number of events and decision variables needed for modeling batch-scheduling problems such as described in [15]. We propose a new MILP formulation based on this concept, defining non-uniform time periods as needed and decision variables that are not time-indexed. It can handle complicated multi-product/multi-stage machine processes, with production lines merging and diverging, and with minimum and maximum batch sizes. We compare it with earlier models and show that it can solve problems with small to medium demands relative to batch sizes in reasonable computer times.     

Connections between semidefinite relaxations of the max-cut and stable set problems

We describe links between a recently introduced semidefinite relaxation for the max-cut problem and the well known semidefinite relaxation for the stable set problem underlying the Lovász’s theta function. It turns out that the connection between the convex bodies defining the semidefinite relaxations mimics the connection existing between the corresponding polyhedra. We also show how the semidefinite relaxations can be combined with the classical linear relaxations in order to obtain tighter relaxations. This work was done while the author visited CWI, Amsterdam, The Netherlands. Svata Poljak untimely deceased in April 1995. We shall both miss Svata very much. Svata was an excellent colleague, from whom we learned a lot of mathematics and with whom working was always a very enjoyable experience; above all, Svata was a very nice person and a close friend of us. The research was partly done while the author visited CWI, Amsterdam, in October 1994 with a grant fom the Stieltjes Institute, whose support is gratefully acknowledged. Partially supported also by GACR 0519. Research support by Christian Doppler Laboratorium für Diskrete Optimierung.