Choiceless polynomial time

Turing machines define polynomial time (PTime) on strings but cannot deal with structures like graphs directly, and there is no known, easily computable string encoding of isomorphism classes of structures. Is there a computation model whose machines do not distinguish between isomorphic structures and compute exactly PTime properties? This question can be recast as follows: Does there exist a logic that captures polynomial time (without presuming the presence of a linear order)? Earlier, one of us conjectured a negative answer. The problem motivated a quest for stronger and stronger PTime logics. All these logics avoid arbitrary choice. Here we attempt to capture the choiceless fragment of PTime. Our computation model is a version of abstract state machines (formerly called evolving algebras). The idea is to replace arbitrary choice with parallel execution. The resulting logic expresses all properties expressible in any other PTime logic in the literature. A more difficult theorem shows that the logic does not capture all of PTime.     

Polyhedral approximation and practical convex hull algorithm for certain classes of voxel sets

In this paper we introduce an algorithm for the creation of polyhedral approximations for certain kinds of digital objects in a three-dimensional space. The objects are sets of voxels represented as strongly connected subsets of an abstract cell complex. The proposed algorithm generates the convex hull of a given object and modifies the hull afterwards by recursive repetitions of generating convex hulls of subsets of the given voxel set or subsets of the background voxels. The result of this method is a polyhedron which separates object voxels from background voxels. The objects processed by this algorithm and also the background voxel components inside the convex hull of the objects are restricted to have genus 0. The second aim of this paper is to present some practical improvements to the discussed convex hull algorithm to reduce computation time.     

Enumeration in Convex Geometries and Associated Polytopal Subdivisions of Spheres

We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The complete information on the numbers of faces and chains of faces in these spheres can be obtained from the defining lattices in a manner analogous to the relation between arrangements of hyperplanes and their underlying geometric intersection lattices.     

Commensurability classification of a family of right-angled Coxeter groups

We classify the members of an infinite family of right-angled Coxeter groups up to abstract commensurability.

     

Quasi-sure Flows Associated with Vector Fields of Low Regularity

The authors construct a solution Ut（x） associated with a vector field on the Wiener space for all initial values except in a 1-slim set and obtain the 1-quasi-sure flow property where the vector field is a sum of a skew-adjoint operator not necessarily bounded and a nonlinear part with low regularity, namely one-fold differentiability. Besides, the equivalence of capacities under the transformations of the Wiener space induced by the solutions is obtained.     

Closed subgroups as Ditkin sets

We prove that every closed subgroup of a locally compact group is locally p  -Ditkin for 1<p<∞$1<p<\infty$.     

Peano type theorem for abstract parabolic equations

We consider parabolic problems with non-Lipschitz nonlinearity in the different scales of Banach spaces and prove local-in-time existence theorem.     

Root filtration spaces from Lie algebras and abstract root groups

Both Timmesfeld's abstract root subgroups and simple Lie algebras generated by extremal elements lead to root filtration spaces: synthetically defined geometries on points and lines which can be characterized as root shadow spaces of buildings. Here we show how to obtain the root filtration space axioms from root subgroups and classical Lie algebras.     

非晶态金属Al中微团簇多面体结构及其演变规律的模拟研究

对50 000个金属Al原子从液态急冷形成非晶态结构的过程进行了分子动力学模拟研究.采用原子键型和原子团簇类型指数法,发现在其微观结构的转变过程中,与不断增加的1551键型密切相关的二十面体及其缺陷结构的形成起了非常突出的作用.通过各种键型原子团簇的计算,获得团簇多面体结构的分布数据.在可视化的显示下,得到一幅十分清晰的关于团簇多面体结构的特征及其演变的图景.建立了一种简单而有效的团簇多面体结构研究方法.同时也对模拟计算结果的微观机理给出了相应的讨论,这对于深入理解非晶态结构的形成机制及其微观过程,将有重