Centralizer algebras of the group associated to Z4-codes

The purpose of this paper is to investigate the finite group which appears in the study of the Type II ${\mathbb{Z}}_4$-codes. To be precise, it is characterized in terms of generators and relations, and we determine the structure of the centralizer algebras of the tensor representations of this group.     

A note on transitivity,sensitivity and chaos for graph maps

Two elementary proofs showing that (i) transitivity and sensitivity imply dense periodicity for maps on topological graphs and (ii) total transitivity and dense periodicity imply mixing for maps on spaces with an open subset homeomorphic with the open interval (0,1) are presented. As corollaries, one gets new and simple proofs that Auslander–Yorke chaos implies Devaney chaos, and weak mixing implies mixing for graph maps.     

λ型传递矩阵与多因素模糊决策

基于已知常用的模糊矩阵传递性概念定义了λ型传递。给出了它的几个等价条件。研究它的图论特征，指出λ型传递矩阵的圈都过强对边二元圈。随后证明了与全传递模糊矩阵的等价性。进一步研究与截矩阵的性质一致问题，证明了λ型传递满足一致性。最后给出λ型传递在模糊排充中的应用，表明它是一种新的实用的多因素模糊决策的数学模型。     

Existence of a dense orbit and topological transitivity: When are they equivalent?

Topological transitivity and existence of a dense orbit are two notions which play an important role in every definition of chaos [2], [4]. Unfortunately, in the literature there are often misunderstandings (or even false statements) about their relationship. In this note we show that generally neither condition implies the other and then we give two propositions (Propositions1 and 2) for implication in either direction. This revised version was published online in June 2006 with corrections to the Cover Date.     

Analytic proof systems for λ-calculus: the elimination of transitivity, and why it matters

We introduce new proof systems G[β] and G _ext[β], which are equivalent to the standard equational calculi of λβ- and λβη- conversion, and which may be qualified as ‘analytic’ because it is possible to establish, by purely proof-theoretical methods, that in both of them the transitivity rule admits effective elimination. This key feature, besides its intrinsic conceptual significance, turns out to provide a common logical background to new and comparatively simple demonstrations—rooted in nice proof-theoretical properties of transitivity-free derivations—of a number of well-known and central results concerning β- and βη-reduction. The latter include the Church–Rosser theorem for both reductions, the Standardization theorem for β- reduction, as well as the Normalization (Leftmost reduction) theorem and the Postponement of η-reduction theorem for βη-reduction      

Levi and Malcev Theorems for Finite-Dimensional Algebras from the Variety Defined by the Identities x2 =J(x,y, zu) =0

We study the variety of binary Lie algebras defined by the identities x2 =J(x,y,zu) =0,where J(a,b,c) denotes the Jacobian of a,b,c.Building on previous work by Carrillo,Rasskazova,Sabinina and Grishkov,in the present article it is shown that the Levi and Malcev theorems hold for this variety of algebras.     

A generalized quadrangle of order (s, t) with center of transitivity is an elation quadrangle if s ≤ t

We show that a generalized quadrangle of order (s, t) with a center of transitivity is an elation generalized quadrangle if s ≤ t. In order to obtain this result, we generalize Frohardt’s result on Kantor’s conjecture from elation quadrangles to the more general case of quadrangles with a center of transitivity.      

图表追踪的一种机器实现方法

交换图表追踪法是同调代数中一种重要的证明方法.本文提出了一种基于前推的交换图表追踪的机器实现方法,它可以证明同调代数中一系列基于交换图的定理.该方法从定理的结论出发,通过构造辅助元素以及对辅助元素进行推导,能在有限步内给出定理的证明.本文提出的前推方法已经在Java开发平台上实现,同调代数中的五引理、九引理、蛇引理等的证明都可以由我们的程序自动产生.     

Analytic combinatory calculi and the elimination of transitivity

