2-设计块图中无设计结构的非正则最大簇

IF 1.4 2区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Designs, Codes and Cryptography Pub Date : 2024-07-18 DOI:10.1007/s10623-024-01459-x

Sergey Goryainov, Elena V. Konstantinova

引用次数: 0

摘要

在本论文中，我们正面回答了克里斯-戈德希尔（Chris Godsil）和凯伦-米格尔（Karen Meagher）提出的一个问题，即是否存在一个块图具有非经典最大簇而没有设计结构的 2 设计。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Non-canonical maximum cliques without a design structure in the block graphs of 2-designs

In this note we answer positively a question of Chris Godsil and Karen Meagher on the existence of a 2-design whose block graph has a non-canonical maximum clique without a design structure.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Designs, Codes and Cryptography 工程技术-计算机：理论方法

CiteScore

2.80

自引率

12.50%

发文量

157

审稿时长

16.5 months

期刊介绍： Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.