Related papers: Latin bitrades, dissections of equilateral triangl…

A latin bitrade $(T^{\diamond}, T^{\otimes})$ is a pair of partial latin squares which defines the difference between two arbitrary latin squares $L^{\diamond} \supseteq T^{\diamond}$ and $L^{\diamond} \supseteq T^{\otimes}$ of the same…

A latin bitrade (T1, T2) is a pair of partial latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same set of entries. A genus may be associated to a latin bitrade…

A latin bitrade is a pair of partial latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same set of entries. Dr\'apal (\cite{Dr9}) showed that a latin bitrade is…

For a finite triangulation of the plane with faces properly coloured white and black, let A be the abelian group constructed by labelling the vertices with commuting indeterminates and adding relations which say that the labels around each…

A subset $S$ of $k$-ary $n$-dimensional hypercube is called latin bitrade if $|S\cap F|\in\{0,2\} $ for each 1-face $F$. We find all admissible small (less than $2^{n+1}$) cardinalities of latin bitrades. A subset $M$ of $k$-ary…

We construct sequencings for many groups that are a semi-direct product of an odd-order abelian group and a cyclic group of odd prime order. It follows from these constructions that there is a group-based complete Latin square of order $n$…

We introduce a notion of parity for transversals, and use it to show that in Latin squares of order $2 \bmod 4$, the number of transversals is a multiple of 4. We also demonstrate a number of relationships (mostly congruences modulo 4)…

A partial transversal $T$ of a Latin square $L$ is a set of entries of $L$ in which each row, column and symbol is represented at most once. A partial transversal is maximal if it is not contained in a larger partial transversal. Any…

We prove an asymptotic for the number of additive triples of bijections $\{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$, that is, the number of pairs of bijections $\pi_1,\pi_2\colon \{1,\dots,n\}\to\mathbb{Z}/n\mathbb{Z}$ such that the pointwise…

A Latin square of order $n$ with symbols $a_1,\ldots,a_n$ can be considered as a multiplication table for binary operation in the set $A=\{a_1,\ldots,a_n\}$. We prove that, if this operation is associative, then $A$ is a group.

Latin hypercube designs achieve optimal univariate stratifications and are useful for computer experiments. Sliced Latin hypercube designs are Latin hypercube designs that can be partitioned into smaller Latin hypercube designs. In this…

Let $G$ be a triangulation of the sphere with vertex set $V$, such that the faces of the triangulation are properly coloured black and white. Motivated by applications in the theory of bitrades, Cavenagh and Wanless defined $A_W$ to be the…

Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…

This article, showing that almost all objects in the title are asymmetric, is re-typed from a manuscript I wrote somewhere around 1980 (after the papers of Bang and Friedland on the permanent conjecture but before those of Egorychev and…

We (1) determine the number of Latin rectangles with 11 columns and each possible number of rows, including the Latin squares of order~11, (2) answer some questions of Alter by showing that the number of reduced Latin squares of order $n$…

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

Quandles are self-distributive, right-invertible, idempotent algebras. A group with conjugation for binary operation is an example of a quandle. Given a quandle $(Q, \ast)$ and a positive integer $n$, define $a\ast_n b = (\cdots (a\ast…

Ever since E. T. Parker constructed an orthogonal pair of $10\times10$ Latin squares in 1959, an orthogonal triple of $10\times10$ Latin squares has been one of the most sought-after combinatorial designs. Despite extensive work, the…

An arrangement of s elements in s rows and s columns, such that no element repeats more than once in each row and each column is called a Latin square of order s. If two Latin squares of the same order superimposed one on the other and in…

We prove several results about substructures in Latin squares. First, we explain how to adapt our recent work on high-girth Steiner triple systems to the setting of Latin squares, resolving a conjecture of Linial that there exist Latin…