Convexity and the difference property

We show that the class of all delta-convex selfmappings of R$\mathbb{R}$ (differences of two convex functions) enjoys the difference property in the sense of N.G. de Bruijn. The Q$\mathbb{Q}$-differentiability technique has been applied as a proof tool.     

Directed submodularity,ditroids and directed submodular flows

Set relations and operations such as inclusion, union and intersection are generalized to directed subsets whose elements are distinguished between forward and backward elements. The concepts of submodular functions, matroids and polymatroidal network flows are extended to the concepts of directed submodular functions, ditroids and directed submodular flows on directed subsets. Two unrelated matroids (submodular functions) can be embedded in one ditroid (directed submodular function). Total dual integrality is preserved in these generalizations and proved for very general set-function class-directed odd submodular functions.This work was partially supported by Chinese National Natural Science Fund.     

Properties of distance functions on convex surfaces and applications

If X is a convex surface in a Euclidean space, then the squared intrinsic distance function dist²(x, y) is DC (d.c., delta-convex) on X×X in the only natural extrinsic sense. An analogous result holds for the squared distance function dist²(x,F) from a closed set F ⊂ X. Applications concerning r-boundaries (distance spheres) and ambiguous loci (exoskeletons) of closed subsets of a convex surface are given.     

Directed graphs of inner translations of semigroups

A mapping \(\alpha :S\rightarrow S\) is called a Cayley function if there exist an associative operation \(\mu :S\times S\rightarrow S\) and an element \(a\in S\) such that \(\alpha (x)=\mu (a,x)\) for every \(x\in S\). The aim of the paper is to give a characterization of Cayley functions in terms of their directed graphs. This characterization is used to determine which elements of the centralizer of a permutation on a finite set are Cayley functions. The paper ends with a number of problems.     

Directed Sets and Malitz-Cauchy-Completions

This is a study of the set of the Malitz-completions (which are a special case of Cauchy-completions) of a given infinite first-order structure, put in relation with properties of directed sets.     

Directed and weighted majority games

In this paper we deal with several classes of simple games; the first class is the one of ordered simple games (i.e. they admit of a complete desirability relation). The second class consists of all zero-sum games in the first one.First of all we introduce a natural partial order on both classes respectively and prove that this order relation admits a rank function. Also the first class turns out to be a rank symmetric lattice. These order relations induce fast algorithms to generate both classes of ordered games.Next we focus on the class of weighted majority games withn persons, which can be mapped onto the class of weighted majority zero-sum games withn+1 persons.To this end, we use in addition methods of linear programming, styling them for the special structure of ordered games. Thus, finally, we obtain algorithms, by combiningLP-methods and the partial order relation structure. These fast algorithms serve to test any ordered game for the weighted majority property. They provide a (frequently minimal) representation in case the answer to the test is affirmative.     

Random Walks on Directed Covers of Graphs

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates no longer coincide in general. Furthermore, the behavior of random walks on directed covers of infinite graphs is more subtle. We provide a classification in terms of recurrence and transience and point out that the critical random walk may be recurrent or transient. Our proof is based on the observation that recurrence of the random walk is equivalent to the almost sure extinction of an appropriate branching process. Two examples in random environment are provided: homesick random walk on infinite percolation clusters and random walk in random environment on directed covers. Furthermore, we calculate, under reasonable assumptions, the rate of escape with respect to suitable length functions and prove the existence of the asymptotic entropy providing an explicit formula which is also a new result for directed covers of finite graphs. In particular, the asymptotic entropy of random walks on directed covers of finite graphs is positive if and only if the random walk is transient.     

FS-相容Domain的定向完备化及相关范畴性质

引入FS-相容Domain概念，研究FS-相容Domain的性质，主要结果有：（1）FS-相容Domain的收缩核与连续函数空间还是FS-相容Domain；（2）FS-相容Domain是有限生成上集，从而是Scott紧的；（3）FS-相容Domain的定向完备化是FS-Domaln；（4）有最大元的FS-Domain去掉最大元后是FS-相容Domain；（5）证明了以Scott连续映射为态射，FS-相容Domain为对象的范畴FS-CDOM是笛卡儿闭范畴并以FS-Domain范畴FS-DOM作为满的反射子范畴。     

A Full Function-Based Calculus of Directed and Undirected Intervals: Markov'S Interval Arithmetic Revisited

This paper proposes a new interpretation of intervals as classes of functions having the same domain. Interval operations are seen as operations on these classes. This approach allows to recover Markov's directed interval arithmetic by taking into account the monotonicity of the functions.     

Directed t-Packings and Directed t-Steiner Systems

The aim of this paper is an investigation of directed t-packings and in particular of directed t-Steiner systems. A new upper bound on the number of points k for directed t-Steiner systems T(t,k,k) is obtained. We disprove a conjecture of Levenshtein on T(t,k,k) for t 3 by showing that a T(4,6,6) exists. Furthermore, it is proved that the symmetric group S ₆ can be partitioned into 30 disjoint T(4,6,6)s. Extensive computer search shows that the tight upper bound on K for t =4,5 is 6 and for t=6 is 7. The non-existence of further small directed t-Steiner systems is established, and large directed t-packings for t,4,5,6 are constructed.