陆家羲与组合设计大集

从介绍我国著名组合数学家陆家羲的生平事迹和杰出贡献出发，综述近二十多年来组合设计大集问题的主要研究进展，尤其是我国学者的成就。     

单纯三元系的嵌入

我们在本文中证明,对任意给定的正整数λ,当且仅当u≥2v+1且v≥λ+2时,任一单纯三元系NB(3,λ;v)可嵌入于某个单纯三元系NB(3,λ;u)。从而完全地解决了A.Rosa于1983年提出的单纯三元系的嵌入问题。     

LD设计的存在谱

在解决斯坦纳三元系大集存在性问题时,陆家羲引入LD设计和LD^*设计的概念,建立这两类设计的若干递推构造和直接构造,在构作斯坦纳三元系大集过程中发挥重要作用.为了构造陆家羲遗留的六个小阶数的斯坦纳三元系大集,Teirlinck依然借助LD设计,使用PBD进行递推构造,最终确定斯坦纳三元系大集的存在谱.本文将彻底解决LD设计存在的充分必要条件,对LD^*设计的存在性仅余四个可能例外值.     

有向三元系超大集的存在谱

一个v 阶有向三元系,记为DTS(v,λ), 是指一个对子(X, B),这里X为v元集, B为X上一些可迁三元组(简称区组) 构成的集合, 使得X上每个由不同元素组成的有序对都恰在B的λ个区组中出现. 一个有向三元系的超大集,记为 OLDT(v,λ), 是指一个集合(Y{y}, A_I)_I, 其中Y为v+1元集, 每个(Y{y}, A_I)是一个DTS(v,λ), 并且所有 A_I 形成 Y上全部可迁三元组的分拆. 讨论OLDTS(v,λ)的存在性问题, 并且给出结论: 存在OLDTS(v,λ) 当且仅当 λ=1 且v≡0,1 (mod 3), 或 λ=3且v≠2.     

不相交可迁三元系大集的完全解决

本文利用一种特殊的LTTS(18)给出了由LTTS(v+2)产生LTTS(16v+2)的递归构造,从而证明了LTTS(2ⁿ+2)的存在性。这样,我们就完全解决了可迁三元系大集LTTS(v)的存在性问题。     

单纯有向三元系的嵌入

本文给出并证明了单纯有向三元系嵌入的充要条件，从而完整地解决了这一问题．     

三元系的大集与超大集

组合设计中的大集问题有着悠久的历史和重要的应用.但囿于其难度,长期进展很慢.近30年来,在一些新方法推动下,大集研究呈现了良好的态势.本文综述了几类经典三元系设计的大集及超大集的研究进展,同时给出了存在2.13~n+1阶Kirkman三元系超大集和3.5~n阶可分解Mendelsohn三元系超大集的新结果.     

纯的可迁三元系大集的存在谱

LPDTS(v)是同一个v元集上3(v-2)个互不相交的纯的可迁三元系的集合. 田子红在其博士论文中, 证明了当v≡0, 4(mod 6)且v≥4时存在LPDTS(v). 本文建立了当 v≡1, 3(mod 6)且v>3时LPDTS(v)的存在性, 由此确定了LPDTS(v)的存在谱为{v:v≡0, 1(mod3), v≥4}.     

李三系的Frattini子系

李三系是从黎曼对称空间产生的三元运算的代数系统,近年来备受数学家们的重视.针对李三系的Frattini子系和基本李三系的问题进行了研究,给出了Frattini子系和基本李三系的一些性质,并证明了李三系的非嵌入定理,同时得到了幂零李三系是基本李三系的一个充要条件.     

三类有向三元系之间关系的一种猜想

