幂零拟群的直觉模糊理想

引入幂零拟群的直觉模糊理想的概念，得到一些结论。     

幂等矩阵的性质及其推广

首先对幂等矩阵的简单性质进行了归纳总结,接着论证了幂等矩阵的等价条件及其特征值的取值范围,并讨论了幂等矩阵与实对称矩阵的关系、幂等矩阵与其伴随矩阵的特征值和特征向量的对应关系及幂等矩阵在群逆中的一个性质.最后讨论了幂等矩阵的两种分解形式.     

三幂等矩阵的一些性质

重点探索了三幂等矩阵的性质.主要从矩阵乘积、线性变换和矩阵的秩等角度出发,将幂等矩阵的性质向三幂等矩阵推广,对三幂等矩阵的性质进行探究,得到了15个相关结论,并给出部分性质的详细推导过程.     

两个幂等矩阵的组合的群逆

本文研究了当P与Q是两个复数域上的n阶幂等矩阵且满足PQP=PQ时,组合aP+bQ+cP Q+dQP+eQP Q的群逆问题,利用矩阵的分块及群逆的性质,证明了它是群逆阵,并且给出了其群逆的表达式,其中ab=0,a,b,c,d,e为复数.     

幂等算子线性组合的幂等性

设P与Q是Hilbert空间中的两个不同的幂等算子.本文主要刻画了幂等算子P与Q的线性组合仍是幂等算子的充要条件,从而推广了Baksalary与Baksalary (2000)的结论.值得指出的是,我们通过严密的推理发现,其定理的条件P_1P_2≠P_2P_1是非必要的.     

带共轭性质拟群的计数

由-个拟群(Q,(×))可以定义出6个共轭拟群,这6个共轭拟群不一定互不相同,其构成的集合C(Q,(×))的基数t可能的取值是1,2,3或6.记q(n,t)是所有满足|C(Q,(×))|=t的n阶拟群的个数,本文将给出q(n,2)和q(n,6)的计数问题.     

具有弱中间幂等元的正则半群

本文在正则半群上引入弱中间幂等元和拟中间幂等元,着重探讨了这两类幂等元的性质特征.构造了若干具有弱(拟)中间幂等元的正则半群,确定了弱中间幂等元和拟中间幂等元之间的关系,给出了弱中间幂等元和拟中间幂等元各自的等价判定,利用拟中间幂等元刻画了纯正半群.最后,得到了构造具有拟中间幂等元的正则半群的一般途径,并在此基础上进一步给出了判定正则半群是否具有乘逆断面的方法.     

拟-*-A类算子的Riesz幂等元

证明了若T是拟-*-A类算子且λ_0是σ(T)的孤立点谱,则E是自共轭算子且满足EH=Ker(T-λ_0)=Ker(T-λ_0)~*,其中E是算子T关于λ_0的Riesz幂等元.     

幂等阵和幂零阵的伴随阵的若干性质

本文利用极限过程的方法,证明了幂等阵和幂零阵的伴随矩阵分别是幂等阵和幂零阵．所得到的结论比［１］丰富得多．     

有限群的p-幂零性和极小子群

从有限群构造的角度来看,p-幂零群和p-可分解群很相似,前者是p-群和p'-群的半直积,后者是p-群和P'-群的直积.有限群G的p-可分解剩余是P(G)=∩{H|H(⊿) G,而且G/H是p-可分解}.通过观察p-可分解剩余和极小子群的性质得到了几个关于p-幂零的充要条件.     

The spectrum for large sets of idempotent quasigroups

In this article we construct a large set of idempotent quasigroups of order 14. Combined with the results in Chang, JCMCC; and Teirlinck and Lindner, Eur J Combin 9 (1988), 83–89, this shows that the spectrum for large sets of idempotent quasigroups of order n [briefly, LIQ(n)] is the set all integers n≥ 3 with the exception of n=6. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 79–82, 2000     

Transitive resolvable idempotent quasigroups and large sets of resolvable Mendelsohn triple systems

We first define a transitive resolvable idempotent quasigroup (TRIQ), and show that a TRIQ of order v exists if and only if 3∣v and . Then we use TRIQ to present a tripling construction for large sets of resolvable Mendelsohn triple systems s, which improves an earlier version of tripling construction by Kang. As an application we obtain an for any integer n≥1, which provides an infinite family of even orders.     

An improved product construction for large sets of Kirkman triple systems

It has been shown by Lei, in his recent paper, that there exists a large set of Kirkman triple systems of order uv (LKTS(uv)) if there exist an LKTS(v), a TKTS(v) and an LR(u), where a TKTS(v) is a transitive Kirkman triple system of order v, and an LR(u) is a new kind of design introduced by Lei. In this paper, we improve this product construction by removing the condition “there exists a TKTS(v)”. Our main idea is to use transitive resolvable idempotent symmetric quasigroups instead of TKTS. As an application, we can combine the known results on LKTS and LR-designs to obtain the existence of an LKTS(3ⁿm(2·13^n₁+1)(2·13^n_t+1)) for n1, m{1,5,11,17,25,35,43,67,91,123}{2^2r+125^s+1 : r0,s0}, t0 and n_i1 (i=1,…,t).     