We introduce, in a general setting, an analytic version of standard equational calculi of combinatory logic. Analyticity lies on the one side in the fact that these calculi are characterized by the presence of combinatory introduction rules in place of combinatory axioms, and on the other side in that the transitivity rule proves to be eliminable. Apart from consistency, which follows immediately, we discuss other almost direct consequences of analyticity and the main transitivity elimination theorem; in particular the Church–Rosser and the leftmostreduction theorems for the associated notions of reduction. The last two sections deal with analytic combinatory calculi with the extensionality rule added. Here, as far as the elimination of transitivity is concerned, we have only partial results, which unfortunately do not cover, at present, full CL + Ext. Yet, they are sufficient to prove the decidability of weaker combinatory calculi with extensionality, including e.g. BCK + Ext.Mathematics Subject Classification (2000):03B40, 03F03, 03F07     

Coarse topological transitivity on open cones and coarsely J-class and D-class operators

We generalize the concept of coarse hypercyclicity, introduced by Feldman in [13], to that of coarse topological transitivity on open cones. We show that a bounded linear operator acting on an infinite dimensional Banach space with a coarsely dense orbit on an open cone is hypercyclic and a coarsely topologically transitive (mixing) operator on an open cone is topologically transitive (mixing resp.). We also “localize” these concepts by introducing two new classes of operators called coarsely J-class and coarsely D  -class operators and we establish some results that may make these classes of operators potentially interesting for further studying. Namely, we show that if a backward unilateral weighted shift on l²(N)$l^2(\mathbb{N})$ is coarsely J-class (or D  -class) on an open cone then it is hypercyclic. Then we give an example of a bilateral weighted shift on l^∞(Z)$l^{\infty }(\mathbb{Z})$ which is coarsely J-class, hence it is coarsely D-class, and not J  -class. Note that, concerning the previous result, it is well known that the space l^∞(Z)$l^{\infty }(\mathbb{Z})$ does not support J-class bilateral weighted shifts, see [10]. Finally, we show that there exists a non-separable Banach space which supports no coarsely D-class operators on open cones. Some open problems are added.     

Lagrange multipliers theorem and saddle point optimality criteria in mathematical programming

We prove a version of Lagrange multipliers theorem for nonsmooth functionals defined on normed spaces. Applying these results, we extend some results about saddle point optimality criteria in mathematical programming.     

Clifford 代数,几何计算和几何推理

Clifford代数是一种深深根植于几何学之中的代数系统,被它的创始人称为几何代数．历史上,E．Cartan,R．Brauer,H．Weyl,C．Chevalley等数学大师都曾研究和应用过Clifford代数,对它的发展起了重要作用．近年来,Clifford代数在微分几何、理论物理、经典分析等方面取得了辉煌的成就,是现代理论数学和物理的一个核心工具,并在现代科技的各个领域,如机器人学、信号处理、计算机视觉、计算生物学、量子计算等方面有广泛的应用．本文主要介绍Clifford代数在几何计算和几何推理中的应用．作为一种优秀的描述和计算几何问题的代数语言,Clifford代数对于几何体,几何关系和几何变换有不依赖于坐标的、易于计算的多种表示,因而应用它进行几何自动推理,不仅使困难定理的证明往往变得极为简单,而且能够解决一些著名的公开问题,目前在国际上,几何自动推理已经成为Clifford代数的一个重要应用领域。     

On the Stone and Bishop appoximation theorems

Generalizations of the Stone-Weierstrass and Bishop approximation theorems are presented. Given an algebra, a subspace in a continuous function space coinciding with the closure of this algebra is constructed. Analogs of these results are obtained in the case where the set of functions under consideration is not an algebra, but its closure is related to some algebra.     

On generalizing transitivity, persistence, and sensitivity

