Using results of Altshuler and Negami, we present a classification of biembeddings of symmetric configurations of triples in the torus or Klein bottle. We also give an alternative proof of the structure of 3-homogeneous Latin trades.

Let $K_{s,t}$ be the complete bipartite graph with partite sets $\{x_1,...,x_s\}$ and $\{y_1,...,y_t\}$. A split bipartite-graph on $(s+s^{\text{'}})+(t+t^{\text{'}})$ vertices, denoted by ${\mathrm{SB}}_{s+s^{\text{'}},t+t^{\text{'}}}$, is the graph obtained from $K_{s,t}$ by adding $s^{\text{'}}+t^{\text{'}}$ new vertices $x_{s+1},...,x_{s+s^{\text{'}}}$, $y_{t+1},...,y_{t+t^{\text{'}}}$ such that each of $x_{s+1},...,x_{s+s^{\text{'}}}$ is adjacent to each of $y_1,...,y_t$ and each of $y_{t+1},...,y_{t+t^{\text{'}}}$ is adjacent to each of $x_1,...,x_s$. Let $A$ and $B$ be nonincreasing lists of nonnegative integers, having lengths $m$ and $n$, respectively. The pair $(A;B)$ is potentially ${\mathrm{SB}}_{s+s^{\text{'}},t+t^{\text{'}}}$-bigraphic if there is a simple bipartite graph containing ${\mathrm{SB}}_{s+s^{\text{'}},t+t^{\text{'}}}$ (with $s+s^{\text{'}}$ vertices $x_1,...,x_{s+s^{\text{'}}}$ in the part of size $m$ and $t+t^{\text{'}}$ vertices...

We study the bi-Lipschitz embedding problem for metric compacta hyperspaces. We observe that the compacta hyperspace K(X) of any separable, uniformly disconnected metric space X admits a bi-Lipschitz embedding in ℓ². If X is a countable compact metric space containing at most n nonisolated points, there is a Lipschitz embedding of K(X) in ${ℝ}^{n+1}$; in the presence of an additional convergence condition, this embedding may be chosen to be bi-Lipschitz. By way of contrast, the hyperspace K([0,1]) of the...

We consider the billiard map in the hypercube of ${ℝ}^d$. We obtain a language by coding the billiard map by the faces of the hypercube. We investigate the complexity function of this language. We prove that $n^{3d-3}$ is the order of magnitude of the complexity.

Two operators are constructed which make it possible to transform ternary relations into binary relations defined on binary relations and vice versa. A possible graphical representation of ternary relations is described.

For k ≥ 1, the odd graph denoted by O(k), is the graph with the vertex-set Ωk, the set of all k-subsets of Ω = 1, 2, …, 2k +1, and any two of its vertices u and v constitute an edge [u, v] if and only if u ∩ v = /0. In this paper the binary code generated by the adjacency matrix of O(k) is studied. The automorphism group of the code is determined, and by identifying a suitable information set, a 2-PD-set of the order of k 4 is determined. Lastly, the relationship between the dual code from O(k)...