scholarly journals The Many Formulae for the Number of Latin Rectangles

10.37236/487 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Douglas S. Stones
Keyword(s):  
Closed Form ◽  
Latin Square ◽  
Latin Squares ◽  
Combinatorial Objects ◽  
Special Cases ◽  
Latin Rectangle ◽  
New Equation ◽  
The Many ◽  
Important Milestone

A $k \times n$ Latin rectangle $L$ is a $k \times n$ array, with symbols from a set of cardinality $n$, such that each row and each column contains only distinct symbols. If $k=n$ then $L$ is a Latin square. Let $L_{k,n}$ be the number of $k \times n$ Latin rectangles. We survey (a) the many combinatorial objects equivalent to Latin squares, (b) the known bounds on $L_{k,n}$ and approximations for $L_n$, (c) congruences satisfied by $L_{k,n}$ and (d) the many published formulae for $L_{k,n}$ and related numbers. We also describe in detail the method of Sade in finding $L_{7,7}$, an important milestone in the enumeration of Latin squares, but which was privately published in French. Doyle's formula for $L_{k,n}$ is given in a closed form and is used to compute previously unpublished values of $L_{4,n}$, $L_{5,n}$ and $L_{6,n}$. We reproduce the three formulae for $L_{k,n}$ by Fu that were published in Chinese. We give a formula for $L_{k,n}$ that contains, as special cases, formulae of (a) Fu, (b) Shao and Wei and (c) McKay and Wanless. We also introduce a new equation for $L_{k,n}$ whose complexity lies in computing subgraphs of the rook's graph.

scholarly journals On the completion of latin rectangles to symmetric latin squares

2004 ◽  
Vol 76 (1) ◽  
pp. 109-124 ◽  
Author(s):  
Darryn Bryant ◽  
C. A. Rodger
Keyword(s):  
Sufficient Conditions ◽  
Latin Square ◽  
Latin Squares ◽  
Necessary And Sufficient Conditions ◽  
Latin Rectangle ◽  
Necessary And Sufficient ◽  
Edge Colouring

AbstractWe find necessary and sufficient conditions for completing an arbitrary 2 by n latin rectangle to an n by n symmetric latin square, for completing an arbitrary 2 by n latin rectangle to an n by n unipotent symmetric latin square, and for completing an arbitrary 1 by n latin rectangle to an n by n idempotent symmetric latin square. Equivalently, we prove necessary and sufficient conditions for the existence of an (n−1)-edge colouring of Kn (n even), and for n-edge colouring of Kn (n odd) in which the colours assigned to the edges incident with two vertices are specified in advance.

Latin Squares with Prescribed Diagonals

1982 ◽  
Vol 34 (6) ◽  
pp. 1251-1254 ◽  
Author(s):  
A. J. W. Hilton ◽  
C. A. Rodger
Keyword(s):  
Latin Square ◽  
Latin Squares ◽  
Latin Rectangle

1. Introduction. An incomplete latin rectangle on t symbols σ1 …, σt of size r × s is an r × s matrix in which each cell is occupied by exactly one of the symbols σ1 …, σt in such a way that no symbol occurs more than once in any row or more than once in any column. If r = t or s = t then it is a latin rectangle; if r = s < t it is an incomplete latin square; if r = s = t it is a latin square. The diagonal of a latin square consists of the cells (i, i) (1 ≦ i ≦ t) together with the symbols occupying those cells. Let an allowed sequence of length t be a sequence of length t in which no symbol occurs exactly t – 1 times. Let an allowed diagonal of length t be a diagonal occupied by an allowed sequence.

Computing Cores for Existential Rules with the Standard Chase and ASP

2020 ◽  
Author(s):  
Markus Krötzsch
Keyword(s):  
Large Class ◽  
Data Exchange ◽  
Answer Set Programming ◽  
Query Answering ◽  
Universal Model ◽  
The Core ◽  
Universal Models ◽  
General Terms ◽  
Special Cases ◽  
The Many

