Page 1

Displaying 1 – 9 of 9

Showing per page

Commutative subloop-free loops

Martin Beaudry, Louis Marchand (2011)

Commentationes Mathematicae Universitatis Carolinae

We describe, in a constructive way, a family of commutative loops of odd order, n 7 , which have no nontrivial subloops and whose multiplication group is isomorphic to the alternating group 𝒜 n .

Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results

Diane M. Donovan, Mike Grannell, Emine Ş. Yazıcı (2020)

Commentationes Mathematicae Universitatis Carolinae

We review results for the embedding of orthogonal partial Latin squares in orthogonal Latin squares, comparing and contrasting these with results for embedding partial Latin squares in Latin squares. We also present a new construction that uses the existence of a set of t mutually orthogonal Latin squares of order n to construct a set of 2 t mutually orthogonal Latin squares of order n t .

Construction of the mutually orthogonal extraordinary supersquares

Cristian Ghiu, Iulia Ghiu (2014)

Open Mathematics

Our purpose is to determine the complete set of mutually orthogonal squares of order d, which are not necessary Latin. In this article, we introduce the concept of supersquare of order d, which is defined with the help of its generating subgroup in 𝔽 d × 𝔽 d . We present a method of construction of the mutually orthogonal supersquares. Further, we investigate the orthogonality of extraordinary supersquares, a special family of squares, whose generating subgroups are extraordinary. The extraordinary subgroups...

Construction, properties and applications of finite neofields

Anthony Donald Keedwell (2000)

Commentationes Mathematicae Universitatis Carolinae

We give a short account of the construction and properties of left neofields. Most useful in practice seem to be neofields based on the cyclic group and particularly those having an additional divisibility property, called D-neofields. We shall give examples of applications to the construction of orthogonal latin squares, to the design of tournaments balanced for residual effects and to cryptography.

Cyclic and dihedral constructions of even order

Aleš Drápal (2003)

Commentationes Mathematicae Universitatis Carolinae

Let G ( ) and G ( * ) be two groups of finite order n , and suppose that they share a normal subgroup S such that u v = u * v if u S or v S . Cases when G / S is cyclic or dihedral and when u v u * v for exactly n 2 / 4 pairs ( u , v ) G × G have been shown to be of crucial importance when studying pairs of 2-groups with the latter property. In such cases one can describe two general constructions how to get all possible G ( * ) from a given G = G ( ) . The constructions, denoted by G [ α , h ] and G [ β , γ , h ] , respectively, depend on a coset α (or two cosets β and γ ) modulo S , and on an...

Currently displaying 1 – 9 of 9

Page 1