Perfect 2-colorings of a hypercube

A coloring of the vertices of a graph is called perfect if the multiset of colors of all neighbors of a vertex depends only on its own color. We study the possible parameters of perfect 2-colorings of the n-dimensional cube. Some necessary conditions are obtained for existence of such colorings. A new recursive construction of such colorings is found, which produces colorings for all known and infinitely many new parameter sets.     

On invertible terraces for non‐abelian groups

We give several constructions for invertible terraces and invertible directed terraces. These enable us to give the first known infinite families of invertible terrraces, both directed and undirected, for non‐abelian groups. In particular, we show that all generalized dicyclic groups of orders 24k + 4 and 24k + 20 have an invertible directed terrace and that all groups of the form A × G have an invertible terrace, where A is an (possibly trivial) abelian group of odd order and G is any one of: (i) a generalized dihedral group of order 12k + 2 or 12k + 10; (ii) a generalized dicyclic group of order 24k + 4 or 24k + 20; (iii) a non‐abelian group of order n with 10 ≤ n ≤ 21; (iv) a non‐abelian binary group of order n with 24 ≤ n ≤ 42. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 437–447, 2007     

A lower bound for the number of triangular embeddings of some complete graphs and complete regular tripartite graphs

We prove that, for a certain positive constant a and for an infinite set of values of n, the number of nonisomorphic triangular embeddings of the complete graph K_n is at least n^an2. A similar lower bound is also given, for an infinite set of values of n, on the number of nonisomorphic triangular embeddings of the complete regular tripartite graph K_n,n,n.     

Multi-criteria robust design of a JIT-based cross-docking distribution center for an auto parts supply chain

We present a solution framework based on discrete-event simulation and enhanced robust design technique to address a multi-response optimization problem inherent in logistics management. The objective is to design a robust configuration for a cross-docking distribution center so that the system is insensitive to the disturbances of supply uncertainty, and provides steady parts supply to downstream assembly plants. In the proposed approach, we first construct a simulation model using factorial design and central composite design (CCD), and then identify the models that best describe the relationship between the simulation responses and system factors. We employ the response surface methodology (RSM) to identify factor levels that would maximize system potential.     

Developing nanotechnology in Latin America

This article investigates the development of nanotechnology in Latin America with a particular focus on Argentina, Brazil, Chile, and Uruguay. Based on data for nanotechnology research publications and patents and suggesting a framework for analyzing the development of R&D networks, we identify three potential strategies of nanotechnology research collaboration. Then, we seek to identify the balance of emphasis upon each of the three strategies by mapping the current research profile of those four countries. In general, we find that they are implementing policies and programs to develop nanotechnologies but differ in their collaboration strategies, institutional involvement, and level of development. On the other hand, we find that they coincide in having a modest industry participation in research and a low level of commercialization of nanotechnologies.

The parity of the number of quasigroups

Let I(n) be the number of isomorphism classes of quasigroups of order n. Despite prior enumerations showing that I(n) is odd for 1≤n≤11, we find that I(12) is even. We also give a method for finding the parity of I(n), which we use to show that I(n) is odd for n∈{13,14,15,16,17,19,21}.     

Affine Mendelsohn triple systems and the Eisenstein integers

We define a Mendelsohn triple system (MTS) of order coprime with 3, and having multiplication affine over an abelian group, to be affine, nonramified. By exhibiting a one‐to‐one correspondence between isomorphism classes of affine MTS and those of modules over the Eisenstein integers, we solve the isomorphism problem for affine, nonramified MTS and enumerate these isomorphism classes (extending the work of Donovan, Griggs, McCourt, Opr?al, and Stanovský). As a consequence, all entropic MTSs of order coprime with 3 and distributive MTS of order coprime with 3 are classified. Partial results on the isomorphism problem for affine MTS with order divisible by 3 are given, and a complete classification is conjectured. We also prove that for any affine MTS, the qualities of being nonramified, pure, and self‐orthogonal are equivalent.     

The number of transversals in a Latin square

A Latin Square of order n is an n × n array of n symbols, in which each symbol occurs exactly once in each row and column. A transversal is a set of n entries, one selected from each row and each column of a Latin Square of order n such that no two entries contain the same symbol. Define T(n) to be the maximum number of transversals over all Latin squares of order n. We show that for n ≥ 5, where b ≈ 1.719 and c ≈ 0.614. A corollary of this result is an upper bound on the number of placements of n non-attacking queens on an n × n toroidal chess board. Some divisibility properties of the number of transversals in Latin squares based on finite groups are established. We also provide data from a computer enumeration of transversals in all Latin Squares of order at most 9, all groups of order at most 23 and all possible turn-squares of order 14.     

A New Chaotic Image Encryption Algorithm Based on Transversals in a Latin Square

In this paper, a new combinatorial structure is introduced for image encryption, which has an excellent encryption effect on security and efficiency. An n-transversal in a Latin square has the function of classifying all the matrix’s positions, and it can provide a pair of orthogonal Latin squares. Employing an n-transversal of a Latin square, we can permutate all the pixels of an image group by group for the first time, then use two Latin squares for auxiliary diffusion based on a chaotic sequence, and finally, make use of a pair of orthogonal Latin squares to perform the second scrambling. The whole encryption process is “scrambling–diffusion–scrambling”. The experimental results indicated that this algorithm passed various tests and achieved a secure and fast encryption effect, which outperformed many of the latest papers. The final information entropy was very close to 8, and the correlation coefficient was approximately 0. All these tests verified the robustness and practicability of the proposed algorithm.     

Further Results on Large Sets of Resolvable Idempotent Latin Squares

An idempotent Latin square of order v is called resolvable and denoted by RILS(v) if the off‐diagonal cells can be resolved into disjoint transversals. A large set of resolvable idempotent Latin squares of order v, briefly LRILS(v), is a collection of RILS(v)s pairwise agreeing on only the main diagonal. In this paper, it is established that there exists an LRILS(v) for any positive integer , except for , and except possibly for .