Counting Cocomponents of a Topological Space

Dualizing the statement about a number of components of a topological space X, we say that, for a natural number n, the space X has at most n cocomponents if every continuous map f:X ⁿ⁺¹X factorizes through X ⁿ , i.e., f depends on at most n coordinates. We construct metrizable spaces X ₁,X ₂,X ₃ such that(1) X ₁ does not have finitely many cocomponents but every continuous map X ₁ X ₁ depends only on finitely many coordinates;(2) X ₂=A×B for rigid spaces A,B and there is a continuous map X ₂ X ₂ depending on all coordinates;(3) X ₃(n) has precisely n cocomponents but it cannot be expressed as A×B with |A|>1 and |B|>1.     

Clone Segments of the Tychonoff Modification of Space

For every natural number n > 1, we construct a topological space X such that the clone segments of its Tychonoff modification T M X verify Clo _k (X) = Clo _k (T M X) if k < n and Clo _n (X) is not isomorphic to Clo _n (T M X).     

Graphs and ranks of monoids

For a finite monoid S, let ν(S) (ν_d(S)) denote the least number n such that there exists a graph (directed graph) Γ of order n with End(Γ)?S. Also let rank(S) be the smallest number of elements required to generate S. In this paper, we use Cayley digraphs of monoids, to connect lower bounds of ν(S) (ν_d(S)) to the lower bounds of rank(S). On the other hand, we connect upper bounds of rank(S) to upper bounds of ν(S) (ν_d(S)).     

Selections and their absolutely continuous invariant measures

Let I=[0,1]$I=[0,1]$ and let P be a partition of I   into a finite number of intervals. Let _τ1${\tau }_1$, _τ2${\tau }_2$; I→I$I\to I$ be two piecewise expanding maps on P  . Let G⊂I×I$G\subset I\times I$ be the region between the boundaries of the graphs of _τ1${\tau }_1$ and _τ2${\tau }_2$. Any map τ:I→I$\tau :I\to I$ that takes values in G is called a selection of the multivalued map defined by G  . There are many results devoted to the study of the existence of selections with specified topological properties. However, there are no results concerning the existence of selection with measure-theoretic properties. In this paper we prove the existence of selections which have absolutely continuous invariant measures (acim). By our assumptions we know that _τ1${\tau }_1$ and _τ2${\tau }_2$ possess acims preserving the distribution functions F⁽¹⁾$F^{(1)}$ and F⁽²⁾$F^{(2)}$. The main result shows that for any convex combination F   of F⁽¹⁾$F^{(1)}$ and F⁽²⁾$F^{(2)}$ we can find a map η   with values between the graphs of _τ1${\tau }_1$ and _τ2${\tau }_2$ (that is, a selection) such that F is the η-invariant distribution function. Examples are presented. We also study the relationship of the dynamics of our multivalued maps to random maps.     

Adjoining an Order Unit to a Matrix Ordered Space

We prove that an order unit can be adjoined to every L ^∞-matricially Riesz normed space. We introduce a notion of strong subspaces. The matrix order unit space obtained by adjoining an order unit to an L ^∞-matrically Riesz normed space is unique in the sense that the former is a strong L ^∞-matricially Riesz normed ideal of the later with codimension one. As an application of this result we extend Arveson’s extension theorem to L ^∞-matircially Riesz normed spaces. As another application of the above adjoining we generalize Wittstock’s decomposition of completely bounded maps into completely positive maps on C ^*-algebras to L ^∞-matricially Riesz normed spaces. We obtain sharper results in the case of approximate matrix order unit spaces. Mathematics Subject Classification (2000). Primary 46L07     

Maltsev conditions and relations on algebras

We show that every sentence preserved by products in a purely relational first order language corresponds to a Maltsev condition on subalgebras of direct powers. Moreover, we establish that this correspondence captures all strong Maltsev conditions whose defining equations do not involve compositions. We then demonstrate how a broader version of the correspondence is sufficient to capture all Maltsev conditions when we restrict our attention to locally finite varieties. Received November 6, 1998; accepted in final form July 8, 1999.     

Partitions of finite vector spaces into subspaces

Let V_n(q) denote a vector space of dimension n over the field with q elements. A set of subspaces of V_n(q) is a partition of V_n(q) if every nonzero element of V_n(q) is contained in exactly one element of . Suppose there exists a partition of V_n(q) into x_i subspaces of dimension n_i, 1 ≤ i ≤ k. Then x₁, …, x_k satisfy the Diophantine equation . However, not every solution of the Diophantine equation corresponds to a partition of V_n(q). In this article, we show that there exists a partition of V_n(2) into x subspaces of dimension 3 and y subspaces of dimension 2 if and only if 7x + 3y = 2ⁿ ? 1 and y ≠ 1. In doing so, we introduce techniques useful in constructing further partitions. We also show that partitions of V_n(q) induce uniformly resolvable designs on qⁿ points. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 329–341, 2008     

Second-Order Efficient Test for Inhomogeneous Poisson Processes

