A lower bound on the number of Semi‐Boolean quadruple systems
A lower bound on the number of Semi‐Boolean quadruple systems
复制标题
半布尔四元组数量的下界
DOI:
10.1002/jcd.10050
复制
发表时间:
2003
影响因子:
0.7
通讯作者:
A. Del Fra
中科院分区:
文献类型:
--
作者:
M. Buratti;A. Del Fra
A Steiner quadruple system of order 2n is Semi‐Boolean (SBQS(2n) in short) if all its derived triple systems are isomorphic to the point‐line design associated with the projective geometry PG(n−1, 2). We prove by means of explicit constructions that for any n, up to isomorphism, there exist at least 2⌊ 3(n−4)/2⌋ regular and resolvable SBQS(2n). © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 229–239, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10050