A subgroup property $\alpha $ is transitive in a group $G$ if $U \alpha V$ and $V \alpha G$ imply that $U \alpha G$ whenever $U \le V \le G$ , and $\alpha $ is persistent in $G$ if $U \alpha G$ implies that $U \alpha V$ whenever $U \le V \le G$ . Even though a subgroup property $\alpha $ may be neither transitive nor persistent, a given subgroup $U$ may have the property that each $\alpha $ -subgroup of $U$ is an $\alpha $ -subgroup of $G$ , or that each $\alpha $ -subgroup of $G$ in $U$ is an $\alpha $ -subgroup of $U$ . We call these subgroup properties $\alpha $ -transitivity and $\alpha $ -persistence, respectively. We introduce and develop the notions of $\alpha $ -transitivity and $\alpha $ -persistence, and we establish how the former property is related to $\alpha $ -sensitivity. In order to demonstrate how these concepts can be used, we apply the results to the cases in which $\alpha $ is replaced with “normal” and the “cover-avoidance property.” We also suggest ways in which the theory can be developed further.     

Inductions and restrictions on towers of cellularly stratified diagram algebras

Hartmann et al. defined the concept of cellularly stratified algebras that combine the features of both cellular algebras and stratified algebras. Many important diagram algebras in mathematics and physics, such as some Brauer, partition and BMW algebras, are cellularly stratified algebras, and each of these forms a tower of algebras. This article gives the concept of towers of cellularly stratified algebras in an axiomatic manner, and studies it in terms of induction and restriction functors. In particular, for certain towers of cellularly stratified algebras, we provide a criterion for semi-simplicity by using the cohomology groups of cell modules.     

sl(2,F)PBW定理的另一种证明

设F是任意域,L是F上任意一个李代数,文献[1]给出了关于L的PBW定理及证明.本文对L=sl(2,F)我们给出了PBW定理的另一种证明方法.     

Tournaments,transitivity and pairwise comparison matrices

When attempting to rank a number of items by pairwise comparisons, one is usually advised to guard against generating a preference structure that contains three-way intransitive relationships (three-way cycles; cyclic triads) such as A is preferred to B, B is preferred to C, and C is preferred to A. Some decision procedures, like the Analytic Hierarchy Process, do not rule out intransitivities, while others, like utility theory, have axioms that strictly forbid them. It is generally agreed that intransitivities can occur, especially when the number of items being compared under a multicriteria framework gets to be greater than five. It is also generally agreed that, if intransitivities are found, they should be analysed and changed, if deemed appropriate. That is, there is no inherent rule that says a set of comparisons should not contain any intransitivities, but they should be made explicit. In this paper, we show, using results from tournaments and graph theory, how one can readily determine the number of three-way cycles that exist within a pairwise comparison matrix, and, using standard linear programming procedures, how to find them.     

Convergences in JW-algebras and in their enveloping von Neumann algebras

We study properties of different convergences in JW-algebras with a faithful normal state. The relationship between these convergences and similar convergences in enveloping von Neumann algebras is established. Based on this, ergodic theorems are proved.     

On weakening the Deduction Theorem and strengthening Modus Ponens

This paper studies, with techniques of Abstract Algebraic Logic, the effects of putting a bound on the cardinality of the set of side formulas in the Deduction Theorem, viewed as a Gentzen‐style rule, and of adding additional assumptions inside the formulas present in Modus Ponens, viewed as a Hilbert‐style rule. As a result, a denumerable collection of new Gentzen systems and two new sentential logics have been isolated. These logics are weaker than the positive implicative logic. We have determined their algebraic models and the relationships between them, and have classified them according to several standard criteria of Abstract Algebraic Logic. One of the logics is protoalgebraic but neither equivalential nor weakly algebraizable, a rare situation where very few natural examples were hitherto known. In passing we have found new, alternative presentations of positive implicative logic, both in Hilbert style and in Gentzen style, and have characterized it in terms of the restricted Deduction Theorem: it is the weakest logic satisfying Modus Ponens and the Deduction Theorem restricted to at most 2 side formulas. The algebraic part of the work has lead to the class of quasi‐Hilbert algebras, a quasi‐variety of implicative algebras introduced by Pla and Verdú in 1980, which is larger than the variety of Hilbert algebras. Its algebraic properties reflect those of the corresponding logics and Gentzen systems. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)