✦ LIBER ✦

Equivalence classes of matchings and lattice-square designs

✍ Scribed by William Y.-C. Chen; David C. Torney

Book ID: 108110498
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 247 KB
Volume: 145
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.02.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Construction of Lattice Square Designs

✍ Prof. W. T. Federer; J. Wright 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB 👁 1 views

## KHARE and FEDERER (1981) presented a simple method for constructing incomplete block designs for any number of treatments. Their procedure is extended to constructing lattice square designs. Using variety cutting, lattice square designs are available for any number of treatments.

Pooling, lattice square, and union jack

Pooling, lattice square, and union jack designs

✍ Mark A. Chateauneuf; Charles J. Colbourn; Donald L. Kreher; Esther R. Lamken; Da 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 501 KB

Number of equivalence classes of weakly

Number of equivalence classes of weakly equivalent lattices

✍ I. A. Levina 📂 Article 📅 1974 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 384 KB

A Class of Matchings and a Related Latti

A Class of Matchings and a Related Lattice

✍ K. Kilakos 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 474 KB

Let '$(G) denote the fractional chromatic index of a graph G. Let M(G) be a family of matchings of G such that M # M(G) if and only if there exists a fractional '$(G)-edge colouring of G in which M is a colour class. We use Lova sz's matching lattice theorem to obtain a description of the lattice ge

Symmetric Squares, Spherical Designs, an

Symmetric Squares, Spherical Designs, and Lattice Minima

✍ Wolfgang Lempken; Bernd Schröder; Pham Huu Tiep 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Enumeration of Symmetry Classes of Conve

Enumeration of Symmetry Classes of Convex Polyominoes in the Square Lattice

✍ P. Leroux; E. Rassart; A. Robitaille 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 544 KB

This paper concerns the enumeration of rotation-type and congruence-type convex polyominoes on the square lattice. These can be defined as orbits of the Ž groups ᑝ , of rotations, and ᑞ , of symmetries, of the square, acting on transla-4 4 . tion-type polyominoes. By virtue of Burnside's lemma, it i