阶数不超过4的交叉超立方体是点可迁的

P Kulasinghe and S Bettayeb showed that any multiply-twisted hypercube with five or more dimensions is not vertex-transitive. This note shows that any multiply-twisted hypercube with four or less dimensions is vertex-transitive, and that any multiply-twisted hypercube with three or larger dimensions is not edge-transitive.     

Groupoids with quasigroup and Latin square properties

Connections of some groupoid identities with the quasigroup and Latin square properties are investigated using combinatorial methods.     

An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6

This paper presents an alternative proof for the non-existence of orthogonal Latin squares of order 6. Our method is algebraic, rather than enumerative, and applies linear programming in order to obtain appropriate dual vectors. The proof is achievable only after extending previously known results for symmetry elimination.     

Hyperovals in nets of small degree

The existence of an r‐net of order n with a hyperoval is proved for r = 5 when n ≥ 63; for r = 7 when n ≥ 84; for r = 9 when n ≥ 59,573 and for r = 15 when n ≥ 1, 873,273. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 322–334, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10018     

On Codes Identifying Sets of Vertices in Hamming Spaces

A code is called (t, 2)-identifying if for all the words x, y(x y) and the sets (B _t (x) B _t (y)) C and are nonempty and different. Constructions of such codes and a lower bound on the cardinality of these codes are given. The lower bound is shown to be sharp in some cases. We also discuss a more general notion of -identifying codes and introduce weakly identifying codes.     

Existence of (3, 1, 2)‐conjugate orthogonal diagonal latin squares

We shall refer to a diagonal Latin square which is orthogonal to its (3,1,2)‐conjugate, and the latter is also a diagonal Latin square, as a (3,1, 2)‐conjugate orthogonal diagonal Latin square, briefly CODLS. This article investigates the spectrum of CODLS and it is found that it contains all positive integers υ except 2, 3, 6, and possibly 10. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 297–308, 2001     

Predictive modeling and analysis of HfO2 thin film process based on Bayesian information criterion using PCA‐based neural networks

Principal component analysis (PCA)‐based neural network (NNet) models of HfO₂ thin films are used to study the process of efficient model selection and develop an improved model by using multivariate functional data such as X‐ray diffraction data (XRD). The accumulation capacitance and the hysteresis index input parameters, both characteristic of HfO₂ dielectric films, were selected for the inclusion in the model by analyzing the process conditions. Standardized XRD were used to analyze the characteristic variations for different process conditions; the responses and the electrical properties were predicted by NNet modeling using crystallinity‐based measurement data. A Bayesian information criterion (BIC) was used to compare the model efficiency and to select an improved model for response prediction. Two conclusions summarize the results of the research documented in this paper: (i) physical or material properties can be predicted by the PCA‐based NNet model using large‐dimension data, and (ii) BIC can be used for the selection and evaluation of predictive models in semiconductor manufacturing processes. Copyright © 2013 John Wiley & Sons, Ltd.     

Near‐automorphisms of Latin squares

We define a near‐automorphism α of a Latin square L to be an isomorphism such that L and α L differ only within a 2 × 2 subsquare. We prove that for all n≥2 except n∈{3, 4}, there exists a Latin square which exhibits a near‐automorphism. We also show that if α has the cycle structure (2, n ? 2), then L exists if and only if n≡2 (mod 4), and can be constructed from a special type of partial orthomorphism. Along the way, we generalize a theorem by Marshall Hall, which states that any Latin rectangle can be extended to a Latin square. We also show that if α has at least 2 fixed points, then L must contain two disjoint non‐trivial subsquares. Copyright © 2011 John Wiley & Sons, Ltd. 19:365‐377, 2011     

An improved approximation algorithm for the partial Latin square extension problem

Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulation. We present an e/(e−1)-approximation algorithm that is based on the LP relaxation of a packing IP formulation of the PLSE problem.     

Latin bitrades derived from groups

A Latin bitrade is a pair of partial Latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same set of entries. In [A. Drápal, On geometrical structure and construction of Latin trades, Advances in Geometry (in press)] it is shown that a Latin bitrade may be thought of as three derangements of the same set, whose product is the identity and whose cycles pairwise have at most one point in common. By letting a group act on itself by right translation, we show how some Latin bitrades may be derived directly from groups. Properties of Latin bitrades such as homogeneity, minimality (via thinness) and orthogonality may also be encoded succinctly within the group structure. We apply the construction to some well-known groups, constructing previously unknown Latin bitrades. In particular, we show the existence of minimal, k-homogeneous Latin bitrades for each odd k≥3. In some cases these are the smallest known such examples.