Properties of Quantum Languages

The class of quantum languages Q() over an alphabet is the class of languages accepted by quantum automata. We study properties of Q() and compare Q() with the class of regular languages R(). It is shown that Q() is closed under union, intersection, and reversal but is not closed under complementation, concatenation, or Kleene star. It is also shown that Q() and R() are incomparable. Finally, we prove that L Q() if and only if L admits a transition amplitude function satisfying a certain property and a similar characterization is given for R().     

Conservative Means of Orthogonal Series and the Spaces $$L^p [0;1] $$ , $$p \in (1;\infty ) $$

Necessary and sufficient conditions for an orthogonal series to be the Fourier series of a function in the space , , are obtained. In the special case of regular summation methods we recover the classical results of Orlicz and Lomnicki.     

Fuzzy半群中的极小Fuzzy理想

本文先给出Ｆｕｚｙ半群中极小Ｆｕｚｙ理想的一些代数性质,进而利用极小Ｆｕｚｙ理想刻划Ｆｕｚｚｙ单半群的一些代数性质     

Gaussian estimates and regularized groups

We show that if a bounded analytic semigroup on satisfies a Gaussian estimate of order and is the generator of its consistent semigroup on , then generates a -regularized group on where . We obtain the estimate of () and the -independence of , and give applications to Schrödinger operators and elliptic operators of higher order.

     

A uniform refinement property for congruence lattices

The Congruence Lattice Problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of a lattice. It was hoped that a positive solution would follow from E. T. Schmidt's construction or from the approach of P. Pudlák, M. Tischendorf, and J. Tuma. In a previous paper, we constructed a distributive algebraic lattice with compact elements that cannot be obtained by Schmidt's construction. In this paper, we show that the same lattice cannot be obtained using the Pudlák, Tischendorf, Tuma approach.

The basic idea is that every congruence lattice arising from either method satisfies the Uniform Refinement Property, that is not satisfied by our example. This yields, in turn, corresponding negative results about congruence lattices of sectionally complemented lattices and two-sided ideals of von Neumann regular rings.

     

A Basis for the Top Homology of a Generalized Partition Lattice

For a fixed positive integer k, consider the collection of all affine hyperplanes in n-space given by xi – xj = m, where i, j [n], i j, and m {0, 1,..., k}. Let Ln,k be the set of all nonempty affine subspaces (including the empty space) which can be obtained by intersecting some subset of these affine hyperplanes. Now give Ln,k a lattice structure by ordering its elements by reverse inclusion. The symmetric group Gn acts naturally on Ln,k by permuting the coordinates of the space, and this action extends to an action on the top homology of Ln,k. It is easy to show by computing the character of this action that the top homology is isomorphic as an Gn-module to a direct sum of copies of the regular representation, CGn. In this paper, we construct an explicit basis for the top homology of Ln,k, where the basis elements are indexed by all labelled, rooted, (k + 1)-ary trees on n-vertices in which the root has no 0-child. This construction gives an explicit Gn-equivariant isomorphism between the top homology of Ln,k and a direct sum of copies of CGn.     

一类格序半群的同余

本文讨论了一类可换格序半群的同余性质。给出了这类格序半群同余的表示和同态分解定理。这个结论一般化了［１］和［２］中的结果。     

包络半群与拓扑动力学中的接近关系

运用包络半群的理论，对接近关系中一个重要定理给出了一个简单证明．作为这一定理的应用，我们得到接近关系可乘性的一个结果．并且对另一种接近关系，也得到一个结果．这两个定理减弱了Ｃｌａｙ在这一领域中两个定理的条件．     

紧拓扑半群上概率测度卷积序列的极限性质

本文讨论紧拓扑半群上概率测度卷积序列的若干重要极限性质．在第１节中，我们讨论测度集的代数结构与其支撑集代数结构的关系．第２节的定理１，通过支撑集的代数结构给出组合收敛测度序列的一个极限定理．在定理２中我们讨论独立同分布时的情形，建立了一类紧半群上的Ｋａｗａｄａ－Ｉｔ型结果．这些定理推广了紧群、紧交换半群、紧Ｌ－Ｘ半群上一些相应的结论．     

一类Schrodinger方程的周期解和谱方法

本文利用半群理论讨论了一类非线性非自共轭Ｓｃｈｒｏｄｉｎｇｅｒ方程周期初边值解的存在唯一性，以及它的Ｆｏｕｒｉｅｒ谱方法的可解性，稳定性和收敛性