Study of Critical Sets in Latin Squares by using the Autotopism Group
نویسنده
چکیده
Given a Latin square L and a subset F of its autotopism group U(L), we study in this paper some properties and results which partial Latin squares contained in L inherit from U(L), by using F. In particular, we define the concept of F-critical set of L and we ask ourselves about the smallest one contained in L.
منابع مشابه
The set of autotopisms of partial Latin squares
Symmetries of a partial Latin square are primarily determined by its autotopism group. Analogously to the case of Latin squares, given an isotopism Θ, the cardinality of the set PLSΘ of partial Latin squares which are invariant under Θ only depends on the conjugacy class of the latter, or, equivalently, on its cycle structure. In the current paper, the cycle structures of the set of autotopisms...
متن کاملTransitive latin bitrades
In this note we give two results. First, if a latin bitrade (T , T) is primary, thin, separated, and Aut(T ) acts regularly on T , then (T , T) may be derived from a group-based construction. Second, if a latin bitrade (T , T) has genus 0 then the disjoint mate T is unique and the autotopism group of T ⋄ is equal to the autotopism group of T.
متن کاملSteiner Trades That Give Rise to Completely Decomposable Latin Interchanges
In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decomposed into six disjoint latin interchanges. 1 Background information In any combinatorial configuration it is possible to identify a subset which uniquely determines the structure of the configuration and in some cases i...
متن کاملOn the spectrum of critical sets in latin squares of order 2
Suppose that L is a latin square of order m and P ⊆ L is a partial latin square. If L is the only latin square of order m which contains P , and no proper subset of P has this property, then P is a critical set of L. The critical set spectrum problem is to determine, for a given m, the set of integers t for which there exists a latin square of order m with a critical set of size t. We outline a...
متن کاملIdentifying flaws in the security of critical sets in latin squares via triangulations
In this paper we answer a question in theoretical cryptography by reducing it to a seemingly unrelated geometrical problem. Drápal (1991) showed that a given partition of an equilateral triangle of side n into smaller, integer-sided equilateral triangles gives rise to, under certain conditions, a latin trade within the latin square based on the addition table for the integers (mod n). We apply ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 29 شماره
صفحات -
تاریخ انتشار 2007