438 resultados para Tríades
Resumo:
Mode of access: Internet.
Resumo:
Advertisements: 16 p. of first group and 2 p. at end.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
Mode of access: Internet.
Resumo:
"December 1955."
Resumo:
Mode of access: Internet.
Resumo:
Includes bibliographical references.
Resumo:
Let T be a partial latin square and L be a latin square with T subset of L. We say that T is a latin trade if there exists a partial latin square T' with T' boolean AND T = theta such that (LT) U T' is a latin square. A k-homogeneous latin trade is one which intersects each row, each column and each entry either 0 or k times. In this paper, we construct 3-homogeneous latin trades from hexagonal packings of the plane with circles. We show that 3-homogeneous latin trades of size 3 m exist for each m >= 3. This paper discusses existence results for latin trades and provides a glueing construction which is subsequently used to construct all latin trades of finite order greater than three. Crown Copyright (c) 2005 Published by Elsevier B.V. All rights reserved.
Resumo:
The maximum possible volume of a simple, non-Steiner (v, 3, 2) trade was determined for all v by Xhosrovshahi and Torabi (Ars Combinatoria 51 (1999), 211-223), except that in the-case v equivalent to 5 (mod 6), v >= 23, they were only able to provide an upper, bound on the volume. In this paper we construct trades with volume equal to that bound for all v equivalent to 5 (mod 6), thus completing the problem.
Resumo:
A latin trade is a subset of a latin square which may be replaced with a disjoint mate to obtain a new latin square. A d-homogeneous latin trade is one which intersects each row, each column and each entry of the latin square either 0 or d times. In this paper we give a construction for minimal d-homogeneous latin trades of size dm, for every integer d >= 3, and m >= 1.75d(2) + 3. We also improve this bound for small values of d. Our proof relies on the construction of cyclic sequences whose adjacent sums are distinct. (c) 2006 Elsevier B.V. All rights reserved.