A technique for computing minors of binary Hadamard matrices and application to the growth problem.
An algorithm is given to decompose an automorphism of a finite vector space over ℤ₂ into a product of transvections. The procedure uses partitions of the indexing set of a redundant base. With respect to tents, i.e. finite ℤ₂-representations generated by a redundant base, this is a decomposition into base changes.
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 -homogeneous latin trade is one which intersects each row, each column and each entry of the latin square either or times. In this paper, we show that a construction given by Cavenagh, Donovan and Drápal for -homogeneous latin trades in fact classifies every minimal -homogeneous latin trade. We in turn classify all -homogeneous latin trades. A corollary is that any -homogeneous...
The aim of this paper is to generalize several basic results from transversal theory, primarily the theorem of Edmonds and Fulkerson.
This paper is a contribution to the general tiling problem for the hyperbolic plane. It is an intermediary result between the result obtained by R. Robinson [Invent. Math.44 (1978) 259–264] and the conjecture that the problem is undecidable.