Decomposability index of tournaments

Given a tournament $T$, a module of $T$ is a subset $X$ of $V\left(T\right)$ such that for $x,y\in X$ and $v\in V\left(T\right)?X$, $(x,v)\in A\left(T\right)$ if and only if $(y,v)\in A\left(T\right)$. The trivial modules of $T$ are $?$, $\left\{u\right\}$ $(u\in V\left(T\right))$ and $V\left(T\right)$. The tournament $T$ is indecomposable if all its modules are trivial; otherwise it is decomposable. The decomposability index of $T$, denoted by $\delta \left(T\right)$, is the smallest number of arcs of $T$ that must be reversed to make $T$ indecomposable. For $n\ge 5$, let $\delta \left(n\right)$ be the maximum of $\delta \left(T\right)$ over the tournaments $T$ with $n$ vertices. We prove that $?\frac{n+1}{4}?\le \delta \left(n\right)\le ?\frac{n?1}{3}?$ and that the lower bound is reached by the transitive tournaments.     

集合风险模型的可分解性

本文讨论了集合风险模型中 ,在复合二项分布和复合负二项分布两种情况下的可分解性问题 ,得到了同复合泊松分布情况下类似的结果     

Riesz operators and the complete norm topology

We show that a non-injective Riesz operator on an infinite-dimensional Banach space X does not determine the complete norm topology of X. We also show that an injective operator with trivial generalized range determines the complete norm topology of X. Finally this result is used to settle the crucial role of the non-injectivity condition in our first result.     

Decomposability in queues with background states

A symmetric queue is known to have a nice property, the so-called insensitivity. In this paper, we generalize this for a single node queue with Poisson arrivals and background state, which changes at completion instants of lifetimes as well as at the arrival and departure instants. We study this problem by using the decomposability property of the joint stationary distribution of the queue length and supplementary variables, which implies the insensitivity. We formulate a Markov process representing the state of the queue as an RGSMP (reallocatable generalized semi-Markov process), and give necessary and sufficient conditions for the decomposability. We then establish general criteria to be sufficient for the queue to possess the property. Various symmetric-like queues with background states, including continuous time versions of moving server queues, are shown to have the decomposability.This author is partially supported by NEC C&C Laboratories.     

-可分解Fuzy关系及其*-传递性

对［０，１］上一般的算子‘＊’引入＊－紧Ｆｕｚｚｙ关系及其○＊－可分解Ｆｕｚｙ关系的概念，证明了有单位元１的保序算子‘＊’及有单位元０的保序算子‘＊－’所定义的○＊－可分解和○＊－－可分解Ｆｕｚｚｙ关系在某种意义上构成了新的可传递Ｆｕｚｚｙ关系类，并且还给出了这些类在不同类型的传递性之间的一种位置关系，特别地，对二元○∨－可分解Ｆｕｚｚｙ关系，该文还得到了一个关于其传递性的完全刻画．     

Best affine unbiased response decomposition

Given two linear regression models y₁=X₁β₁+u₁ and y₂=X₂β₂+u₂ where the response vectors y₁ and y₂ are unobservable but the sum y=y₁+y₂ is observable, we study the problem of decomposing y into components and , intended to be close to y₁ and y₂, respectively. We develop a theory of best affine unbiased decomposition in this setting. A necessary and sufficient condition for the existence of an affine unbiased decomposition is given. Under this condition, we establish the existence and uniqueness of the best affine unbiased decomposition and provide an expression for it.     

Additively decomposed quasiconvex functions

Letf be a real-valued function defined on the product ofm finite-dimensional open convex setsX ₁, ,X _m .Assume thatf is quasiconvex and is the sum of nonconstant functionsf ₁, ,f _m defined on the respective factor sets. Then everyf _i is continuous; with at most one exception every functionf _i is convex; if the exception arises, all the other functions have a strict convexity property and the nonconvex function has several of the differentiability properties of a convex function.We define the convexity index of a functionf _i appearing as a term in an additive decomposition of a quasiconvex function, and we study the properties of that index. In particular, in the case of two one-dimensional factor sets, we characterize the quasiconvexity of an additively decomposed functionf either in terms of the nonnegativity of the sum of the convexity indices off ₁ andf ₂, or, equivalently, in terms of the separation of the graphs off ₁ andf ₂ by means of a logarithmic function. We investigate the extension of these results to the case ofm factor sets of arbitrary finite dimensions. The introduction discusses applications to economic theory.