Convenient preparation of 5-ethynyl-octaethylporphyrin free base and zinc complex

A method leading to the preparation of the free base or zinc meso-ethynyl functionalized octaethylporphyrin has been developed, which will open the access to various meso-ethynyl metalloporphyrins.     

A new, fast and efficient synthesis of 3-aryl indenones: intramolecular cyclization of 1,3-diarylpropynones in superacids

1,3-Diarylpropynones were cleanly converted to the corresponding 3-arylindenones in various superacidic media. This new, simple, one-pot reaction proved to be efficient (yields up to 95%) and very fast (reaction time less than 30 min).     

Markovian Solutions of Inviscid Burgers Equation

For solutions of (inviscid, forceless, one dimensional) Burgers equation with random initial condition, it is heuristically shown that a stationary Feller–Markov property (with respect to the space variable) at some time is conserved at later times, and an evolution equation is derived for the infinitesimal generator. Previously known explicit solutions such as Frachebourg–Martin's (white noise initial velocity) and Carraro–Duchon's Lévy process intrinsic-statistical solutions (including Brownian initial velocity) are recovered as special cases.     

Conversations on mind, matter, and mathematics

Conclusion  The debate between Jean-Pierre Changeux and Alain Connes is one of the most, interesting to take place in recent years. It re-frames in a very up-to-date context a whole series of traditional and difficult questions from the standpoint of the knowledge and experience of two of the leading protagonists of contemporary science. To the choice presented by the neurobiologist between a Platonist ontology and a neurocognitive psychology of mathematical activity, the mathematician replies with a conception that is objective (neither ontological nor psychological) of the thoroughly consistent universe of mathematical idealities. It is indeed in this three-sided arena that the major difficulties play themselves out. One of the great virtues of the book is to cast a spotlight on this confrontation.     

On the global structure of crystalline surfaces

We bound the number of plane segments in a crystalline minimal surface S in terms of its Euler characteristic, the number of line segments in its boundary, and a factor determined by the Wulff shapeW of its surface energy function. A major technique in the proofs is to quantize the Gauss map ofS based on the Gauss map ofW. One thereby bounds the number of positive-curvature corners and the interior complexity ofS. The support of the National Science Foundation and the Air Force Office of Scientific Research and the hospitality of Stanford University, where this paper was extensively rewritten, are gratefully acknowledged.     

Inherited LU-factorizations of matrices

Various types of LU-factorizations for nonsingular matrices, where L is a lower triangular matrix and U is an upper triangular matrix, are defined and characterized. These types of LU-factorizations are extended to the general m × n case. The more general conditions are considered in the light of the structures of [C.R. Johnson, D.D. Olesky, P. Van den Driessche, Inherited matrix entries: LU factorizations, SIAM J. Matrix Anal. Appl. 10 (1989) 99-104]. Applications to graphs and adjacency matrices are investigated. Conditions for the product of a lower and an upper triangular matrix to be the zero matrix are also obtained.     

A diffusion approximation result for two parameter processes

Summary We consider a one-dimensional linear wave equation with a small mean zero dissipative field and with the boundary condition imposed by the so-called Goursat problem. In order to observe the effect of the randomness on the solution we perform a space-time rescaling and we rewrite the problem in a diffusion approximation form for two parameter processes. We prove that the solution converges in distribution toward the solution of a two-parameter stochastic differential equation which we identify. The diffusion approximation results for oneparameter processes are well known and well understood. In fact, the solution of the one-parameter analog of the problem we consider here is immediate. Unfortunately, the situation is much more complicated for two-parameter processes and we believe that our result is the first one of its kind.Partially supported by ONR N00014-91-J-1010     

A short proof for a generalization of Vizing's theorem

For a simple graph of maximum degree Δ, it is always possible to color the edges with Δ + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Δ colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these results to multigraphs. Instead of considering several color interchanges along alternating chains (Vizing, Gupta), using counting arguments (Ehrenfeucht, Faber, Kierstead), or improving nonvalid colorings with Fournier's Lemma, the method of proof consists of using one single easy transformation, called “sequential recoloring”, to augment a partial k-coloring of the edges.