Tripling Construction for Large Sets of Resolvable Directed Triple Systems

In this paper, we first define a doubly transitive resolvable idempotent quasigroup （DTRIQ）, and show that aDTRIQ of order v exists if and only ifv ≡0（mod3） and v ≠ 2（mod4）. Then we use DTRIQ to present a tripling construction for large sets of resolvable directed triple systems, which improves an earlier version of tripling construction by Kang （J. Combin. Designs, 4 （1996）, 301-321）. As an application, we obtain an LRDTS（4·3^n） for any integer n ≥ 1, which provides an infinite family of even orders.     

The spectrum of 2‐idempotent 3‐quasigroups with conjugate invariant subgroups

A ternary quasigroup (or 3‐quasigroup) is a pair (N, q) where N is an n‐set and q(x, y, z) is a ternary operation on N with unique solvability. A 3‐quasigroup is called 2‐idempotent if it satisfies the generalized idempotent law: q(x, x, y) = q(x, y, x) = q(y, x, x)=y. A conjugation of a 3‐quasigroup, considered as an OA(3, 4, n), $({{N}},{\mathcal{B}})$, is a permutation of the coordinate positions applied to the 4‐tuples of ${\mathcal{B}}$. The subgroup of conjugations under which $({{N}},{\mathcal{B}})$ is invariant is called the conjugate invariant subgroup of $({{N}},{\mathcal{B}})$. In this article, we determined the existence of 2‐idempotent 3‐quasigroups of order n, n≡7 or 11 (mod 12) and n≥11, with conjugate invariant subgroup consisting of a single cycle of length three. This result completely determined the spectrum of 2‐idempotent 3‐quasigroups with conjugate invariant subgroups. As a corollary, we proved that an overlarge set of Mendelsohn triple system of order n exists if and only if n≡0, 1 (mod 3) and n≠6. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 292–304, 2010     

P3BD‐closed sets

A concept called P3BD‐closed set is introduced to describe a set of positive integers which is both PBD‐closed and 3BD‐closed. The theory of P3BD‐closure is developed and a few examples of P3BD‐closed sets are exhibited. In the process, the existence spectrum of OLIQ ^?s (overlarge sets of idempotent quasigroups with their own idempotent orthogonal mates) is almost determined. A pair of orthogonal OLIQ ^?s is shown to asymptotically exist. The existence of OLIQ s (overlarge sets of idempotent quasigroups with their own orthogonal mates not necessarily specifying idempotency) is also established with only 10 possible exceptions remained. Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 19:407‐421, 2011     

On large sets of almost Hamilton cycle decompositions

A large set of CS(v, k, λ), k‐cycle system of order v with index λ, is a partition of all k‐cycles of K_v into CS(v, k, λ)s, denoted by LCS(v, k, λ). A (v ? 1)‐cycle is called almost Hamilton. The completion of the existence spectrum for LCS(v, v ? 1, λ) only depends on one case: all v ≥ 4 for λ = 2. In this article, it is shown that there exists an LCS(v, v ? 1,2) for any v ≡ 0,1 (mod 4) except v = 5, and for v = 6,7,10,11. © 2006 Wiley Periodicals, Inc. J Combin Designs 16: 53–69, 2008     

Large sets of resolvable idempotent Latin squares

An idempotent Latin square of order v is called resolvable and denoted by RILS(v) if the v(v−1) off-diagonal cells can be resolved into v−1 disjoint transversals. A large set of resolvable idempotent Latin squares of order v, briefly LRILS(v), is a collection of v−2 RILS(v)s pairwise agreeing on only the main diagonal. In this paper we display some recursive and direct constructions for LRILSs.     

Further Results on Large Sets of Resolvable Idempotent Latin Squares

An idempotent Latin square of order v is called resolvable and denoted by RILS(v) if the off‐diagonal cells can be resolved into disjoint transversals. A large set of resolvable idempotent Latin squares of order v, briefly LRILS(v), is a collection of RILS(v)s pairwise agreeing on only the main diagonal. In this paper, it is established that there exists an LRILS(v) for any positive integer , except for , and except possibly for .     

Embeddability and construction of affine α-resolvable pairwise balanced designs

An affine α-resolvable PBD of index λ is a triple (V, B, R), where V is a set (of points), B is a collection of subsets of V (blocks), and R is a partition of B (resolution), satisfying the following conditions: (i) any two points occur together in λ blocks, (ii) any point occurs in α blocks of each resolution class, and (iii) |B| = |V| + |R| − 1. Those designs embeddable in symmetric designs are described and two infinite series of embeddable designs are constructed. The analog of the Bruck–Ryser–Chowla theorem for affine α-resolvable PBDs is obtained. © 1998 John Wiley & Sons, Inc. J Combin Designs 6:111–129, 1998