Differences of Convex Compact Sets in the Space of Directed Sets. Part I: The Space of Directed Sets

A normed and partially ordered vector space of so-called directed sets is constructed, in which the convex cone of all nonempty convex compact sets in R ⁿ is embedded by a positively linear, order preserving and isometric embedding (with respect to a new metric stronger than the Hausdorff metric and equivalent to the Demyanov one). This space is a Banach and a Riesz space for all dimensions and a Banach lattice for n=1. The directed sets in R ⁿ are parametrized by normal directions and defined recursively with respect to the dimension n by the help of a support function and directed supporting faces of lower dimension prescribing the boundary. The operations (addition, subtraction, scalar multiplication) are defined by acting separately on the support function and recursively on the directed supporting faces. Generalized intervals introduced by Kaucher form the basis of this recursive approach. Visualizations of directed sets will be presented in the second part of the paper.     

不等式约束最优化的一个使用非单调搜索的可行算法

对不等式约束最优化问题本文提出了一个新算法。算法使用了非单调搜索,它不仅放松了每步迭代中对搜索的限制,而且使得算法迭代到一定阶段后具有非常简洁的形式,在不需要严格互补条件的较弱假设下,算法是整体和超线性收敛的。     

Strategic response to pollution taxes in supply chain networks: Dynamic,spatial, and organizational dimensions

This paper presents a model of the strategic behavior of firms operating in a spatial supply chain network. The manufacturing and retailing firms engage in an oligopolistic, noncooperative game by sharing customer demand such that a firm’s decisions impact the product prices, which in turn result in changes in all other firms’ decisions. Each firm’s payoff is to maximize its own profit and we show that, in response to such changes in prices and to exogenous environmental taxes, the manufacturing firms may strategically alter a variety of choices such as ’make-buy’ decisions with respect to intermediate inputs, spatial distribution of production, product shipment patterns and inventory management, environmental tax payment vs recycling decisions, and timing of all such choices to sustainably manage the profit and the environmental regulations. An important implication is that effects of a tax depends on the oligopolistic game structure. With respect to methods, we show that this dynamic game can be represented as a set of differential variational inequalities (DVIs) that motivate a computationally efficient nonlinear complementarity (NCP) approach that enables the full exploitation of above-mentioned salient features. We also provide a numerical example that confirms the utility of our proposed framework and shows substantial strategic reaction can be expected to a tax on pollution stocks.     

On exactness and isoperimetric profiles of discrete groups

We introduce a quasi-isometry invariant related to Property A and explore its connections to various other invariants of finitely generated groups. This allows to establish a direct relation between asymptotic dimension on one hand and isoperimetry and random walks on the other. We apply these results to reprove sharp estimates on isoperimetric profiles of some groups and to answer some questions in dimension theory.     

一类涉及总量互补经济均衡的全局稳定性

本文利用类似Ａｒｒｏｗ和Ｈａｈｎ（１９７１）(［２］)的方法证明了一类涉及总量互补的竞争均衡全局稳定性．     

Straight line embeddings of cubic planar graphs with integer edge lengths

We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008     

A definable nonstandard enlargement

This article establishes the existence of a definable (over ZFC), countably saturated nonstandard enlargement of the superstructure over the reals. This nonstandard universe is obtained as the union of an inductive chain of bounded ultrapowers (i.e. bounded with respect to the superstructure hierarchy). The underlying ultrafilter is the one constructed by Kanovei and Shelah [10]. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Regular maps of graphs of order 4<Emphasis Type="Italic">p</Emphasis>

A 2-cell embedding f : X → S of a graph X into a closed orientable surface S can be described combinatorially by a pair M = (X;ρ ) called a map, where ρ is a product of disjoint cycle permutations each of which is the permutation of the arc set of X initiated at the same vertex following the orientation of S . It is well known that the automorphism group of M acts semi-regularly on the arc set of X and if the action is regular, then the map M and the embedding f are called regular. Let p and q be primes. Du et al. [J. Algebraic Combin., 19, 123-141 (2004)] classified the regular maps of graphs of order pq . In this paper all pairwise non-isomorphic regular maps of graphs of order 4 p are constructed explicitly and the genera of such regular maps are computed. As a result, there are twelve sporadic and six infinite families of regular maps of graphs of order 4 p ; two of the infinite families are regular maps with the complete bipartite graphs K2p,2p as underlying graphs and the other four infinite families are regular balanced Cayley maps on the groups Z4p , Z22 × Zp and D4p .     

Randomized k-server algorithms for growth-rate bounded graphs

The k-server problem is a fundamental online problem where k mobile servers should be scheduled to answer a sequence of requests for points in a metric space as to minimize the total movement cost. While the deterministic competitive ratio is at least k, randomized k-server algorithms have the potential of reaching o(k)-competitive ratios. Prior to this work only few specific cases of this problem were solved. For arbitrary metric spaces, this goal may be approached by using probabilistic metric approximation techniques. This paper gives the first results in this direction, obtaining o(k)-competitive ratio for a natural class of metric spaces, including d-dimensional grids, and wide range of k.     

Isometric embeddings of subdivided connected graphs into hypercubes

Isometric subgraphs of hypercubes are known as partial cubes. These graphs have first been investigated by Graham and Pollack [R.L. Graham, H. Pollack, On the addressing problem for loop switching, Bell System Technol. J. 50 (1971) 2495-2519; and D. Djokovi?, Distance preserving subgraphs of hypercubes, J. Combin. Theory Ser. B 14 (1973) 263-267]. Several papers followed with various characterizations of partial cubes. In this paper, we determine all subdivisions of a given configuration which can be embedded isometrically in the hypercube. More specifically, we deal with the case where this configuration is a connected graph of order 4, a complete graph of order 5 and the case of a k-fan F_k(k≥3).