Mean convex hulls and least area disks spanning extreme curves

We show that for any extreme curve in a 3-manifold M, there exist a canonical mean convex hull containing all least area disks spanning the curve. Similar result is true for asymptotic case in such that for any asymptotic curve , there is a canonical mean convex hull containing all minimal planes spanning Γ. Applying this to quasi-Fuchsian manifolds, we show that for any quasi-Fuchsian manifold, there exist a canonical mean convex core capturing all essential minimal surfaces. On the other hand, we also show that for a generic C³-smooth curve in the boundary of C³-smooth mean convex domain in ℝ³, there exist a unique least area disk spanning the curve.     

Effect of sintering temperature on mechanical behaviour and bioactivity of sol-gel synthesized bioglass-ceramics using rice husk ash as a silica source

Bioglass-ceramics with SiO₂-Na₂O-CaO composition was prepared by sol-gel method using rice husk ash as a silica source. Material was sintered at different temperatures ranging from 900 to 1050 °C for 2 h. Phase-formation behaviour, densification characteristics, and mechanical strength of glass-ceramics were investigated. The material sintered at 1000 °C showed a good mechanical strength. Mechanical properties were correlated with microstructural features. Both in vitro bioactivity and biodegradability of sintered material were investigated by incubating in simulated body fluid and Tris buffer solution, respectively. Scanning electron microscopy, energy dispersive spectroscopy and X-ray diffraction were used to investigate the surface deposition during body fluid incubation. Both bioactivity and degradability decreased with increase in sintering temperature.     

最小最大二点集覆盖问题分析及改进算法设计

本文考虑二中心问题的扩展问题-最小最大二点集覆盖问题。给定两个平面点集P₁和P₂,分别包含m和n个点,求两个圆分别覆盖P₁和P₂,并且要求两圆半径与两圆圆心距三者中的最大值最小。本文主要贡献在于分析半径变化过程中两个点集中心包之间最近距离的变化关系,其中中心包是点集所具有的一个特殊几何结构,所得到的结果改进了Huang等人之前给出的结果,并且通过该结果设计相应算法,所得到的算法复杂性是目前最好的。     

Some remarks on the geodetic number of a graph

A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimum cardinality of a geodetic set of G.We prove that it is NP-complete to decide for a given chordal or chordal bipartite graph G and a given integer k whether G has a geodetic set of cardinality at most k. Furthermore, we prove an upper bound on the geodetic number of graphs without short cycles and study the geodetic number of cographs, split graphs, and unit interval graphs.     

Representation of Bounded Convex Sets By Rational Convex Hull Of Its Gamma-Extreme Points

H. Minkowski proved C= convext C whenever C is a compact convex subset of a finite-dimensional linear space. If C is bounded but not closed, this representation does not hold anymore. In this case, we introduce the set of so-called γ-extreme points extγC of C and show C = convext γ C = raco extγ C, where raco M denotes the rational convex hull of M.     

Kostant's convexity theorem and the compact classical groups

The relationship between the classical Schur-Horn's theorem on the diagonal elements of a Hermitian matrix with prescribed eigenvalues and Kostant's convexity theorem in the context of Lie groups. By using Kostant's convexity theorem, we work out the statements on the special orthogonal group and the symplectic group explicitly. Schur-Horn's result can be stated in terms of a set of inequalities. The counterpart in the Lie-theoretic context is related to a partial ordering, introduced by Atiyah and Bott, defined on the closed fundamental Weyl chamber. Some results of Thompson on the diagonal elements of a matrix with prescribed singular values are recovered. Thompson-Poon's theorem on the convex hull of Hermitian matrices with prescribed eigenvalues is also generalized. Then a result of Atiyah-Bott is recovered.     

Real Zeros of Algebraic Polynomials with Dependent Random Coefficients

The expected number of real zeros of polynomials a ₀ + a ₁ x + a ₂ x ² +…+a _n?1 x ^n?1 with random coefficients is well studied. For n large and for the normal zero mean independent coefficients, irrespective of the distribution of coefficients, this expected number is known to be asymptotic to (2/π)log n. For the dependent cases studied so far it is shown that this asymptotic value remains O(log n). In this article, we show that when cov(a _i , a _j ) = 1 ? |i ? j|/n, for i = 0,…, n ? 1 and j = 0,…, n ? 1, the above expected number of real zeros reduces significantly to O(log n)^1/2.