scholarly journals Lower Bounds on the Sizes of Defining Sets in Full n-Latin Squares and Full Designs

2018 ◽  
Vol 34 (4) ◽  
pp. 571-577
Author(s):  
Nicholas J. Cavenagh
Keyword(s):  
Lower Bounds ◽  
Latin Squares ◽  
Defining Sets

New bounds of Mutually unbiased maximally entangled bases in C^dxC^(kd)

2018 ◽  
Vol 18 (13&14) ◽  
pp. 1152-1164
Author(s):  
Xiaoya Cheng ◽  
Yun Shang
Keyword(s):  
Lower Bound ◽  
Lower Bounds ◽  
Prime Power ◽  
Latin Squares ◽  
Mutually Unbiased Bases ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
Bipartite System

Mutually unbiased bases which is also maximally entangled bases is called mutually unbiased maximally entangled bases (MUMEBs). We study the construction of MUMEBs in bipartite system. In detail, we construct 2(p^a-1) MUMEBs in \cd by properties of Guss sums for arbitrary odd d. It improves the known lower bound p^a-1 for odd d. Certainly, it also generalizes the lower bound 2(p^a-1) for d being a single prime power. Furthermore, we construct MUMEBs in \ckd for general k\geq 2 and odd d. We get the similar lower bounds as k,b are both single prime powers. Particularly, when k is a square number, by using mutually orthogonal Latin squares, we can construct more MUMEBs in \ckd, and obtain greater lower bounds than reducing the problem into prime power dimension in some cases.

Two remarks about Sudoku squares

2006 ◽  
Vol 90 (519) ◽  
pp. 425-430 ◽  
Author(s):  
A. D. Keedwell
Keyword(s):  
Current Problem ◽  
Latin Square ◽  
Latin Squares ◽  
Critical Set ◽  
Critical Sets ◽  
The Given ◽  
A Current ◽  
Defining Sets

Smallest defining setsA standard Sudoku square is a 9 × 9 latin square in which each of the nine 3 × 3 subsquares into which it can be separated contains each of the integers 1 to 9 exactly once.A current problem is to complete such a square when only some of the cells have been filled. These cells are often called ‘givens’. (Such problems are currently (2005) published daily in British newspapers.) In more mathematical terms, the given filled cells constitute a defining set or uniquely completable set for the square if they lead to a unique completion of the square. If, after deletion of any one of these givens, the square can no longer be completed uniquely, the givens form a critical set. The investigation of critical sets for ‘ordinary’ latin squares is a topic of current mathematical interest. (See [1] for more details.)

scholarly journals Some results on defining sets of t-designs

1999 ◽  
Vol 59 (2) ◽  
pp. 203-215 ◽  
Author(s):  
Brenton D. Gray ◽  
Colin Ramsay
Keyword(s):  
Infinite Family ◽  
Latin Squares ◽  
Critical Sets ◽  
Defining Sets

We investigate how varying the parameters of t-(ν, κ, λ) designs affects the sizes of smallest defining sets. In particular, we consider the effect of varying each of the parameters t, ν and λ. We establish a number of new bounds for the sizes of smallest defining sets and find the size of smallest defining sets for an infinite family of designs. We also show how one of our results can be applied to the problem of finding critical sets of Latin squares.

scholarly journals Room n-cubes of lowe order

1984 ◽  
Vol 36 (2) ◽  
pp. 237-252 ◽  
Author(s):  
Jeffrey H. Dinitz
Keyword(s):  
Lower Bounds ◽  
Latin Squares ◽  
Two Dimensional ◽  
Galois Fields ◽  
Dimensional Array

AbstractA Room n-cube of side t is an n dimensional array of side t which satisfies the property that each two dimensional projection is a Room square. The existence of a Room n-cube of side t is equivalent to the existence of n pairwise orthgonal symmetric Latin squares (POSLS) of side t. The existence of n pairwise orthogonal starters of order t implies the existence of n POSLS of side t. Denote by v(n) the maximum number of POSLS of side t. In this paper, we use Galois fields and computer constructions to construct sets of pairwise orthogonal starters of order t ≤ 101. The existence of these sets of starters gives improved lower bounds for v(n). In particular, we show v(17) ≥ 5, v(21) ≥ 5, v(29) ≥ 13, v(37) ≥ 15 and v(41) ≥ 9, among others.

scholarly journals Generalized Latin squares and their defining sets

2008 ◽  
Vol 308 (12) ◽  
pp. 2366-2378
Author(s):  
Karola Mészáros
Keyword(s):  
Latin Squares ◽  
Defining Sets

Defining sets for magic squares

2006 ◽  
Vol 90 (519) ◽  
pp. 417-424 ◽  
Author(s):  
A. D. Keedwell
Keyword(s):  
Latin Squares ◽  
Block Designs ◽  
Current Interest ◽  
Combinatorial Structures ◽  
Magic Squares ◽  
Defining Sets

A topic of current interest is that of finding defining sets (preferably smallest defining sets) for various combinatorial structures such as latin squares and block designs, so it seemed interesting (though of no practical use) to try to solve the same problem for magic squares of small size. (The germ of this idea was suggested in the Gazette Note [1] of 1988 under the sub-heading ‘Squares from clues’.)

New construction of mutually unbiased bases in square dimensions

2005 ◽  
Vol 5 (2) ◽  
pp. 93-101
Author(s):  
P. Wocjan ◽  
T. Beth
Keyword(s):  
Lower Bounds ◽  
Prime Power ◽  
Hadamard Matrices ◽  
Latin Squares ◽  
Mutually Unbiased Bases ◽  
Asymptotic Growth ◽  
Orthogonal Latin Squares ◽  
Mutually Orthogonal Latin Squares ◽  
New Construction

We show that k=w+2 mutually unbiased bases can be constructed in any square dimension d=s^2 provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (s,k)-nets (which can be constructed from w mutually orthogonal Latin squares of order s and vice versa) and generalized Hadamard matrices of size s. Using known lower bounds on the asymptotic growth of the number of mutually orthogonal Latin squares (based on number theoretic sieving techniques), we obtain that the number of mutually unbiased bases in dimensions d=s^2 is greater than s^{1/14.8} for all s but finitely many exceptions. Furthermore, our construction gives more mutually unbiased bases in many non-prime-power dimensions than the construction that reduces the problem to prime power dimensions.

scholarly journals The Orthomorphism Graph $\mathcal{L}_3(q)$

10.37236/6882 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Anthony B. Evans
Keyword(s):  
Lower Bounds ◽  
Difference Equations ◽  
Latin Squares ◽  
Combinatorial Designs

Orthomorphisms of groups and pairwise orthogonal orthomorphisms have been used in several constructions of combinatorial designs, in particular in the construction of mutually orthogonal sets of latin squares based on  groups. In this paper we will use difference equations to construct orthomorphisms in $\mathcal{L}_3(q)$, an orthomorphism graph of $GF(q)^{+}\times GF(3)^+$, and to establish lower bounds for the number of pairwise orthogonal orthomorphisms in $\mathcal{L}_3(q)$.

Sign in / Sign up

Export Citation Format

Share Document