A census of critical sets in the Latin squares of order at most six

A critical set in a Latin square of order n is a set of entries from the square which can be embedded in precisely one Latin square of order n, Such that if any element of the critical set. is deleted, the remaining set can be embedded, in more than one Latin square of order n.. In this paper we find all the critical sets of different sizes in the Latin squares of order at most six. We count the number of main and isotopy classes of these critical sets and classify critical sets from the main classes into various strengths. Some observations are made about the relationship between the numbers of classes, particularly in the 6 x 6 case. Finally some examples are given of each type of critical set.

On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.

On the completion of Latin rectangles to symmetric Latin squares

We 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 K-n (n even), and for an n-edge colouring of K-n (n odd) in which the colours assigned to the edges incident with two vertices are specified in advance.

An investigation of 2-critical sets in latin squares

In this paper we focus on the existence of 2-critical sets in the latin square corresponding to the elementary abelian 2-group of order 2(n). It has been shown by Stinson and van Rees that this latin square contains a 2-critical set of volume 4(n) - 3(n). We provide constructions for 2-critical sets containing 4(n) - 3(n) + 1 - (2(k-1) + 2(m-1) + 2(n-(k+m+1))) entries, where 1 less than or equal to k less than or equal to n and 1 less than or equal to m less than or equal to n - k. That is, we construct 2-critical sets for certain values less than 4(n) - 3(n) + 1 - 3 (.) 2([n /3]-1). The results raise the interesting question of whether, for the given latin square, it is possible to construct 2-critical sets of volume m, where 4(n) - 3(n) + 1 - 3 (.) 2([n/3]-1) < m < 4(n) - 3(n).

Self-assembly of a charge-neutral molecular square

Complexation of cadmium(II) by the ditopic (bis-tridentate) thiocarbazone ligand 1,5-bis(6-methyl-2-pyridylmethylene) thiocarbonohydrazide, H2L1, results in the self-assembly of a charge-neutral 2 x 2 molecular grid, [Cd-4(L-1)(4)], comprising four metals and four ligands in an interlocked cyclic array. The solid-state structure of this tetramer has been established by X-ray crystallography and in solution by H-1 NMR spectroscopy. The presence of lower molecular weight oligomers was identified by both NMR and ESI-MS.

3-Homogeneous latin trades

Let T be a partial latin square and L be a latin square with T subset of L. We say that T is a latin trade if there exists a partial latin square T' with T' boolean AND T = theta such that (LT) U T' is a latin square. A k-homogeneous latin trade is one which intersects each row, each column and each entry either 0 or k times. In this paper, we construct 3-homogeneous latin trades from hexagonal packings of the plane with circles. We show that 3-homogeneous latin trades of size 3 m exist for each m >= 3. This paper discusses existence results for latin trades and provides a glueing construction which is subsequently used to construct all latin trades of finite order greater than three. Crown Copyright (c) 2005 Published by Elsevier B.V. All rights reserved.

A new class of critical sets in Latin squares

Previously the process of finding critical sets in Latin squares has been inside cumbersome by the complexity and number of Latin trades that, must be constructed. In this paper we develop a theory of Latin trades that yields more transparent constructions. We use these Latin trades to find a new class of critical sets for Latin squares which are a product of the Latin square of order 2 with a. back circulant Latin square of odd order.

Ultra-cold fermions in optical lattices

We summarize recent theoretical results for the signatures of strongly correlated ultra-cold fermions in optical lattices. In particular, we focus on collective mode calculations, where a sharp decrease in collective mode frequency is predicted at the onset of the Mott metal-insulator transition; and correlation functions at finite temperature, where we employ a new exact technique that applies the stochastic gauge technique with a Gaussian operator basis.

Anomalous Excitation Spectra of Frustrated Quantum Antiferromagnets

We use series expansions to study the excitation spectra of spin-1/2 antiferromagnets on anisotropic triangular lattices. For the isotropic triangular lattice model (TLM), the high-energy spectra show several anomalous features that differ strongly from linear spin-wave theory (LSWT). Even in the Neel phase, the deviations from LSWT increase sharply with frustration, leading to rotonlike minima at special wave vectors. We argue that these results can be interpreted naturally in a spinon language and provide an explanation for the previously observed anomalous finite-temperature properties of the TLM. In the coupled-chains limit, quantum renormalizations strongly enhance the one-dimensionality of the spectra, in agreement with experiments on Cs2CuCl4.

Automated layout of small lattices using layer diagrams

Good quality concept lattice drawings are required to effectively communicate logical structure in Formal Concept Analysis. Data analysis frameworks such as the Toscana System use manually arranged concept lattices to avoid the problem of automatically producing high quality lattices. This limits Toscana systems to a finite number of concept lattices that have been prepared a priori. To extend the use of formal concept analysis, automated techniques are required that can produce high quality concept lattice drawings on demand. This paper proposes and evaluates an adaption of layer diagrams to improve automated lattice drawing. © Springer-Verlag Berlin Heidelberg 2006.

Critical behavior of one-particle spectral weights in the transverse Ising model

We investigate the critical behavior of the spectral weight of a single quasiparticle, one of the key observables in experiment, for the particular case of the transverse Ising model. Series expansions are calculated for the linear chain and the square and simple cubic lattices. For the chain model, a conjectured exact result is discovered. For the square and simple cubic lattices, series analyses are used to estimate the critical exponents. The results agree with the general predictions of Sachdev [Quantum Phase Transitions (Cambridge University Press, Cambridge, England, 1999)].