Laurent多项式代数C[x_1~(±1),x_2~(±1)]上的李三系

设A为交换变元x_1,x_2的罗朗多项式代数,记A的导子代数Der A为M.本文确定了A,M的对合自同构.利用M的对合自同构给出了一类无限维单李三系,并且通过讨论M的自同构与对合自同构的关系,确定这些单李三系的自同构.     

The Classification of Leonard Triples of Bannai/Ito Type with Even Diameters

Let 𝕂 denote an algebraically closed field of characteristic zero. Let V denote a vector space over 𝕂 with finite positive dimension. By a Leonard triple on V, we mean an ordered triple of linear transformations A, A*, A ^? in End(V) such that for each B ∈ {A, A*, A ^?} there exists a basis for V with respect to which the matrix representing B is diagonal and the matrices representing the other two linear transformations are irreducible tridiagonal. The diameter of the Leonard triple (A, A*, A ^?) is defined to be one less than the dimension of V. In this paper we define a family of Leonard triples said to be Bannai/Ito type and classify these Leonard triples with even diameters up to isomorphism. Moreover, we show that each of them satisfies the ?₃-symmetric Askey–Wilson relations.     

On bipartite graphs with minimal energy

The energy of a graph is the sum of the absolute values of the eigenvalues of the graph. In a paper [G. Caporossi, D. Cvetkovi, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs. 2. Finding graphs with external energy, J. Chem. Inf. Comput. Sci. 39 (1999) 984-996] Caporossi et al. conjectured that among all connected graphs G with n≥6 vertices and n−1≤m≤2(n−2) edges, the graphs with minimum energy are the star S_n with m−n+1 additional edges all connected to the same vertices for m≤n+⌊(n−7)/2⌋, and the bipartite graph with two vertices on one side, one of which is connected to all vertices on the other side, otherwise. The conjecture is proved to be true for m=n−1,2(n−2) in the same paper by Caporossi et al. themselves, and for m=n by Hou in [Y. Hou, Unicyclic graphs with minimal energy, J. Math. Chem. 29 (2001) 163-168]. In this paper, we give a complete solution for the second part of the conjecture on bipartite graphs. Moreover, we determine the graph with the second-minimal energy in all connected bipartite graphs with n vertices and edges.     

On the minimal energy ordering of trees with perfect matchings

The energy of a graph is defined as the sum of the absolute values of all eigenvalues of the adjacency matrix of the graph. Zhang and Li [F. Zhang, H. Li, On acyclic conjugated molecules with minimal energies, Discrete Appl. Math. 92 (1999) 71–84] determined the first two smallest-energy trees of a fixed size with a perfect matching and showed that the third minimal energy is between two trees. This paper characterizes trees of a fixed size with a perfect matching with third minimal, fourth minimal and fifth minimal energies for n≥86 and third minimal, fourth minimal energies for 14≤n≤84.     

Steiner triple systems with two disjoint subsystems

It is shown that there exists a triangle decomposition of the graph obtained from the complete graph of order v by removing the edges of two vertex disjoint complete subgraphs of orders u and w if and only if u,w, and v are odd, (mod 3), and . Such decompositions are equivalent to group divisible designs with block size 3, one group of size u, one group of size w, and v – u – w groups of size 1. This result settles the existence problem for Steiner triple systems having two disjoint specified subsystems, thereby generalizing the well‐known theorem of Doyen and Wilson on the existence of Steiner triple systems with a single specified subsystem. © 2005 Wiley Periodicals, Inc. J Combin Designs     

Large sets of extended directed triple systems with odd orders

For three types of triples, unordered, cyclic and transitive, the corresponding extended triple, extended triple system and their large set are introduced. The spectrum of LEDTS(v) for even v has been given in our paper (Liu and Kang (2009) [9]). In this paper, we shall discuss the existence problem of LEDTS(v) for odd v and give the almost complete conclusion: there exists an LEDTS(v) for any positive integer v≠4 except possible v=95,143,167,203,215.     

Kirkman triple systems of order 21 with nontrivial automorphism group

