Ordering induced by chemical, thermal and mechanical constraints at solid interfaces

We know that classical thermodynamics even out of equilibrium always leads to stable situation which means degradation and consequently d sorder. Many experimental evidences in different fields show that gradation and order (symmetry breaking) during time and space evolution may appear when maintaining the system far from equilibrium. Order through fluctuations, stochastic processes which occur around critical points and dissipative structures are the fundamental background of the Prigogine-Glansdorff and Nicolis theory. The thermodynamics of macroscopic fluctuations to stochastic approach as well as the kinetic deterministic laws allow a better understanding of the peculiar fascinating behavior of organized matter. The reason for the occurence of this situation is directly related to intrinsic non linearities of the different mechanisms responsible for the evolution of the system. Moreover, when dealing with interfaces separating two immiscible phases (liquid - gas, liquid -liquid, liquid - solid, solid - solid), the situation is rather more complicated. Indeed coupling terms playing the major role in the conditions of instability arise from the peculiar singular static and dynamic properties of the surface and of its vicinity. In other words, the non linearities are not only intrinsic to classical steps involving feedbacks, but they may be imbedded with the non-autonomous character of the surface properties. In order to illustrate our goal we discuss three examples of ordering in far from equilibrium conditions: i) formation of chemical structures during the oxidation of metals and alloys; ii) formation of mechanical structures during the oxidation of metals iii) formation of patterns at a solid-liquid moving interface due to supercooling condition in a melt of alloy. © 1984, Walter de Gruyter. All rights reserved.

Extended formulations, nonnegative factorizations, and randomized communication protocols

An extended formulation of a polyhedron P is a linear description of a polyhedron Q together with a linear map π such that π(Q)=P. These objects are of fundamental importance in polyhedral combinatorics and optimization theory, and the subject of a number of studies. Yannakakis’ factorization theorem (Yannakakis in J Comput Syst Sci 43(3):441–466, 1991) provides a surprising connection between extended formulations and communication complexity, showing that the smallest size of an extended formulation of $$P$$P equals the nonnegative rank of its slack matrix S. Moreover, Yannakakis also shows that the nonnegative rank of S is at most 2^c, where c is the complexity of any deterministic protocol computing S. In this paper, we show that the latter result can be strengthened when we allow protocols to be randomized. In particular, we prove that the base-2 logarithm of the nonnegative rank of any nonnegative matrix equals the minimum complexity of a randomized communication protocol computing the matrix in expectation. Using Yannakakis’ factorization theorem, this implies that the base-2 logarithm of the smallest size of an extended formulation of a polytope P equals the minimum complexity of a randomized communication protocol computing the slack matrix of P in expectation. We show that allowing randomization in the protocol can be crucial for obtaining small extended formulations. Specifically, we prove that for the spanning tree and perfect matching polytopes, small variance in the protocol forces large size in the extended formulation.