Latin Squares without Orthogonal Mates

In 1779 Euler proved that for every even n there exists a latin square of order n that has no orthogonal mate, and in 1944 Mann proved that for every n of the form 4k + 1, k ≥ 1, there exists a latin square of order n that has no orthogonal mate. Except for the two smallest cases, n = 3 and n = 7, it is not known whether a latin square of order n = 4k + 3 with no orthogonal mate exists or not. We complete the determination of all n for which there exists a mate-less latin square of order n by proving that, with the exception of n = 3, for all n = 4k + 3 there exists a latin square of order n with no orthogonal mate. We will also show how the methods used in this paper can be applied more generally by deriving several earlier non-orthogonality results.     

Constructing orthogonal pandiagonal Latin squares and panmagic squares from modular n‐queens solutions

In this article, we show how to construct pairs of orthogonal pandiagonal Latin squares and panmagic squares from certain types of modular n‐queens solutions. We prove that when these modular n‐queens solutions are symmetric, the panmagic squares thus constructed will be associative, where for an n × n associative magic square A = (a_ij), for all i and j it holds that a_ij + an?i?1,n?j?1 = c for a fixed c. We further show how to construct orthogonal Latin squares whose modular difference diagonals are Latin from any modular n‐queens solution. As well, we analyze constructing orthogonal pandiagonal Latin squares from particular classes of non‐linear modular n‐queens solutions. These pandiagonal Latin squares are not row cyclic, giving a partial solution to a problem of Hedayat. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 221–234, 2007     

A note on the thermodynamics of dimanganese and dirhenium decacarbonyls

The results of low temperature heat capacity studies on Mn₂(CO)₁₀(s) and Re₂(CO)₁₀(s) are compared with literature reports. It is shown that the values of vaporization enthalpies and entropies correspond with those of the low temperature stable phase.     

On the threshold problem for Latin boxes

Let m ≤ n ≤ k. An m × n × k 0‐1 array is a Latin box if it contains exactly m n ones, and has at most one 1 in each line. As a special case, Latin boxes in which m = n = k are equivalent to Latin squares. Let be the distribution on m × n × k 0‐1 arrays where each entry is 1 with probability p, independently of the other entries. The threshold question for Latin squares asks when contains a Latin square with high probability. More generally, when does support a Latin box with high probability? Let ε > 0. We give an asymptotically tight answer to this question in the special cases where n = k and , and where n = m and . In both cases, the threshold probability is . This implies threshold results for Latin rectangles and proper edge‐colorings of K_n,n.     

一类正交空间填充设计的构造

空间填充设计在计算机试验中应用十分广泛,当拟合回归模型时,正交的空间填充设计保证了因子效应估计的独立性.基于广义正交设计,文章给出了构造二阶正交拉丁超立方体设计和列正交设计的方法,新构造的设计不仅满足任意两列之间相互正交,还能保证每一列与任一列元素平方组成的列以及任两列元素相乘组成的列都正交.当某些正交的空间填充设计不存在时,具有较小相关系数的近似正交设计可作为替代设计使用.设计构造的灵活性为计算机试验在实践中的广泛应用提供了必要的支持.     

Human Y‐chromosome SNP characterization by multiplex amplified product‐length polymorphism analysis

We designed an allele‐specific amplification protocol to optimize Y‐chromosome SNP typing, which is an unavoidable step for defining the phylogenetic status of paternal lineages. It allows the simultaneous highly specific definition of up to six mutations in a single reaction by amplification fragment length polymorphism (AFLP) without the need of specialized equipment, at a considerably lower cost than that based on single‐base primer extension (SNaPshot?) technology or PCR‐RFLP systems, requiring as little as 0.5 ng DNA and compatible with the small fragments characteristic of low‐quality DNA. By designation of two primers recognizing the derived and ancestral state for each SNP, which can be differentiated by size by the addition of a noncomplementary nucleotide tail, we could define major Y clades E, F, K, R, Q, and subhaplogroups R1, R1a, R1b, R1b1b, R1b1c, J1, J2, G1, G2, I1, Q1a3, and Q1a3a1 through amplification fragments that ranged between 60 and 158bp.     

Medicinal Properties and Bioactive Compounds from Wild Mushrooms Native to North America

Mushrooms, the fruiting bodies of fungi, are known for a long time in different cultures around the world to possess medicinal properties and are used to treat various human diseases. Mushrooms that are parts of traditional medicine in Asia had been extensively studied and this has led to identification of their bioactive ingredients. North America, while home to one of the world’s largest and diverse ecological systems, has not subjected its natural resources especially its diverse array of mushroom species for bioprospecting purposes: Are mushrooms native to North America a good source for drug discovery? In this review, we compile all the published studies up to September 2020 on the bioprospecting of North American mushrooms. Out of the 79 species that have been investigated for medicinal properties, 48 species (60%) have bioactivities that have not been previously reported. For a mere 16 selected species, 17 new bioactive compounds (10 small molecules, six polysaccharides and one protein) have already been isolated. The results from our literature search suggest that mushrooms native to North America are indeed a good source for drug discovery.     

The Order of Automorphisms of Quasigroups

We prove quadratic upper bounds on the order of any autotopism of a quasigroup or Latin square, and hence also on the order of any automorphism of a Steiner triple system or 1‐factorization of a complete graph. A corollary is that a permutation σ chosen uniformly at random from the symmetric group will almost surely not be an automorphism of a Steiner triple system of order n, a quasigroup of order n or a 1‐factorization of the complete graph . Nor will σ be one component of an autotopism for any Latin square of order n. For groups of order n it is known that automorphisms must have order less than n, but we show that quasigroups of order n can have automorphisms of order greater than n. The smallest such quasigroup has order 7034. We also show that quasigroups of prime order can possess autotopisms that consist of three permutations with different cycle structures. Our results answer three questions originally posed by D.  Stones.     

Classification of Graeco‐Latin Cubes

A q‐ary code of length n, size M, and minimum distance d is called an code. An code with is said to be maximum distance separable (MDS). Here one‐error‐correcting () MDS codes are classified for small alphabets. In particular, it is shown that there are unique (5, 5³, 3)₅ and (5, 7³, 3)₇ codes and equivalence classes of (5, 8³, 3)₈ codes. The codes are equivalent to certain pairs of mutually orthogonal Latin cubes of order q, called Graeco‐Latin cubes.     

Centered -discrepancy of random sampling and Latin hypercube design, and construction of uniform designs

In this paper properties and construction of designs under a centered version of the -discrepancy are analyzed. The theoretic expectation and variance of this discrepancy are derived for random designs and Latin hypercube designs. The expectation and variance of Latin hypercube designs are significantly lower than that of random designs. While in dimension one the unique uniform design is also a set of equidistant points, low-discrepancy designs in higher dimension have to be generated by explicit optimization. Optimization is performed using the threshold accepting heuristic which produces low discrepancy designs compared to theoretic expectation and variance.