Fundamental group is one of the most important topological invariants for general manifolds, which can be directly used as manifolds classification. In this work, we provide a series of practical and efficient algorithms to compute fundamental groups for general 3-manifolds based on CW cell decomposition. The input is a tetrahedral mesh, while the output is symbolic representation of its first fundamental group. We further simplify the fundamental group representation using computational algebraic method. We present the theoretical arguments of our algorithms, elaborate the algorithms with a number of examples, and give the analysis of their computational complexity.

Gene expression data from microarrays are being applied to predict preclinical and clinical endpoints, but the reliability of these predictions has not been established. In the MAQC-II project, 36 independent teams analyzed six microarray data sets to generate predictive models for classifying a sample with respect to one of 13 endpoints indicative of lung or liver toxicity in rodents, or of breast cancer, multiple myeloma or neuroblastoma in humans. In total,> 30,000 models were built using many combinations of analytical methods. The teams generated predictive models without knowing the biological meaning of some of the endpoints and, to mimic clinical reality, tested the models on data that had not been used for training. We found that model performance depended largely on the endpoint and team proficiency and that different approaches generated models of similar performance. The conclusions and

The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the continuum hypothesis. This answers a longstanding problem of Shelah.

We study the wave propagation speed problem on metric measure spaces, emphasizing on self-similar sets that are not postcritically finite. We prove that a sub-Gaussian lower heat kernel estimate leads to infinite propagation speed, extending a result of Y.-T. Lee to include bounded and unbounded generalized Sierpi\'nski carpets as well as some fractal blowups. We also formulate conditions under which a Gaussian upper heat kernel estimate leads to finite propagation speed, and apply this result to two classes of iterated function systems with overlaps, including those defining the classical infinite Bernoulli convolutions.

In 1999, Dar conjectured if there is a stronger version of the celebrated Brunn-Minkowski inequality. However, as pointed out by Campi, Gardner, and Gronchi in 2011, this problem seems to be open even for planar o-symmetric convex bodies. In this paper, we give a positive answer to Dar’s conjecture for all planar convex bodies. We also give the equality condition of this stronger inequality. For planar o-symmetric convex bodies, the log-Brunn-Minkowski inequality was established by B¨or¨oczky, Lutwak, Yang, and Zhang in 2012. It is stronger than the classical Brunn-Minkowski inequality, for planar o-symmetric convex bodies. Gaoyong Zhang asked if there is a general version of this inequality. Fortunately, the solution of Dar’s conjecture, especially, the definition of “dilation position”, inspires us to obtain a general version of the log-Brunn-Minkowski inequality. As expected, this inequality implies the classical Brunn-Minkowski inequality for all planar convex bodies.