一个Mendelsohn (Directed, 或Hybrid)三元系 MTS$(v, \lambda)$~(DTS$(v, \lambda)$,或HTS$(v,\lambda))$, 是由$v$元集$X$ 上的一些循环（可迁，或循环和可迁）三元组(简称区组)构成的集合${\cal B}$, 使得$X$上每个由不同元素组成的有序对都恰在 ${\cal B}$的$\lambda$个区组中出现.本文主要讨论了这三类有向三元系之间的一种关联关系，给出猜想：任意MTS$(v,\lambda)$的区组关联图$G(\     

r×t阶Kirkman三连系构造的一种方法

发现了 6n+3的高阶 Kirkman三连系构造方法 .阐明了 r× t阶 Kirkman三连系构造的基本理论 .给出了完全三分图的定义 ,并证明了关于 Kirkman三连系构造的命题 .介绍了 1 3 5阶 Kirkman三连系的构造过程 .     

Coloring Cubic Graphs by Point‐Intransitive Steiner Triple Systems

An ‐coloring of a cubic graph G is an edge coloring of G by points of a Steiner triple system such that the colors of any three edges meeting at a vertex form a block of . A Steiner triple system that colors every simple cubic graph is said to be universal. It is known that every nontrivial point‐transitive Steiner triple system that is neither projective nor affine is universal. In this article, we present the following results.

相似文献   

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

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

New results on LR-designs and OLKTSs

LR-designs, introduced by Lei (2002) [10], play an important role in the recursive constructions of large sets of Kirkman triple systems. In this paper, we mainly present some new infinite families of LR-designs and overlarge sets of Kirkman triple systems.     

Triple Systems are Eulerian

An Euler tour of a hypergraph (also called a rank‐2 universal cycle or 1‐overlap cycle in the context of designs) is a closed walk that traverses every edge exactly once. In this paper, using a graph‐theoretic approach, we prove that every triple system with at least two triples is eulerian, that is, it admits an Euler tour. Horan and Hurlbert have previously shown that for every admissible order >3, there exists a Steiner triple system with an Euler tour, while Dewar and Stevens have proved that every cyclic Steiner triple system of order >3 and every cyclic twofold triple system admits an Euler tour.     

On 6-sparse Steiner triple systems

We give the first known examples of 6-sparse Steiner triple systems by constructing 29 such systems in the residue class 7 modulo 12, with orders ranging from 139 to 4447. We then present a recursive construction which establishes the existence of 6-sparse systems for an infinite set of orders. Observations are also made concerning existing construction methods for perfect Steiner triple systems, and we give a further example of such a system. This has order 135,859 and is only the fourteenth known. Finally, we present a uniform Steiner triple system of order 180,907.     

Linearly Derived Steiner Triple Systems

We attach a graph to every Steiner triple system. The chromatic number of this graph is related to the possibility of extending the triple system to a quadruple system. For example, the triple systems with chromatic number one are precisely the classical systems of points and lines of a projective geometry over the two-element field, the Hall triple systems have chromatic number three (and, as is well-known, are extendable) and all Steiner triple systems whose graph has chromatic number two are extendable. We also give a configurational characterization of the Hall triple systems in terms of mitres.     

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).

     

On the Binary Codes of Steiner Triple Systems

The binary code spanned by the rows of the point byblock incidence matrix of a Steiner triple system STS(v)is studied. A sufficient condition for such a code to containa unique equivalence class of STS(v)'s of maximalrank within the code is proved. The code of the classical Steinertriple system defined by the lines in PG(n-1,2)(n3), or AG(n,3) (n3) is shown to contain exactly v codewordsof weight r=(v-1)/2, hence the system is characterizedby its code. In addition, the code of the projective STS(2ⁿ-1)is characterized as the unique (up to equivalence) binary linearcode with the given parameters and weight distribution. In general,the number of STS(v)'s contained in the code dependson the geometry of the codewords of weight r. Itis demonstrated that the ovals and hyperovals of the definingSTS(v) play a crucial role in this geometry. Thisrelation is utilized for the construction of some infinite classesof Steiner triple systems without ovals.     

Uniform two‐class regular partial Steiner triple systems

A 2‐class regular partial Steiner triple system is a partial Steiner triple system whose points can be partitioned into 2‐classes such that no triple is contained in either class and any two points belonging to the same class are contained in the same number of triples. It is uniform if the two classes have the same size. We provide necessary and sufficient conditions for the existence of uniform 2‐class regular partial Steiner triple systems.