We observe a realization X ⁽ⁿ⁾ of a Poisson process on the set with intensity function depending on the unknown real parameter . Based on X ⁽ⁿ⁾ we test simple null hypothesis against one sided alternative for given . We improve the level of the well-known locally asymptotically uniformly most powerful (LAUMP) test by using the Edgeworth type expansion for stochastic integral. We show that the improved test is second-order efficient under certain regularity conditions.      

保持算子乘积投影的线性映射

设B(H)是复Hilbert空间H上的有界线性算子全体且dim H≥2.本文证明了B(H)上的线性满射φ保持两个算子乘积非零投影性的充分必要条件是存在B(H)中的酉算子U以及复常数λ满足λ~2=1,使得φ(X)=λU~*XU,(?)X∈B(H).同时也得到了线性映射保持两个算子Jordan三乘积非零投影的充分必要条件.     

Strongly amenable semigroups and nonlinear fixed point properties

A semi-topological semigroup is strongly left amenable if there is a compact left ideal group in the spectrum of its LUC-compactification. In this paper, we want to study those objects, and study some fixed point property related to non-expansive mapping and other similar kind of mapping.     

Musielak-Orlicz-Sobolev空间中的序连续性质和最佳逼近算子的连续性质

借鉴Orlicz-Sobolev空间中的受控最佳逼近算子问题的研究结果,抓住Musielak-Orlicz-Sobolev空间的构成特点,利用△_2条件及其否定,给出了MusielakOrlicz-Sobolev空间具有序连续性的充要条件,同时研究了该空间中最佳逼近算子的连续性.     

A correspondence between a class of monoids and self-similar group actions I

We describe a correspondence between a class of left cancellative monoids and self-similar group actions in the sense of Nekrashevych et al. This correspondence originated in Perrot’s 1972 thesis, and developed the ideas to be found in Rees’ 1948 paper.     

Attainable densities for random maps

We consider a random map T=T(Γ,ω), where Γ=(τ₁,τ₂,…,τK) is a collection of maps of an interval and ω=(p₁,p₂,…,pK) is a collection of the corresponding position dependent probabilities, that is, pk(x)?0 for k=1,2,…,K and . At each step, the random map T moves the point x to τk(x) with probability pk(x). For a fixed collection of maps Γ, T can have many different invariant probability density functions, depending on the choice of the (weighting) probabilities ω. Most of the results in this paper concern random maps where Γ is a family of piecewise linear semi-Markov maps. We investigate properties of the set of invariant probability density functions of T that are attainable by allowing the probabilities in ω to vary in a certain class of functions. We prove that the set of all attainable densities can be determined algorithmically. We also study the duality between random maps generated by transformations and random maps constructed from a collection of their inverse branches. Such representation may be of greater interest in view of new methods of computing entropy [W. S?omczyński, J. Kwapień, K. ?yczkowski, Entropy computing via integration over fractal measures, Chaos 10 (2000) 180-188].     

Elementary Properties of Cycle-free Partial Orders and their Automorphism Groups

A classification was given by Creed, Truss, and Warren of all the countable k-CS-transitive cycle-free partial orders for k3. Here the elementary theories of these structures and their automorphism groups are examined, and it is shown that in many cases we can distinguish the structures or their groups by means of their first- or second-order properties. The small index property is established for weakly 2-transitive trees, and for several classes of cycle-free partial orders.     

Existence and nonexistence of hypercyclic semigroups

In these notes we provide a new proof of the existence of a hypercyclic uniformly continuous semigroup of operators on any separable infinite-dimensional Banach space that is very different from--and considerably shorter than--the one recently given by Bermúdez, Bonilla and Martinón. We also show the existence of a strongly dense family of topologically mixing operators on every separable infinite-dimensional Fréchet space. This complements recent results due to Bès and Chan. Moreover, we discuss the Hypercyclicity Criterion for semigroups and we give an example of a separable infinite-dimensional locally convex space which supports no supercyclic strongly continuous semigroup of operators.

     

某些Banach空间的有限阶光滑点和强光滑点（英）

本文给出l_∞(X)以及L(l₁(X),Y),L(X,l_∞(Y))和L(X,c₀(Y))的单位球的有限阶光滑点和强光滑点的充要条件，这里X和Y都是任意的Banach空间.特别地，本文给出这些空间的单位球的光滑点和强光滑点的充要条件.     

选择理论中两个结论的改进

本文利用可数序基的概念，讨论了下半连续集值映射的选择问题，改进了选择理论中的两个经典结论．     

First order limits of sparse graphs: Plane trees and path‐width

Ne?et?il and Ossona de Mendez introduced the notion of first order convergence as an attempt to unify the notions of convergence for sparse and dense graphs. It is known that there exist first order convergent sequences of graphs with no limit modeling (an analytic representation of the limit). On the positive side, every first order convergent sequence of trees or graphs with no long path (graphs with bounded tree‐depth) has a limit modeling. We strengthen these results by showing that every first order convergent sequence of plane trees (trees with embeddings in the plane) and every first order convergent sequence of graphs with bounded path‐width has a limit modeling. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 50, 612–635, 2017     

关于有限域F_q上矩阵阶的研究

详细地研究了有限域 Fq上的矩阵的阶的问题 ,得到了相当理想的结果 .并给出一类矩阵方幂的极小多项式的求法