DeepAI AI Chat
Log In Sign Up

Ryser's Theorem for Symmetric ρ-latin Squares

by   Amin Bahmanian, et al.

Let L be an n× n array whose top left r× r subarray is filled with k different symbols, each occurring at most once in each row and at most once in each column. We establish necessary and sufficient conditions that ensure the remaining cells of L can be filled such that each symbol occurs at most once in each row and at most once in each column, L is symmetric with respect to the main diagonal, and each symbol occurs a prescribed number of times in L. The case where the prescribed number of times each symbol occurs is n was solved by Cruse (J. Combin. Theory Ser. A 16 (1974), 18-22), and the case where the top left subarray is r× n and the symmetry is not required, was settled by Goldwasser et al. (J. Combin. Theory Ser. A 130 (2015), 26-41). Our result allows the entries of the main diagonal to be specified as well, which leads to an extension of the Andersen-Hoffman's Theorem (Annals of Disc. Math. 15 (1982) 9-26, European J. Combin. 4 (1983) 33-35).


page 1

page 2

page 3

page 4


Row-column factorial designs with multiple levels

An m× n row-column factorial design is an arrangement of the elements of...

A Commentary on "Breaking Row and Column Symmetries in Matrix Models"

The CP 2002 paper entitled "Breaking Row and Column Symmetries in Matrix...

Weak convergence of U-statistics on a row-column exchangeable matrix

U-statistics are used to estimate a population parameter by averaging a ...

On Regular Set Systems Containing Regular Subsystems

Let X,Y be finite sets, r,s,h, λ∈ℕ with s≥ r, X⊊ Y. By λXh we mean the c...

Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order

In this paper we propose an algorithm for enumerating diagonal Latin squ...

Bounds and Algorithms for Frameproof Codes and Related Combinatorial Structures

In this paper, we study upper bounds on the minimum length of frameproof...

Method and apparatus for automatic text input insertion in digital devices with a restricted number of keys

A device which contains number of symbol input keys, where the number of...