To reason with existential rules (a.k.a. tuple-generating dependencies), one often computes universal models. Among the many such models of different structure and cardinality, the core is arguably the “best”. Especially for finitely satisfiable theories, where the core is the unique smallest universal model, it has advantages in query answering, non-monotonic reasoning, and data exchange. Unfortunately, computing cores is difficult and not supported by most reasoners. We therefore propose ways of computing cores using practically implemented methods from rule reasoning and answer set programming. Our focus is on cases where the standard chase algorithm produces a core. We characterise this desirable situation in general terms that apply to a large class of cores, derive concrete approaches for decidable special cases, and generalise these approaches to non-monotonic extensions of existential rules.

scholarly journals A Discussion of a Cryptographical Scheme Based in F-Critical Sets of a Latin Square

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 285
Author(s):  
Laura M. Johnson ◽  
Stephanie Perkins
Keyword(s):  
Necessary Conditions ◽  
Latin Square ◽  
Latin Squares ◽  
Critical Sets ◽  
Long Cycles ◽  
The Given

This communication provides a discussion of a scheme originally proposed by Falcón in a paper entitled “Latin squares associated to principal autotopisms of long cycles. Applications in cryptography”. Falcón outlines the protocol for a cryptographical scheme that uses the F-critical sets associated with a particular Latin square to generate access levels for participants of the scheme. Accompanying the scheme is an example, which applies the protocol to a particular Latin square of order six. Exploration of the example itself, revealed some interesting observations about both the structure of the Latin square itself and the autotopisms associated with the Latin square. These observations give rise to necessary conditions for the generation of the F-critical sets associated with certain autotopisms of the given Latin square. The communication culminates with a table which outlines the various access levels for the given Latin square in accordance with the scheme detailed by Falcón.

Thermal Stresses Due to Disturbance of Uniform Heat Flow by an Insulated Ovaloid Hole

1960 ◽  
Vol 27 (4) ◽  
pp. 635-639 ◽  
Author(s):  
A. L. Florence ◽  
J. N. Goodier
Keyword(s):  
Heat Flow ◽  
Closed Form ◽  
Thermal Stresses ◽  
Thermoelastic Problem ◽  
Uniform Heat ◽  
Special Cases

The linear thermoelastic problem is solved for a uniform heat flow disturbed by a hole of ovaloid form, which includes the ellipse and circle as special cases. Results for stress and displacement are found in closed form, by reducing the problem to one of boundary loading solvable by a method of Muskhelishvili.

scholarly journals Atomic Latin Squares based on Cyclotomic Orthomorphisms

10.37236/1919 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Ian M. Wanless
Keyword(s):  
Finite Fields ◽  
Complete Graph ◽  
Prime Order ◽  
Automorphism Groups ◽  
Latin Square ◽  
Latin Squares ◽  
Established Method ◽  
Cyclic Groups ◽  
Complete Bipartite Graphs ◽  
First Time

Atomic latin squares have indivisible structure which mimics that of the cyclic groups of prime order. They are related to perfect $1$-factorisations of complete bipartite graphs. Only one example of an atomic latin square of a composite order (namely 27) was previously known. We show that this one example can be generated by an established method of constructing latin squares using cyclotomic orthomorphisms in finite fields. The same method is used in this paper to construct atomic latin squares of composite orders 25, 49, 121, 125, 289, 361, 625, 841, 1369, 1849, 2809, 4489, 24649 and 39601. It is also used to construct many new atomic latin squares of prime order and perfect $1$-factorisations of the complete graph $K_{q+1}$ for many prime powers $q$. As a result, existence of such a factorisation is shown for the first time for $q$ in $\big\{$529, 2809, 4489, 6889, 11449, 11881, 15625, 22201, 24389, 24649, 26569, 29929, 32041, 38809, 44521, 50653, 51529, 52441, 63001, 72361, 76729, 78125, 79507, 103823, 148877, 161051, 205379, 226981, 300763, 357911, 371293, 493039, 571787$\big\}$. We show that latin squares built by the 'orthomorphism method' have large automorphism groups and we discuss conditions under which different orthomorphisms produce isomorphic latin squares. We also introduce an invariant called the train of a latin square, which proves to be useful for distinguishing non-isomorphic examples.

