Periodicities in Cluster Algebras and Cluster Automorphism Groups

We study the relations between two groups related to cluster automorphism groups which are defined by Assem,Schiffler and Shamchenko.We establish the relation-ships among (strict) direct cluster automorphism groups and those groups consisting of periodicities of labeled seeds and exchange matrices,respectively,in the language of short exact sequences.As an application,we characterize automorphism-finite cluster algebras in the cases of bipartite seeds or finite mutation type.Finally,we study the relation between the group Aut(A) for a cluster algebra A and the group AutMn(S) for a mutation group Mn and a labeled mutation class S,and we give a negative answer via counter-examples to King and Pressland's problem.     

Solving stochastic convex feasibility problems in hilbert spaces

In a stochastic convex feasibility problem connected with a complete probability space (Ω,A,μ) and a family of closed convex sets (C_ω)_ωεΩ in a real Hilbert space H, one wants to find a point that belongs to C_ω for μ almost all ω ε Ω. We present a projection based method where the variable relaxation parameter is defined by a geometrical condition, leading to an iteration sequence that is always weakly convergent to a μ almost common point. We then give a general condition assuring norm convergence of this equation to that μ almost common point     

父代种群参与竞争遗传算法几乎必然收敛

熟知,标准遗传算法如不采用“杰出者记录策略”则必不收敛。本文发现：允许父代种群参与竞争是标准遗传算法几乎必然收敛的条件。特别地,我们运用鞅收敛定理证明：允许父代种群参与竞争型遗传算法能以概率1确保在限步内达到全局最优解,且收敛与种群规模无关。所获结果对该类遗传算法的应用奠定了可靠基础。     

Loop Groups and Twin Buildings

In these notes we describe some buildings related to complex Kac–Moody groups. First we describe the spherical building of SL_n() (i.e. the projective geometry PG(ⁿ)) and its Veronese representation. Next we recall the construction of the affine building associated to a discrete valuation on the rational function field (z). Then we describe the same building in terms of complex Laurent polynomials, and introduce the Veronese representation, which is an equivariant embedding of the building into an affine Kac–Moody algebra. Next, we introduce topological twin buildings. These buildings can be used for a proof which is a variant of the proof by Quillen and Mitchell, of Bott periodicity which uses only topological geometry. At the end we indicate very briefly that the whole process works also for affine real almost split Kac–Moody groups.Supported by a Heisenberg fellowship by the Deutsche Forschungsgemeinschaft.     

Domains of Geometric Partial Attraction of Max-Semistable Laws: Structure, Merge and Almost Sure Limit Theorems

Max-semistable laws arise as non-degenerate weak limits of suitably centered and normed maxima of i.i.d. random variables along subsequences {k(n)} such that k(n+1)/k(n)c1, in which case the common distribution function F of the i.i.d. random variables is said to belong to the domain of geometric partial attraction of the max-semistable law. We give a necessary and sufficient condition for F to belong to the domain of geometric partial attraction of a max-semistable law and investigate the structure of these domains. We show that although weak convergence does not take place along {n}=, the distributions of the maxima merge together along the entire {n} with a suitably chosen family of limiting laws. The use of merge is demonstrated by almost sure limit theorems, which are also valid along the whole {n}.     

On translations of subsets of the real line

In this paper we discuss various questions connected with translations of subsets of the real line. Most of these questions originate from W. Sierpinski. We discuss the number of translations a single subset of the reals may have. Later we discuss almost invariant subsets of Abelian groups.

     

Dynamical Localization II with an Application to the Almost Mathieu Operator

Several recent works have established dynamical localization for Schrödinger operators, starting from control on the localization length of their eigenfunctions, in terms of their centers of localization. We provide an alternative way to obtain dynamical localization, without resorting to such a strong condition on the exponential decay of the eigenfunctions. Furthermore, we illustrate our purpose with the almost Mathieu operator, H _{, ,} =–+ cos(2(+x)), 15 and with good Diophantine properties. More precisely, for almost all , for all q>0, and for all functions ²( ) of compact support, we show that The proof applies equally well to discrete and continuous random Hamiltonians. In all cases, it uses as input a repulsion principle of singular boxes, supplied in the random case by the multi-scale analysis.     

Weak Copositive and Intertwining Approximation

It is known that shape preserving approximation has lower rates than unconstrained approximation. This is especially true for copositive and intertwining approximations. ForfL_p, 1p<∞, the former only has rateω(f, n⁻¹)_p, and the latter cannot even be bounded byC f_p. In this paper, we discuss various ways to relax the restrictions in these approximations and conclude that the most sensible way is the so-calledalmostcopositive/intertwining approximation in which one relaxes the restriction on the approximants in a neighborhood of radiusΔ_n(y_j) of each sign changey_j.     

Almost sure quasilocality fails for the random-cluster model on a tree

We study the random-cluster model on a homogeneous tree, and show that the following three conditions are equivalent for a random-cluster measure: quasilocality, almost sure quasilocality, and the almost sure nonexistence of infinite clusters. As a consequence of this, we find that the plus measure for the Ising model on a tree at sufficiently low temperatures can be mapped, via a local stochastic transformation, into a measure which fails to be almost surely quasilocal.