This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete concave functions, Bandelt-Dress’ split decomposition can be derived as a special case of more general decomposition of polyhedral/discrete concave functions introduced in this paper. It is shown that the combinatorics...

This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete concave function, Bandelt-Dress’ split decomposition can be derived as a special case of more general decomposition of polyhedral/discrete concave functions introduced in this paper. It is shown that the combinatorics ...

Abstract In order to improve the accuracy of calculation method bearing capacity prefabricated pier connected by grouting bellows, formula ultimate assembled bridge piers with corrugated pipe connection under action bi-directional compression and bending is deduced. Firstly, quasi-static testing cast-in-place unidirectional loading are introduced, capacities compared. Secondly, according arrang...

The paper deals with the issue of capacity railway infrastructure in connection operation freight trains a length up to 740 m. First, facts field arrangement elements that may have potential impact on will be listed. Subsequently, there proposed indicators can used for detection possible changes capacity, due In last phase, several simulation scenarios realized OpenTrack program. these m long d...

Let A be a hyperplane arrangement, and k a field of arbitrary characteristic. We show that the projective degree-one resonance variety R(A, k) of A over k is ruled by lines, and identify the underlying algebraic line complex L(A, k) in the Grassmannian G(2, kn), n = |A|. L(A, k) is a union of linear line complexes corresponding to the neighborly partitions of subarrangements of A. Each linear l...

We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips. In particular, we provide an enumeration algorithm for arrangements with a given support, based on the properties of certain greedy pseudoline arrangements and on their connection with sorting networks....