Let F be the field algebra of G -spin model, D(G) the double algebra of a finite group G and D(H) the sub-Hopf algerba of D(G) determined by the subgroup H of G . The paper builds a correspondence between D(H) and th...Let F be the field algebra of G -spin model, D(G) the double algebra of a finite group G and D(H) the sub-Hopf algerba of D(G) determined by the subgroup H of G . The paper builds a correspondence between D(H) and the D(H) -invariant sub- C * -algebra A H in F, and proves that the correspondence is strictly monotonic.展开更多
I consider a system whose deterioration follows a discrete-time and discrete-state Markov chain with an absorbing state. When the system is put into practice, I may select operation (wait), imperfect repair, or replac...I consider a system whose deterioration follows a discrete-time and discrete-state Markov chain with an absorbing state. When the system is put into practice, I may select operation (wait), imperfect repair, or replacement at each discrete-time point. The true state of the system is not known when it is operated. Instead, the system is monitored after operation and some incomplete information concerned with the deterioration is obtained for decision making. Since there are multiple imperfect repairs, I can select one option from them when the imperfect repair is preferable to operation and replacement. To express this situation, I propose a POMDP model and theoretically investigate the structure of an optimal maintenance policy minimizing a total expected discounted cost for an unbounded horizon. Then two stochastic orders are used for the analysis of our problem.展开更多
In this article,we consider Orlicz-Lorentz sequence spaces equipped with the Orlicz norm(λ_(φ,ω),‖·‖_(φ,ω)^(O))generated by any Orlicz function and any non-increasing weight sequence.As far as we know,rese...In this article,we consider Orlicz-Lorentz sequence spaces equipped with the Orlicz norm(λ_(φ,ω),‖·‖_(φ,ω)^(O))generated by any Orlicz function and any non-increasing weight sequence.As far as we know,research on such a general case is conducted for the first time.After showing that the Orlicz norm is equal to the Amemiya norm in general and giving some important properties of this norm,we study the problem of existence of order isomorphically isometric copies of l∞in the space(λ_(φ,ω),‖·‖_(φ,ω)^(O))and we find criteria for order continuity and monotonicity properties of this space.We also find criteria for monotonicity properties of n-dimensional subspaces λ_(φ,ω)^(n)(n≥2)and the subspace(λ_(φ,ω))_(a) of order continuous elements of λ_(φ,ω).Finally,as an immediate consequence of the criteria considered in this article,the properties of Orlicz sequence spaces equipped with the Orlicz norm are deduced.展开更多
A graph property is a set of graphs such that if the set contains some graph G then it also contains each isomorphic copy of G (with the same vertex set). A graph property P on n ventices is said to be elusive, if eve...A graph property is a set of graphs such that if the set contains some graph G then it also contains each isomorphic copy of G (with the same vertex set). A graph property P on n ventices is said to be elusive, if every decision tree algorithm recognizing P must examine all n(n - 1)/2 pairs of ventices in the worst case. Karp conjectured that every nontrivial monotone graph property is elusive. In this paper, this conjecture is proved for some cases. Especially,it is shown that if the abstract simplicial complex of a nontrivial monotone graph property P has dimension not exceeding 5, then P is elusive.展开更多
文摘Let F be the field algebra of G -spin model, D(G) the double algebra of a finite group G and D(H) the sub-Hopf algerba of D(G) determined by the subgroup H of G . The paper builds a correspondence between D(H) and the D(H) -invariant sub- C * -algebra A H in F, and proves that the correspondence is strictly monotonic.
文摘I consider a system whose deterioration follows a discrete-time and discrete-state Markov chain with an absorbing state. When the system is put into practice, I may select operation (wait), imperfect repair, or replacement at each discrete-time point. The true state of the system is not known when it is operated. Instead, the system is monitored after operation and some incomplete information concerned with the deterioration is obtained for decision making. Since there are multiple imperfect repairs, I can select one option from them when the imperfect repair is preferable to operation and replacement. To express this situation, I propose a POMDP model and theoretically investigate the structure of an optimal maintenance policy minimizing a total expected discounted cost for an unbounded horizon. Then two stochastic orders are used for the analysis of our problem.
文摘In this article,we consider Orlicz-Lorentz sequence spaces equipped with the Orlicz norm(λ_(φ,ω),‖·‖_(φ,ω)^(O))generated by any Orlicz function and any non-increasing weight sequence.As far as we know,research on such a general case is conducted for the first time.After showing that the Orlicz norm is equal to the Amemiya norm in general and giving some important properties of this norm,we study the problem of existence of order isomorphically isometric copies of l∞in the space(λ_(φ,ω),‖·‖_(φ,ω)^(O))and we find criteria for order continuity and monotonicity properties of this space.We also find criteria for monotonicity properties of n-dimensional subspaces λ_(φ,ω)^(n)(n≥2)and the subspace(λ_(φ,ω))_(a) of order continuous elements of λ_(φ,ω).Finally,as an immediate consequence of the criteria considered in this article,the properties of Orlicz sequence spaces equipped with the Orlicz norm are deduced.
文摘A graph property is a set of graphs such that if the set contains some graph G then it also contains each isomorphic copy of G (with the same vertex set). A graph property P on n ventices is said to be elusive, if every decision tree algorithm recognizing P must examine all n(n - 1)/2 pairs of ventices in the worst case. Karp conjectured that every nontrivial monotone graph property is elusive. In this paper, this conjecture is proved for some cases. Especially,it is shown that if the abstract simplicial complex of a nontrivial monotone graph property P has dimension not exceeding 5, then P is elusive.
