S. Adachi

collaborators

2 papers

math.CO2016

Maximal $m$ -distance sets containing the representation of the Hamming graph $H (n, m)$

Saori Adachi, Rina Hayashi, Hiroshi Nozaki +1

A set $X$ in the Euclidean space $R^{d}$ is called an $m$ -distance set if the set of Euclidean distances between two distinct points in $X$ has size $m$ . An $m$ -distance set…

math.CO2015

On the largest subsets avoiding the diameter of $(0, \pm 1)$ -vectors

Saori Adachi, Hiroshi Nozaki

Let $L_{mk l} \subset R^{m + k + l}$ be the set of vectors which have $m$ of entries $- 1$ , $k$ of entries $0$ , and $l$ of entries $1$ . In this paper, we investigate the largest…

Maximal m-distance sets containing the representation of the Hamming graph H(n,m)

On the largest subsets avoiding the diameter of (0,±1)-vectors

Maximal $m$ -distance sets containing the representation of the Hamming graph $H (n, m)$

On the largest subsets avoiding the diameter of $(0, \pm 1)$ -vectors