Affordable Access

Avoiding partial Latin squares and intricacy.

Authors
Publication Date
Keywords
  • Qa Mathematics

Abstract

In this paper we consider the following problem: Given a partial n × n latin square P on symbols 1, 2,…, n, is it possible to find an n × n latin square L on the same symbols which differs from P in every cell? In other words, is P avoidable? We show that all 2k × 2k partial latin squares for k 2 are avoidable and give some results on odd partial latin squares. We also use these results to show that the intricacy of avoiding partial latin squares is two and of avoiding more general arrays is at most three.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Avoiding partial Latin squares and intricacy

on Discrete Mathematics Jan 01, 1997

On avoiding odd partial Latin squares andr-multi L...

on Discrete Mathematics Jan 01, 2006

Avoiding abelian squares in partial words

on Journal of Combinatorial Theor... Jan 01, 2012
More articles like this..