Combinatorial trades: a survey of recent results

EJ Billington - Designs 2002: Further Computational and Constructive …, 2003 - Springer
The concept of a trade in a combinatorial structure has existed for some years now.
However, in the last five years or so there has been a great deal of activity in the area. This …

On the possible volumes of μ-way latin trades

P Adams, EJ Billington, DE Bryant… - aequationes …, 2002 - Springer
A μ-way latin trade of volume s is a set of μ partial latin rectangles (of inconsequential size)
containing exactly the same s filled cells, such that if cell (i, j) is filled, it contains a different …

On the possible volume of - trades

S Rashidi, N Soltankhah - arXiv preprint arXiv:1310.7759, 2013 - arxiv.org
A $\mu $-way $(v, k, t) $$ trade $ of volume $ m $ consists of $\mu $ disjoint collections $
T_1 $, $ T_2,\dots T_ {\mu} $, each of $ m $ blocks, such that for every $ t $-subset of $ v …

On the possible volume of three way trades

S Rashidi, N Soltankhah - Electronic Notes in Discrete Mathematics, 2013 - Elsevier
Abstract A 3-way (v, k, t) trade of volume s consists of 3 disjoint collections T 1, T 2 and T 3,
each of s blocks, such that for every t-subset of v-set V, the number of blocks containing this t …

A linear algebraic approach to orthogonal arrays and Latin squares

AA Khanban, M Mahdian, ES Mahmoodian - arXiv preprint arXiv …, 2009 - arxiv.org
To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and Singhi (1988
and 1994) considered some module spaces. Here, using a linear algebraic approach we …

The fine structures of three Latin squares

Y Chang, G Lo Faro, G Nordo - Journal of Combinatorial …, 2006 - Wiley Online Library
The fine structures of three Latin squares Page 1 The Fine Structures of Three Latin
Squares Yanxun Chang,1 Giovanni Lo Faro,2 Giorgio Nordo2 1Department of Mathematics …

[PDF][PDF] The 3-way flower intersection problem for Steiner triple systems

H Amjadi, N Soltankhah - Discrete Mathematics & …, 2020 - dmtcs.episciences.org
A Steiner system S (2, k, v) is a pair (X, B) where X is a v-set and B is a family of k-subset of X
called blocks, such that each 2-subset of X is contained in exactly one block of B. If k= 3 …

The 3-way intersection problem for kite systems

P Chen, X Wang - Graphs and Combinatorics, 2018 - Springer
In this paper we introduce the 3-way intersection problem for G-designs, and we consider
this problem for kite systems. Let b_v= v (v-1)/8 bv= v (v-1)/8 and I_3 (v)={0, 1, ..., b_v ∖ {b_v …

The Disjoint -Flower Intersection Problem for Latin Squares

JG Lefevre, TA McCourt - the electronic journal of combinatorics, 2011 - combinatorics.org
An $ m $-flower in a latin square is a set of $ m $ entries which share either a common row,
a common column, or a common symbol, but which are otherwise distinct. Two $ m $-flowers …

[PDF][PDF] Further results on fine structures of three Latin squares.

Z Wang, Y Chang - Australas. J Comb., 2008 - Citeseer
Denote by Fin (v) the set of all integer pairs (t, s) for which there exist three Latin squares of
order v on the same set having fine structure (t, s). The set Fin (v) with v≥ 2 and v= 5, 6, 7, 8 …