Note on Kocay's 3-hypergraphs and Stockmeyer's tournaments (Q1362101)

\textit{S. M. Ulam} [A collection of mathematical problems (1960; Zbl 0086.24101)] conjectured that all finite simple graphs on at least three vertices are \((-1)\)-reconstructible. \textit{P. K. Stockmeyer} shows the falsity of this conjecture for directed graphs of arbitrarily large cardinality [The falsity of reconstruction conjecture for tournaments, J. Graph Theory 1, 19-25 (1977; Zbl 0355.05026)]. In Section 1, we show: two ternary relations representing the 3-cycles of two indecomposable nonconverse and non-\((-1)\)-reconstructible tournaments form a counterexample to \((-1)\)-reconstructibility of ternary relations. Then we use Stockmeyer's counterexample of the aforesaid paper to illustrate the previous theorem. In [A family of non-reconstructible hypergraphs, J. Comb. Theory, Ser. B 42, 46-63 (1987; Zbl 0578.05052)], \textit{W. L. Kocay} mentions two different families of \((-1)\)-hypomorphic 3-hypergraphs: the first one (denoted here \(J^\varepsilon_n\), \(\varepsilon\in\{0,1\}\)) for which W. L. Kocay shows that \(J^0_n\) and \(J^1_n\) are not isomorphic and the second one (denoted here \(K^\varepsilon_n\), \(\varepsilon\in\{0,1\}\)) that we consider in this note. For this last family, W. L. Kocay does not say whether the hypergraphs \(K^0_n\) and \(K^1_n\) are nonisomorphic ones. In Section 2, we prove that Stockmeyer's counterexample coincides with the family \(\{K^\varepsilon_n, \varepsilon\in\{0,1\}\}\) and this can be used to give a short proof of the fact that \(K^0_n\) and \(K^1_n\) are not isomorphic.