There are 50,024 Kirkman triple systems of order 21 admitting an automorphism of order 2. There are 13,280 Kirkman triple systems of order 21 admitting an automorphism of order 3. Together with the 192 known systems and some simple exchange operations, this leads to a collection of 63,745 nonisomorphic Kirkman triple systems of order 21. This includes all KTS(21)s having a nontrivial automorphism group. None of these is doubly resolvable. Four are quadrilateral-free, providing the first examples of such a KTS(21).

     

Perfect dexagon triple systems with given subsystems

The graph consisting of the six triples (or triangles) {a,b,c}, {c,d,e}, {e,f,a}, {x,a,y}, {x,c,z}, {x,e,w}, where a,b,c,d,e,f,x,y,z and w are distinct, is called a dexagon triple. In this case the six edges {a,c}, {c,e}, {e,a}, {x,a}, {x,c}, and {x,e} form a copy of K₄ and are called the inside edges of the dexagon triple. A dexagon triple system of order v is a pair (X,D), where D is a collection of edge disjoint dexagon triples which partitions the edge set of 3K_v. A dexagon triple system is said to be perfect if the inside copies of K₄ form a block design. In this note, we investigate the existence of a dexagon triple system with a subsystem. We show that the necessary conditions for the existence of a dexagon triple system of order v with a sub-dexagon triple system of order u are also sufficient.     

Anti‐Pasch optimal packings with triples

It is shown that for , there exists an optimal packing with triples on points that contains no Pasch configurations. Furthermore, for all (mod 6), there exists a pairwise balanced design of order , whose blocks are all triples apart from a single quintuple, and that has no Pasch configurations amongst its triples.     

More large sets of resolvable MTS and DTS with even orders

In this paper, we first introduce a special structure that allows us to construct a large set of resolvable Mendelsohn triple systems of orders 2q ＋ 2, or LRMTS（2q ＋ 2）, where q = 6t ＋ 5 is a prime power. Using a computer, we find examples of such structure for t C T = {0, 1, 2, 3, 4, 6, 7, 8, 9, 14, 16, 18, 20, 22, 24}. Furthermore, by a method we introduced in [13], large set of resolvable directed triple systems with the same orders are obtained too. Finally, by the tripling construction and product construction for LRMTS and LRDTS introduced in [2, 20, 21], and by the new results for LR-design in [8], we obtain the existence for LRMTS（v）and LRDTS（v）, where v = 12（t ＋ 1） mi≥0（2.7mi＋1）mi≥0（2.13ni＋1）and t∈T,which provides more infinite family for LRMTS and LRDTS of even orders.     

Groups associated with minimal flows

Let S be topological semigroup, we consider an appropriate semigroup compactification of S. In this paper we study the connection between subgroups of a maximal group in a minimal left ideal of , which arise as equivalence classes of some closed left congruence, and the minimal ow characterized by the left congruence. A particular topology is defined on a maximal group and it is shown that a closed subgroup under this topology is precisely the intersection of an equivalence class with the maximal group for some left congruence on .     

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.     

组大小为10的广义Steiner三元系

广义Steiner三元系GS(2,3,n,g)等价于g+1元最优常重量码(n,3,3)。本文证明了GS(2,3,n,10)存在的必要条件n≡0,1(mod3),n≥12也是充分的。     

Pasch trades with a negative block

A Steiner triple system of order v, STS(v), may be called equivalent to another STS(v) if one can be converted to the other by a sequence of three simple operations involving Pasch trades with a single negative block. It is conjectured that any two STS(v)s on the same base set are equivalent in this sense. We prove that the equivalence class containing a given system S on a base set V contains all the systems that can be obtained from S by any sequence of well over one hundred distinct trades, and that this equivalence class contains all isomorphic copies of S on V. We also show that there are trades which cannot be effected by means of Pasch trades with a single negative block.     

Steiner triple systems with disjoint or intersecting subsystems

The existence of incomplete Steiner triple systems of order υ having holes of orders w and u meeting in z elements is examined, with emphasis on the disjoint (z = 0) and intersecting (z = 1) cases. When and , the elementary necessary conditions are shown to be sufficient for all values of z. Then for and υ “near” the minimum of , the conditions are again shown to be sufficient. Consequences for larger orders are also discussed, in particular the proof that when one hole is at least three times as large as the other, the conditions are again sufficient. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 58–77, 2000