AbstractFor n 1, 5 (mod 6) it is shown that the dihedral group of order 4n admits a pair of orthogonal orthomorphisms
A partial orthomorphism of a group GG (with additive notation) is an injection π:S→G for some S⊆G su...
AbstractA polynomial f(X) over a finite field is an orthomorphism if both f(X) and f(X)-X are permut...
One problem of interest in the study of Latin squares is that of determining parameter pairs (n, r) ...
AbstractFor n 1, 5 (mod 6) it is shown that the dihedral group of order 4n admits a pair of orthog...
AbstractWe prove that if m>3 is odd and not divisible by 9 then we can construct a pair of orthogona...
AbstractWe improve the lower bound for N(24), the maximum size of a set of parwise orthogonal Latin ...
This book is about orthomorphisms and complete mappings of groups, and related constructions of orth...
An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x...
AbstractWe give a new construction showing how new orthomodular lattices can be built out of old one...
We construct pairs of orthogonal Latin Squares of order $n$ by means of suitable orthomorphisms of t...
This thesis deals with two related combinatorial topics, namely cyclotomic orthomorphisms and diagon...
This thesis deals with two related combinatorial topics, namely cyclotomic orthomorphisms and diagon...
The probability that two elements commute in a non-Abelian finite group is at most 5 8 . We prove se...
AbstractBeginning with the external point of view we show how orthomodular lattices may be “pasted” ...
In this paper, we study the orthogonality graphs (see Definition 1.2) of ortholattices. We provide a...
A partial orthomorphism of a group GG (with additive notation) is an injection π:S→G for some S⊆G su...
AbstractA polynomial f(X) over a finite field is an orthomorphism if both f(X) and f(X)-X are permut...
One problem of interest in the study of Latin squares is that of determining parameter pairs (n, r) ...
AbstractFor n 1, 5 (mod 6) it is shown that the dihedral group of order 4n admits a pair of orthog...
AbstractWe prove that if m>3 is odd and not divisible by 9 then we can construct a pair of orthogona...
AbstractWe improve the lower bound for N(24), the maximum size of a set of parwise orthogonal Latin ...
This book is about orthomorphisms and complete mappings of groups, and related constructions of orth...
An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x...
AbstractWe give a new construction showing how new orthomodular lattices can be built out of old one...
We construct pairs of orthogonal Latin Squares of order $n$ by means of suitable orthomorphisms of t...
This thesis deals with two related combinatorial topics, namely cyclotomic orthomorphisms and diagon...
This thesis deals with two related combinatorial topics, namely cyclotomic orthomorphisms and diagon...
The probability that two elements commute in a non-Abelian finite group is at most 5 8 . We prove se...
AbstractBeginning with the external point of view we show how orthomodular lattices may be “pasted” ...
In this paper, we study the orthogonality graphs (see Definition 1.2) of ortholattices. We provide a...
A partial orthomorphism of a group GG (with additive notation) is an injection π:S→G for some S⊆G su...
AbstractA polynomial f(X) over a finite field is an orthomorphism if both f(X) and f(X)-X are permut...
One problem of interest in the study of Latin squares is that of determining parameter pairs (n, r) ...