|
Эта публикация цитируется в 2 научных статьях (всего в 2 статьях)
Дискретная математика и математическая кибернетика
Maximal metrically regular sets
A. K. Oblaukhov Sobolev Institute of Mathematics,
pr. Koptyuga, 4,
630090, Novosibirsk, Russia
Аннотация:
Metrically regular sets form an interesting subclass of all subsets of an arbitrary finite discrete metric space $M$. Let us denote $\widehat{S}$ the set of points which are at maximal possible distance from the subset $S$ of the space $M$. Then $S$ is called metrically regular, if the set of vectors which are at maximal possible distance from $\widehat{S}$ coincides with $S$. The problem of investigating metrically regular sets appears when studying bent functions, set of which is metrically regular in the Boolean cube with the Hamming metric. In this paper the method of obtaining metrically regular sets from an arbitrary subset of the metric space is presented. Smallest metrically regular sets in the Boolean cube are described, and it is proven that metrically regular sets of maximal cardinality in the Boolean cube have covering radius $1$ and are complements of minimal covering codes of radius $1$. Lower bound on the sum of cardinalities of a pair of metrically regular sets, each being metric complement of the other, is given.
Ключевые слова:
metrically regular set, metric complement, Boolean cube, minimal covering code, bent function.
Поступила 23 марта 2018 г., опубликована 30 декабря 2018 г.
Образец цитирования:
A. K. Oblaukhov, “Maximal metrically regular sets”, Сиб. электрон. матем. изв., 15 (2018), 1842–1849
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/semr1039 https://www.mathnet.ru/rus/semr/v15/p1842
|
Статистика просмотров: |
Страница аннотации: | 188 | PDF полного текста: | 96 | Список литературы: | 21 |
|