Perfectly normal non-metrizable non-Archimedean spaces are generalized Souslin lines

In this paper we prove the equivalence between the existence of perfectly normal, non-metrizable, non-archimedean spaces and the existence of ``generalized Souslin lines", i.e., linearly ordered spaces in which every collection of disjoint open intervals is -discrete, but which do not have a -discrete dense set. The key ingredient is the observation that every first countable linearly ordered space has a dense non-archimedean subspace.

     

Multi-Faithful Spanning Trees of Infinite Graphs

For an end and a tree T of a graph G we denote respectively by m() and m _T () the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m _T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m _T () = f() for every end of G.     

A Point Balance Algorithm for the Spherical Code Problem

The Spherical Code (SC) problem has many important applications in such fields as physics, molecular biology, signal transmission, chemistry, engineering and mathematics. This paper presents a bilevel optimization formulation of the SC problem. Based on this formulation, the concept of balanced spherical code is introduced and a new approach, the Point Balance Algorithm (PBA), is presented to search for a 1-balanced spherical code. Since an optimal solution of the SC problem (an extremal spherical code) must be a 1-balanced spherical code, PBA can be applied easily to search for an extremal spherical code. In addition, given a certain criterion, PBA can generate efficiently an approximate optimal spherical code on a sphere in the n-dimensional space ⁿ. Some implementation issues of PBA are discussed and putative global optimal solutions of the Fekete problem in 3, 4 and 5-dimensional space are also reported. Finally, an open question about the geometry of Fekete points on the unit sphere in the 3-dimensional space is posed.     

Serre's generalization of Nagao's theorem: An elementary approach

Let be a smooth projective curve over a field . For each closed point of let be the coordinate ring of the affine curve obtained by removing from . Serre has proved that is isomorphic to the fundamental group, , of a graph of groups , where is a tree with at most one non-terminal vertex. Moreover the subgroups of attached to the terminal vertices of are in one-one correspondence with the elements of , the ideal class group of . This extends an earlier result of Nagao for the simplest case .

Serre's proof is based on applying the theory of groups acting on trees to the quotient graph , where is the associated Bruhat-Tits building. To determine he makes extensive use of the theory of vector bundles (of rank 2) over . In this paper we determine using a more elementary approach which involves substantially less algebraic geometry.

The subgroups attached to the edges of are determined (in part) by a set of positive integers , say. In this paper we prove that is bounded, even when Cl is infinite. This leads, for example, to new free product decomposition results for certain principal congruence subgroups of , involving unipotent and elementary matrices.

     

Nontrivial Phase Transition in a Continuum Mirror Model

We consider a Poisson point process on with intensity , and at each Poisson point we place a two sided mirror of random length and orientation. The length and orientation of a mirror is taken from a fixed distribution, and is independent of the lengths and orientations of the other mirrors. We ask if light shone from the origin will remain in a bounded region. We find that there exists a with 0 < < for which, if < , light leaving the origin in all but a countable number of directions will travel arbitrariliy far from the origin with positive probability. Also, if > , light from the origin will almost surely remain in a bounded region.     

A Homotopy 2-Groupoid of a Hausdorff Space

If X is a Hausdorff space we construct a 2-groupoid G ₂ X with the following properties. The underlying category of G ₂ X is the `path groupoid" of X whose objects are the points of X and whose morphisms are equivalence classes f, g of paths f, g in X under a relation of thin relative homotopy. The groupoid of 2-morphisms of G ₂ X is a quotient groupoid X / N X, where X is the groupoid whose objects are paths and whose morphisms are relative homotopy classes of homotopies between paths. N X is a normal subgroupoid of X determined by the thin relative homotopies. There is an isomorphism G ₂ X(f,f) ₂(X, f(0)) between the 2-endomorphism group of f and the second homotopy group of X based at the initial point of the path f. The 2-groupoids of function spaces yield a 2-groupoid enrichment of a (convenient) category of pointed spaces.We show how the 2-morphisms may be regarded as 2-tracks. We make precise how cubical diagrams inhabited by 2-tracks can be pasted.     

发展在XLPE电缆绝缘内外侧的电树枝

以XLPE高压电力电缆内外侧绝缘中的电树枝特性为研究对象，通过分析电树枝引发与生长的统计实验规律和采用扫描电子显微镜分析发现，由于不同结晶状态的影响，电缆绝缘内外侧的电树枝特性存在很大的差异.引发于绝缘内侧电树枝引发时间短、生长速度快、电树枝形状具有多样性；起始于绝缘外侧的电树枝不仅引发时间长、生长速度极慢，而且电树枝形状(结构)比较单一.并对这两个位置电树枝的引发和生长机理进行了探讨. 关键词： 电树枝 结晶状态 统计规律 内侧和外侧绝缘层     

The partial inverse minimum spanning tree problem when weight increase is forbidden

In a partial inverse optimization problem there is an underlying optimization problem with a partially given solution. The objective is to find a minimal perturbation of some of the problem’s parameter values, in such a way that the partial solution becomes a part of the optimal solution.     

Strong law of large numbers for Markov chains indexed by an infinite tree with uniformly bounded degree

In this paper,we study the strong law of large numbers and Shannon-McMillan (S-M) theorem for Markov chains indexed by an infinite tree with uniformly bounded degree.The results generalize the analogous results on a homogeneous tree.     

Scheduling Tasks on Unrelated Machines: Large Neighborhood Improvement Procedures

Two approximation algorithms are presented for minimizing the makespan of independant tasks assigned on unrelated machines. The first one is based upon a partial and heuristical exploration of a search tree, which is used not only to build a solution but also to improve it thanks to a post-optimization procedure. The second implements a new large neighborhood improvement procedure to an already existing algorithm. Computational experiments show that their efficiency is equivalent to the best local search heuristics.