Mean anisotropy of homogeneous Gaussian random fields and anisotropic norms of linear translation-invariant operators on multidimensional integer lattices

Sensitivity of output of a linear operator to its input can be quantified in various ways. In Control Theory, the input is usually interpreted as disturbance and the output is to be minimized in some sense. In stochastic worst-case design settings, the disturbance is considered random with imprecisely known probability distribution. The prior set of probability measures can be chosen so as to quantify how far the disturbance deviates from the white-noise hypothesis of Linear Quadratic Gaussian control. Such deviation can be measured by the minimal Kullback-Leibler informational divergence from the Gaussian distributions with zero mean and scalar covariance matrices. The resulting anisotropy functional is defined for finite power random vectors. Originally, anisotropy was introduced for directionally generic random vectors as the relative entropy of the normalized vector with respect to the uniform distribution on the unit sphere. The associated a-anisotropic norm of a matrix is then its maximum root mean square or average energy gain with respect to finite power or directionally generic inputs whose anisotropy is bounded above by a≥0. We give a systematic comparison of the anisotropy functionals and the associated norms. These are considered for unboundedly growing fragments of homogeneous Gaussian random fields on multidimensional integer lattice to yield mean anisotropy. Correspondingly, the anisotropic norms of finite matrices are extended to bounded linear translation invariant operators over such fields.

Atomic Latin squares of order eleven

A Latin square is pan-Hamiltonian if the permutation which defines row i relative to row j consists of a single cycle for every i j. A Latin square is atomic if all of its conjugates are pan-Hamiltonian. We give a complete enumeration of atomic squares for order 11, the smallest order for which there are examples distinct from the cyclic group. We find that there are seven main classes, including the three that were previously known. A perfect 1-factorization of a graph is a decomposition of that graph into matchings such that the union of any two matchings is a Hamiltonian cycle. Each pan-Hamiltonian Latin square of order n describes a perfect 1-factorization of Kn,n, and vice versa. Perfect 1-factorizations of Kn,n can be constructed from a perfect 1-factorization of Kn+1. Six of the seven main classes of atomic squares of order 11 can be obtained in this way. For each atomic square of order 11, we find the largest set of Mutually Orthogonal Latin Squares (MOLS) involving that square. We discuss algorithms for counting orthogonal mates, and discover the number of orthogonal mates possessed by the cyclic squares of orders up to 11 and by Parker's famous turn-square. We find that the number of atomic orthogonal mates possessed by a Latin square is not a main class invariant. We also define a new sort of Latin square, called a pairing square, which is mapped to its transpose by an involution acting on the symbols. We show that pairing squares are often orthogonal mates for symmetric Latin squares. Finally, we discover connections between our atomic squares and Franklin's diagonally cyclic self-orthogonal squares, and we correct a theorem of Longyear which uses tactical representations to identify self-orthogonal Latin squares in the same main class as a given Latin square.

Temperature dependence of the magnetic susceptibility for triangular-lattice antiferromagnets with spatially anisotropic exchange constants

We present the temperature dependence of the uniform susceptibility of spin-half quantum antiferromagnets on spatially anisotropic triangular lattices, using high-temperature series expansions. We consider a model with two exchange constants J1 and J2 on a lattice that interpolates between the limits of a square lattice (J1=0), a triangular lattice (J2=J1), and decoupled linear chains (J2=0). In all cases, the susceptibility, which has a Curie-Weiss behavior at high temperatures, rolls over and begins to decrease below a peak temperature Tp. Scaling the exchange constants to get the same peak temperature shows that the susceptibilities for the square lattice and linear chain limits have similar magnitudes near the peak. Maximum deviation arises near the triangular-lattice limit, where frustration leads to much smaller susceptibility and with a flatter temperature dependence. We compare our results to the inorganic materials Cs2CuCl4 and Cs2CuBr4 and to a number of organic molecular crystals. We find that the former (Cs2CuCl4 and Cs2CuBr4) are weakly frustrated and their exchange parameters determined through the temperature dependence of the susceptibility are in agreement with neutron-scattering measurements. In contrast, the organic materials considered are strongly frustrated with exchange parameters near the isotropic triangular-lattice limit.

Phase diagram for a class of spin-1/2 Heisenberg models interpolating between the square-lattice, the triangular-lattice, and the linear-chain limits

We study the spin-1/2 Heisenberg models on an anisotropic two-dimensional lattice which interpolates between the square lattice at one end, a set of decoupled spin chains on the other end, and the triangular-lattice Heisenberg model in between. By series expansions around two different dimer ground states and around various commensurate and incommensurate magnetically ordered states, we establish the phase diagram for this model of a frustrated antiferromagnet. We find a particularly rich phase diagram due to the interplay of magnetic frustration, quantum fluctuations, and varying dimensionality. There is a large region of the usual two-sublattice Neel phase, a three-sublattice phase for the triangular-lattice model, a region of incommensurate magnetic order around the triangular-lattice model, and regions in parameter space where there is no magnetic order. We find that the incommensurate ordering wave vector is in general altered from its classical value by quantum fluctuations. The regime of weakly coupled chains is particularly interesting and appears to be nearly critical. [S0163-1829(99)10421-1].

Smallest weak and smallest totally weak critical sets in the latin squares of order at most seven

A critical set in a latin square of order n is a set of entries in a latin square which can be embedded in precisely one latin square of order n. Also, 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 smallest weak and smallest totally weak critical sets for all the latin squares of orders six and seven. Moreover, we computationally prove that there is no (totally) weak critical set in the back circulant latin square of order five and we find a totally weak critical set of size seven in the other main class of latin squares of order five.

On the direct product of two weak uniquely completable partial latin squares

In this note we show by counter-example that the direct product of two weak uniquely completable partial latin squares is not necessarily a uniquely completable partial latin square. This counter-example rejects a conjecture by Gower (see [3]) on the direct product of two uniquely completable partial latin squares.

Steiner trades that give rise to completely decomposable latin interchanges

In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decomposed into six disjoint latin interchanges.

Overlarge sets of 2-(11, 5, 2) designs and related configurations

We consider the construction of several configurations, including: • overlarge sets of 2-(11,5,2) designs, that is, partitions of the set of all 5-subsets of a 12-set into 72 2-(11,5,2) designs; • an indecomposable doubly overlarge set of 2-(11,5,2) designs, that is, a partition of two copies of the set of all 5-subsets of a 12-set into 144 2-(11,5,2) designs, such that the 144 designs can be arranged into a 12 × 12 square with interesting row and column properties; • a partition of the Steiner system S(5,6,12) into 12 disjoint 2-(11,6,3) designs arising from the diagonal of the square; • bidistant permutation arrays and generalized Room squares arising from the doubly overlarge set, and their relation to some new strongly regular graphs.