An Analogue of Distributivity for Ungraded Lattices

In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim.     

左消半群M与幂单半群B的Schǔzenberger积

本文讨论了每个元都有幂等元作为右单位元的左消半群与幂单半群N的Schuzenberger积M◇N的ρ类，证明了这种半群M与N的Schuzenberger积M◇N的ρ类是右E一半适合半群和弱E-headged半群．     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

Dubrovin赋值斜群环

本文中对一个斜群环为Dubrovin赋值环给出了一系列等价刻画,并且刻画了一个Dubrovin赋值斜群环的所有素理想.     

Left, right, and inner socles of associative systems

We investigate the basic properties of the different socles that can be considered in not necessarily semiprime associative systems. Among other things, we show that the socle defined as the sum of minimal (or minimal and trivial) inner ideals is always an ideal. When trivial inner ideals are included, this inner socle contains the socles defined in terms of minimal left or right ideals. This revised version was published online in June 2006 with corrections to the Cover Date.     

环的根性质

研究的对象是不含单位元分次环 R,首先证明了有关 Jacobson根的重要性质 J( R) =J( S)∩ R,其中 S =R× Z.然后利用它得到了一些好的性质     

Skew Models II

If g and G are the pdf and the cdf of a distribution symmetric around 0 then the pdf 2g(u)G(λ u) is said to define a skew distribution. In this paper, we provide a mathematical treatment of the skew distributions when g and G are taken to come from one of Pearson type II, Pearson type VII or the generalized t distribution.      

A family of skew Hadamard difference sets

In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics.     

Ergodic theory of amenable semigroup actions

In this paper, among other things, we state and prove the mean ergodic theorem for amenable semigroup algebras.     

Operator Semigroup Compactifications

A weakly continuous, equicontinuous representation of a semitopological semigroup on a locally convex topological vector space gives rise to a family of operator semigroup compactifications of , one for each invariant subspace of . We consider those invariant subspaces which are maximal with respect to the associated compactification possessing a given property of semigroup compactifications and show that under suitable hypotheses this maximality is preserved under the formation of projective limits, strict inductive limits and tensor products.