On k-CS-Transitive Cycle-Free Partial Orders with Finite Alternating Chains

The notion of cycle-free partial order (CFPO) was defined by R. Warren, and the major cases of the classification of the countable sufficiently transitive CFPOs were given, the finite and infinite chain cases, by Creed, Truss, and Warren. It is the purpose of this paper to complete the classification. The cases which remained untreated were CFPOs not embedding an infinite alternating chain ALT (which can only happen in the finite chain case). It is shown that if a k-CS-transitive CFPO does not embed ALT, where k 3, then it does not embed any alternating chain of size k + 3, and this leads to the desired classification (which is only given explicitly for k = 3 and 4). The general result says that the class of k-CS-transitive CFPOs for k 3 not embedding ALT admits a recursive classification.     

随机环境中马氏链的常返性和瞬时性

在π-不可约条件下,得到随机环境中的马氏链瞬时和常返的判定准则,进而得到随机环境中马氏链常返的充要条件;如果环境还是平稳的,则状态空间中不存在非正则本质态.     

随机环境中马氏链的常返性和瞬时性

讨论了随机环境马氏链中具有强π不可约性链的常返性的判定,从而得到了强π不可约链常返性判定的充分必要条件,同时给出了在一定条件下随机环境中的马氏链的瞬时性判定的几个充分条件.     

树指标集马氏链的常返性

用鞅方法给出了在不限定根顶点O的条件下,树指标集马氏链常返性的充分条件,部分解决了Benjamin.I提出的问题.     

随机环境中马氏链的周期性和常返性

研究了随机环境中马氏链的周期性,引入了随机环境中马氏链的正常返和零常返,利用状态的周期讨论了随机环境中马氏链的正常返性,给出了状态正常返的若干充分条件,从而推广了经典马氏链的相应结论.     

随机环境中马氏链的强常返性

讨论了随机环境中马氏链的强常返性,给出了在一类条件下,弱常返是强常返的及判定X是强常返的一个充分条件.     

Recurrence and Transience Criteria for Two Cases of Stable-Like Markov Chains

We give recurrence and transience criteria for two cases of time-homogeneous Markov chains on the real line with transition kernel p(x,dy)=f _x (y?x)?dy, where f _x (y) are probability densities of symmetric distributions and, for large |y|, have a power-law decay with exponent α(x)+1, with α(x)∈(0,2). If f _x (y) is the density of a symmetric α-stable distribution for negative x and the density of a symmetric β-stable distribution for non-negative x, where α,β∈(0,2), then the chain is recurrent if and only if α+β≥2. If the function x?f _x is periodic and if the set {x:α(x)=α ₀:=inf _x∈? α(x)} has positive Lebesgue measure, then, under a uniformity condition on the densities f _x (y) and some mild technical conditions, the chain is recurrent if and only if α ₀≥1.     

Riemann problems in FPU chains

We impose Riemann initial data to FPU chains and study the solutions on the hyperbolic macroscopic scale. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Regular and chaotic recurrence in FPU cell-chains

In contrast to the classical Fermi–Pasta–Ulam (FPU) chain, the inhomogeneous FPU chain shows nearly all the principal resonances. Using this fact, we can construct a periodic FPU chain of low dimension, for instance a FPU cell of four degrees-of-freedom, that can be used as a building block for a FPU cell-chain. This is a new type of chain. Differences between chains in nearest-neighbor interaction and those in overall interaction are caused by symmetry. We will show some striking results on the dynamics of FPU cell-chains where near-integrable behavior or chaos plays a part near stable equilibrium.     

An Alternating Direction Method for Nash Equilibrium of Two-Person Games with Alternating Offers

In this paper, we propose a method for finding a Nash equilibrium of two-person games with alternating offers. The proposed method is referred to as the inexact proximal alternating direction method. In this method, the idea of alternating direction method simulates alternating offers in the game, while the inexact solutions of subproblems can be matched to the assumptions of incomplete information and bounded individual rationality in practice. The convergence of the proposed method is proved under some suitable conditions. Numerical tests show that the proposed method is competitive to the state-of-the-art algorithms.     

Generating Functions for Alternating Descents and Alternating Major Index

