We prove a compactness principle for the anisotropic formulation of the Plateau’s problem in codimension one, along the same lines of previous works of the authors [DGM14, DPDRG15]. In particular, we perform a new strategy for proving the rectifiability of the minimal set, avoiding the Preiss’ Rectifiability Theorem.

Information theory is gaining popularity as a tool to characterize performance of biological systems. However, information is commonly quantified without reference to whether or how a system could extract and use it; as a result, information-theoretic quantities are easily misinterpreted. Here we take the example of pattern-forming developmental systems which are commonly structured a cascades of sequential gene expression steps. Such a multi-tiered structure appears to constitute sub-optimal use of the positional information provided by the input morphogen because noise is added at each tier. However, the conventional theory fails to distinguish between the total information in a morphogen and information that can be usefully extracted and interpreted by downstream elements. We demonstrate that quantifying the information that is accessible to the system naturally explains the prevalence of multi-tiered network architectures as a consequence of the noise inherent to the control of gene expression. We support our argument with empirical observations from patterning along the major body axis of the fruit fly embryo. Our results exhibit the limitations of the standard information-theoretic characterization of biological signaling and illustrate how they can be resolved.

We continue our study of the chemical (graph) distance inside large critical percolation clusters in dimension two. We prove new estimates, which involve the three-arm probability, for the point-to-surface and point-to-point distances. We show that the point-to-point distance in Z 2 between two points in the same critical percolation cluster has infinite second moment. We also give quantitative versions of our previous results comparing the length of the shortest crossing to that of the lowest crossing of a box.

No abstract uploaded!

We propose a construction of K¨ahler and non-K¨ahler Calabi-Yau manifolds by branched double covers of twistor spaces. In this construction we use the twistor spaces of four-manifolds with self-dual conformal structures, with the examples of connected sum of n Ps. We also construct K3-fibered Calabi-Yau manifolds from the branched double covers of the blow-ups of the twistor spaces. These manifolds can be used in heterotic string compactifications to four dimensions. We also construct stable and polystable vector bundles. Some classes of these vector bundles can give rise to supersymmetric grand unified models with three generations of quarks and leptons in four dimensions.