L_p-mixed intersection bodies

In this paper the author first introduce a new concept of Lp-dual mixed volumes of star bodies which extends the classical dual mixed volumes. Moreover, we extend the notions of Lp- intersection body to Lp-mixed intersection body. Inequalities for Lp-dual mixed volumes of Lp-mixed intersection bodies are established and the results established here provide new estimates for these type of inequalities.     

The Positivity of Intersection Multiplicities and Symbolic Powers of Prime Ideals

Serre's nonnegativity conjecture for intersection multiplicities has recently been proven by O. Gabber. In this paper we investigate Serre's positivity conjecture using the methods which he developed. We show in particular that the positivity conjecture has implications for properties of symbolic powers of prime ideals in regular local rings.     

Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization

Disjunctive Programs can often be transcribed as reverse convex constrained problems with nondifferentiable constraints and unbounded feasible regions. We consider this general class of nonconvex programs, called Reverse Convex Programs (RCP), and show that under quite general conditions, the closure of the convex hull of the feasible region is polyhedral. This development is then pursued from a more constructive standpoint, in that, for certain special reverse convex sets, we specify a finite linear disjunction whose closed convex hull coincides with that of the special reverse convex set. When interpreted in the context of convexity/intersection cuts, this provides the capability of generating any (negative edge extension) facet cut. Although this characterization is more clarifying than computationally oriented, our development shows that if certain bounds are available, then convexity/intersection cuts can be strengthened relatively inexpensively.     

Mazur intersection property for Asplund spaces

The main result of the present note states that it is consistent with the ZFC axioms of set theory (relying on Martin's Maximum MM axiom), that every Asplund space of density character ω₁ has a renorming with the Mazur intersection property. Combined with the previous result of Jiménez and Moreno (based upon the work of Kunen under the continuum hypothesis) we obtain that the MIP renormability of Asplund spaces of density ω₁ is undecidable in ZFC.     

The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well.     

Intersections and polar functions of fractional brownian sheets

Let B^H={B^H（t）,t∈R^N＋}be a real-valued（N,d）fractional Brownian sheet with Hurst index H=（H1,…,HN）.The characteristics of the polar functions for B^H are discussed.The relationship between the class of continuous functions satisfying Lipschitz condition and the class of polar-functions of B^H is obtained.The Hausdorff dimension about the fixed points and the inequality about the Kolmogorov’s entropy index for B^H are presented.Furthermore,it is proved that any two independent fractional Brownian sheets are nonintersecting in some conditions.A problem proposed by LeGall about the existence of no-polar continuous functions satisfying the Holder condition is also solved.     

Degree distribution of a typical vertex in a general random intersection graph

For a general random intersection graph, we show an approximation of the vertex degree distribution by a Poisson mixture. Research supported by Lithuanian State Science and Studies Foundation Grant T-07149.     

On the Hardness of Computing Intersection,Union and Minkowski Sum of Polytopes

For polytopes P ₁,P ₂⊂ℝ ^d , we consider the intersection P ₁∩P ₂, the convex hull of the union CH(P ₁∪P ₂), and the Minkowski sum P ₁+P ₂. For the Minkowski sum, we prove that enumerating the facets of P ₁+P ₂ is NP-hard if P ₁ and P ₂ are specified by facets, or if P ₁ is specified by vertices and P ₂ is a polyhedral cone specified by facets. For the intersection, we prove that computing the facets or the vertices of the intersection of two polytopes is NP-hard if one of them is given by vertices and the other by facets. Also, computing the vertices of the intersection of two polytopes given by vertices is shown to be NP-hard. Analogous results for computing the convex hull of the union of two polytopes follow from polar duality. All of the hardness results are established by showing that the appropriate decision version, for each of these problems, is NP-complete.     

拓扑空间中的一个非空交定理及其应用

在FC-空间中证明了一新的非空交定理．作为应用，一不动点定理，一极大元定理，一重合点定理和一些极小极大不等式被证明．这些定理推广了近期文献中的结果．     

On the probability distribution of data at points in real complete intersection varieties

We show several estimates on the probability distribution of some data at points in real complete intersection varieties: norms of real affine solutions, condition number of real solution of real systems of multi-variate polynomial equations and convergence radius of Newton's operator for under-determined system of multi-variate polynomial equations.