scholarly journals A Note on a Triple Integral

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2056
Author(s):  
Robert Reynolds ◽  
Allan Stauffer
Keyword(s):  
Closed Form ◽  
Closed Form Expression ◽  
Polynomial Functions ◽  
Fundamental Constants ◽  
Form Expression ◽  
Zero Distribution ◽  
Special Cases ◽  
Almost All

A closed form expression for a triple integral not previously considered is derived, in terms of the Lerch function. Almost all Lerch functions have an asymmetrical zero-distribution. The kernel of the integral involves the product of the logarithmic, exponential, quotient radical, and polynomial functions. Special cases are derived in terms of fundamental constants; results are summarized in a table. All results in this work are new.

scholarly journals On the Signatures of Ordered System Lifetimes

2014 ◽  
Vol 51 (1) ◽  
pp. 82-91 ◽  
Author(s):  
N. Balakrishnan ◽  
William Volterman
Keyword(s):  
Closed Form ◽  
Coherent Systems ◽  
Special Cases

The idea of the system signature is extended here to the case of ordered system lifetimes arising from a test of coherent systems with a signature. An expression is given for the computation of the ordered system signatures in terms of the usual system signature for system lifetimes. Some properties of the ordered system signatures are then established. Closed-form expressions for the ordered system signatures are obtained in some special cases, and some illustrative examples are presented.

Pairs of Latin Squares to Counterbalance Sequential Effects and Pairing of Conditions and Stimuli

1989 ◽  
Vol 33 (18) ◽  
pp. 1223-1227 ◽  
Author(s):  
James R. Lewis
Keyword(s):  
Human Factors ◽  
Repeated Measures ◽  
Random Sequence ◽  
Latin Square ◽  
Latin Squares ◽  
Sequential Effects ◽  
Long Run ◽  
Within Subjects ◽  
Human Factors Research

This paper discusses methods with which one can simultaneously counterbalance immediate sequential effects and pairing of conditions and stimuli in a within-subjects design using pairs of Latin squares. Within-subjects (repeated measures) experiments are common in human factors research. The designer of such an experiment must develop a scheme to ensure that the conditions and stimuli are not confounded, or randomly order stimuli and conditions. While randomization ensures balance in the long run, it is possible that a specific random sequence may not be acceptable. An alternative to randomization is to use Latin squares. The usual Latin square design ensures that each condition appears an equal number of times in each column of the square. Latin squares have been described which have the effect of counterbalancing immediate sequential effects. The objective of this work was to extend these earlier efforts by developing procedures for designing pairs of Latin squares which ensure complete counterbalancing of immediate sequential effects for both conditions and stimuli, and also ensure that conditions and stimuli are paired in the squares an equal number of times.

Complete Diagonals of Latin Squares

1979 ◽  
Vol 22 (4) ◽  
pp. 477-481 ◽  
Author(s):  
Gerard J. Chang
Keyword(s):  
Latin Square ◽  
Latin Squares ◽  
Special Case

AbstractJ. Marica and J. Schönhein [4], using a theorem of M. Hall, Jr. [3], see below, proved that if any n − 1 arbitrarily chosen elements of the diagonal of an n × n array are prescribed, it is possible to complete the array to form an n × n latin square. This result answers affirmatively a special case of a conjecture of T. Evans [2], to the effect that an n × n incomplete latin square with at most n − 1 places occupied can be completed to an n × n latin square. When the complete diagonal is prescribed, it is easy to see that a counterexample is provided by the case that one letter appears n − 1 times on the diagonal and a second letter appears once. In the present paper, we prove that except in this case the completion to a full latin square is always possible. Completion to a symmetric latin square is also discussed.

Sign in / Sign up

Export Citation Format

Share Document