拟序下非连续增算子新的广义不动点定理

运用序方法研究了拟序空间X中具A=CB型非连续增算子的广义不动点的存在性问题,证明了在拟序空间X中具A=CB型非连续增算子存在最小广义不动点和最大广义不动点.所得结果推广了相关结论.     

单圈图的极小能量

For a simple graph G, the energy E(G) is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let Undenote the set of all connected unicyclic graphs with order n, and Ur n= {G ∈ Un| d(x) = r for any vertex x ∈ V(Cl)}, where r ≥ 2 and Cl is the unique cycle in G. Every unicyclic graph in Ur nis said to be a cycle-r-regular graph.In this paper, we completely characterize that C39(2, 2, 2) ο Sn-8is the unique graph having minimal energy in U4 n. Moreover, the graph with minimal energy is uniquely determined in Ur nfor r = 3, 4.     

Set choice problems with incomplete information about the preferences of the decision maker

We consider the problem of selecting a predetermined number of objects from a given finite set. It is assumed that the preferences of the decision maker on this set are only partially known. Our solution approach is based on the notions of optimal and non-dominated subsets. The properties of such subsets and the objects they contain are investigated. The implementation of the developed approach is discussed and illustrated by various examples.     

Functional variational principles and coercivity over normed spaces

Using Karlin’s [4] weak game values, a ‘weakly determined’ game is introduced. Conditions for weak determinateness of games and for strict determinateness of weakly determined games are presented. Finally, generalizations of some well-known minimax theorems are derived from these results.     

Representing quasi-orders by embeddability ordering of families of topological spaces

An elementary argument constructs, for each cardinal , a topological space whose subspaces, ordered by homeomorphic embeddability, can model every partial order on -many points. We show how to modify this procedure to deal also with quasi-orders (where the antisymmetry condition may fail), obtaining an initial estimate of the cardinality of the space then required.

     

The Priestley Separation Axiom for Scattered Spaces

Let R be a quasi-order on a compact Hausdorff topological space X. We prove that if X is scattered, then R satisfies the Priestley separation axiom if and only if R is closed in the product space X×X. Furthermore, if X is not scattered, then we show that there is a quasi-order on X that is closed in X×X but does not satisfy the Priestley separation axiom. As a result, we obtain a new characterization of scattered compact Hausdorff spaces.     

三条路并的极值能量及一类图的能量排序

拟序是图能量排序中一种有效方法,基于该方法,已经得到了大量图类的极值能量排序的结果.Gutman给出了点数和为n的两条路的并的能量排序,而三条路的并的能量排序没有一个理想的结论.本文利用拟序法给出点数和为n的三条路的并的极值能量及一类图能量的排序.     

Algebras Defined from Ordered Sets and the Varieties they Generate

We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by these algebras. In particular we consider two different but related methods for constructing an algebra with one binary operation from an arbitrary ordered set with a top element. The two varieties generated by all these algebras are shown to be well-behaved in that they are locally finite, finitely based, and have an equationally definable order relation. We exhibit a bijection between the subdirectly irreducible algebras in each variety and the class of all ordered sets with top element. We determine the structure and cardinality of the free algebra on n-free generators and provide sharp bounds on the number of n-generated algebras in each variety. These enumeration results involve the number of quasi-orders on an n-element set.