The Ordered Gradual Covering Location Problem on a Network

In this paper we develop a network location model that combines the characteristics of ordered median and gradual cover models resulting in the Ordered Gradual Covering Location Problem (OGCLP). The Gradual Cover Location Problem (GCLP) was specifically designed to extend the basic cover objective to capture sensitivity with respect to absolute travel distance. The Ordered Median Location problem is a generalization of most of the classical locations problems like p-median or p-center problems. The OGCLP model provides a unifying structure for the standard location models and allows us to develop objectives sensitive to both relative and absolute customer-to-facility distances. We derive Finite Dominating Sets (FDS) for the one facility case of the OGCLP. Moreover, we present efficient algorithms for determining the FDS and also discuss the conditional case where a certain number of facilities is already assumed to exist and one new facility is to be added. For the multi-facility case we are able to identify a finite set of potential facility locations a priori, which essentially converts the network location model into its discrete counterpart. For the multi-facility discrete OGCLP we discuss several Integer Programming formulations and give computational results.     

Euler-Mahonian statistics on ordered set partitions (II)

[E. Steingrímsson, Statistics on ordered partitions of sets, arXiv: math.CO/0605670] introduced several hard statistics on ordered set partitions and conjectured that their generating functions are related to the q-Stirling numbers of the second kind. In a previous paper, half of these conjectures have been proved by Ishikawa, Kasraoui and Zeng using the transfer-matrix method. In this paper, we shall give bijective proofs of all the conjectures of Steingrímsson. Our basic idea is to encode ordered set partitions by a kind of path diagrams and explore the rich combinatorial properties of the latter structure. As a bonus of our approach, we derive two new σ-partition interpretations of the p,q-Stirling numbers of the second kind introduced by Wachs and White. We also discuss the connections with MacMahon's theorem on the equidistribution of the inversion number and major index on words and give a partition version of his result.     

A realization theorem for sets of lengths

Text

By a result of G. Freiman and A. Geroldinger [G. Freiman, A. Geroldinger, An addition theorem and its arithmetical application, J. Number Theory 85 (1) (2000) 59-73] it is known that the set of lengths of factorizations of an algebraic integer (in the ring of integers of an algebraic number field), or more generally of an element of a Krull monoid with finite class group, has a certain structure: it is an almost arithmetical multiprogression for whose difference and bound only finitely many values are possible, and these depend just on the class group. We establish a sort of converse to this result, showing that for each choice of finitely many differences and of a bound there exists some number field such that each almost arithmetical multiprogression with one of these difference and that bound is up to shift the set of lengths of an algebraic integer of that number field. Moreover, we give an explicit sufficient condition on the class group of the number field for this to happen.

Video

For a video summary of this paper, please visit http://www.youtube.com/watch?v=c61xM-5D6Do.     

Subpullback flat S-posets need not be subequalizer flat

If S is a monoid, a right S-act A _S is a set A, equipped with a “right S-action” A×S→A sending the pair (a,s)∈ A×S to as, that satisfies the conditions (i) a(st)=(as)t and (ii) a1=a for all a∈A and s,t∈S. If, in addition, S is equipped with a compatible partial order and A is a poset, such that the action is monotone (when A×S is equipped with the product order), then A _S is called a right S-poset. Left S-acts and S-posets are defined analogously. For a given S-act (resp. S-poset) a tensor product functor A _S ?? from left S-acts to sets (resp. left S-posets to posets) exists, and A _S is called pullback flat or equalizer flat (resp. subpullback flat or subequalizer flat) if this functor preserves pullbacks or equalizers (resp. subpullbacks or subequalizers). By analogy with the Lazard-Govorov Theorem for R-modules, B. Stenström proved in 1971 that an S-act is isomorphic to a directed colimit of finitely generated free S -acts if and only if it is both pullback flat and equalizer flat. Some 20 years later, the present author showed that, in fact, pullback flatness by itself is sufficient. (A new, more direct proof of that result is contained in the present article.) In 2005, Valdis Laan and the present author obtained a version of the Lazard-Govorov Theorem for S-posets, in which subpullbacks and subequalizers now assume the role previously played by pullbacks and equalizers. The question of whether subpullback flatness implies subequalizer flatness remained unsolved. The present paper provides a negative answer to this question.     

On the homological classification of pomonoids by their Rees factor S-posets

The study of flatness properties of pomonoids acting on posets was initiated by S.M. Fakhruddin in the 1980s. This work has recently been continued by various authors (see references). The Rees factor S-posets are investigated in S. Bulman-Fleming, D. Gutermuth, A. Gilmour and M. Kilp, Flatness properties of  S -posets (Commun. Algebra 34:1291–1317, 2006). In the present article, we investigate the homological classification problems of pomonoids by their Rees factor S-posets. Supported by Research Supervisor Program of Education Department of Gansu Province (0801-03) and nwnu-kjcxgc-03-51.     

模糊星形数空间在L_p度量下的紧集刻画

1990年,P.Diamond首次给出了由全体相对于原点的模糊星形数构成的空间在Lp度量下的紧集刻画。后来,Congxin Wu和Zhitao Zhao通过一个反例指出了P.Diamond的刻画是不正确的,并给出了一种正确的刻画。在这篇文章中,我们将进一步推广这个结论,得到了全体模糊星形数空间在Lp度量下的紧集刻画。     

四值非线性序集逻辑系统中理论的随机发散度

在四值非线性序集逻辑系统L24中,给出了随机相似度和随机逻辑伪距离的基本性质。然后在随机逻辑度量空间中提出了理论的随机发散度,指出全体原子公式之集在随机逻辑度量空间中未必是全发散的,其是否全发散取决于给定的四值概率分布序列。     

粗糙集的相似度量

在近似空间中,分别以集合的上下近似以及元素的隶属度定义了两个集合间的相似度度量,讨论了两种相似度的性质,并对两种相似度进行了比较．     

优势关系下不协调目标信息系统的部分一致约简

在基于优势关系下的不协调目标信息系统中引入了部分一致约简的概念, 并得到了部分一致约简的判定定理以及辨识矩阵, 建立了不协调目标信息系统的部分一致约简的具体方法, 同时通过实例验证了该方法的有效性, 从而为优势关系下信息系统的知识发现提供了理论基础.     

LF内部空间的仿紧性

在LF内部空间中,引入了Q-内部域、α-Q-内部族等概念,并以此定义了F紧集和F仿紧集,给出了它们的特征刻画。证明了F紧集是F仿紧集,F仿紧性是F可乘性。