In 2008, Chebikin introduced the alternating descent set, AltDes(??), of a permutation ?? =??? ₁ ··· ?? _n in the symmetric group S _n as the set of all i such that either i is odd and ?? _i >??? _i+1 or i is even and ?? _i <??? _i+1. We can then define altdes(??) =?|AltDes(??)| and ${{\rm altmaj}(\sigma) = \sum_{i \in AltDes(\sigma)}i}$ . In this paper, we compute a generating function for the joint distribution of altdes(??) and altmaj(??) over S _n . Our formula is similar to the formula for the joint distribution of des and maj over the symmetric group that was first proved by Gessel. We also compute similar generating functions for the groups B _n and D _n and for r-tuples of permutations in S _n . Finally we prove a general extension of these formulas in cases where we keep track of descents only at positions r, 2r, . . ..     

Superlocals in Symmetric and Alternating Groups

On Aschbacher's definition, a subgroup N of a finite group is called a -superlocal for a prime if . We describe the -superlocals in symmetric and alternating groups, thereby resolving part way Problem 11.3 in the Kourovka Notebook [3].     

Perturbed Markov Chains with Damping Component

The paper is devoted to studies of regularly and singularly perturbed Markov chains with damping component. In such models, a matrix of transition probabilities is regularised by adding a special damping matrix multiplied by a small damping (perturbation) parameter ε. We perform a detailed perturbation analysis for such Markov chains, particularly, give effective upper bounds for the rate of approximation for stationary distributions of unperturbed Markov chains by stationary distributions of perturbed Markov chains with regularised matrices of transition probabilities, asymptotic expansions for approximating stationary distributions with respect to damping parameter, explicit coupling type upper bounds for the rate of convergence in ergodic theorems for n-step transition probabilities, as well as ergodic theorems in triangular array mode.

     

Markov Chains with finite convergence time

We study the properties of finite ergodic Markov Chains whose transition probability matrix P is singular. The results establish bounds on the convergence time of P^m to a matrix where all the rows are equal to the stationary distribution of P. The results suggest a simple rule for identifying the singular matrices which do not have a finite convergence time. We next study finite convergence to the stationary distribution independent of the initial distribution. The results establish the connection between the convergence time and the order of the minimal polynomial of the transition probability matrix. A queuing problem and a maintenance Markovian decision problem which possess the property of rapid convergence are presented.     

Quasi-Feller Extensions of Markov Chains and Existence of Dual Chains

The author presents a revised and detailed version of his theorem on the existence of Feller's extensions of Markov chains; to this end the broader notion of quasi-Feller extension is used. The existence of Markov chains dual to the chains with Borel space of states is derived from this result. Chains irreducible in the Orey sense are studied in most detail. For example, we prove that for such chains the quasi-Feller extension can be chosen recurrent or Liouville if the original chains possess these properties.     

Chains and antichains in partial orderings

We study the complexity of infinite chains and antichains in computable partial orderings. We show that there is a computable partial ordering which has an infinite chain but none that is or , and also obtain the analogous result for antichains. On the other hand, we show that every computable partial ordering which has an infinite chain must have an infinite chain that is the difference of two sets. Our main result is that there is a computably axiomatizable theory K of partial orderings such that K has a computable model with arbitrarily long finite chains but no computable model with an infinite chain. We also prove the corresponding result for antichains. Finally, we prove that if a computable partial ordering has the feature that for every , there is an infinite chain or antichain that is relative to , then we have uniform dichotomy: either for all copies of , there is an infinite chain that is relative to , or for all copies of , there is an infinite antichain that is relative to .     

Recurrence relations with two indices and even trees

Recently, the author, Mansour, introduced a combinatorial problem, called Hobby's problem, to study different types of recurrence relations with two indices. Moreover, he presented several recurrence relations with two indices related to Dyck paths and Schröder paths. In this paper, we generalize Hobby's problem to study other types of recurrence relations with two indices for which a combinatorial method provides a complete solution. Combinatorially, we describe these recurrence relations as a set of lattice paths in the second octant of the plane integer lattice, and then we map bijectively these lattice paths to the set of even trees. Analytically, we use the kernel method technique to solve these recurrence relations.     

Recurrence relation with two indices and plane compositions

The aim of this paper is to study analytical and combinatorial methods to solve a special type of recurrence relation with two indices. It is shown that the recurrence relation enumerates a natural combinatorial object called a plane composition. In addition, further interesting recurrence relations arise in the study of statistics for these plane compositions.     

On comparing optimum Alternating Direction Preconditioning and Extrapolated Alternating Direction Implicit schemes

The purpose of this paper is to show the equivalence of Alternating Direction Preconditioning and Extrapolated Alternating Direction Implicit methods in the case of two-level one-parameter optimized schemes as far as convergence rates are concerned, and also to give optimum parameters for the numerical solution of the self-adjoint second-order elliptic partial differential equation and the biharmonic equation.