由正交拉丁方导出的一族新的结合方案

<正> 部分平衡不完备区组(PBIB)设计(以下简称部分平衡设计),作为平衡不完备区组(BIB)设计的推广,最初由Bose-Nair引进.后来,Bose-Shimamoto为了阐明部分平衡设计的实验数据的统计分析,明确地引进了结合方案的概念.本文的目的是利用具有     

Complete Sets of Mutually Orthogonal Hypercubes and Their Connections to Affine Resolvable Designs

. Recently, Laywine and Mullen proved several generalizations of Bose's equivalence between the existence of complete sets of mutually orthogonal Latin squares of order n and the existence of affine planes of order n. Laywine further investigated the relationship between sets of orthogonal frequency squares and affine resolvable balanced incomplete block designs. In this paper we generalize several of Laywine's results that were derived for frequency squares. We provide sufficient conditions for construction of an affine resolvable design from a complete set of mutually orthogonal Youden frequency hypercubes; we also show that, starting with a complete set of mutually equiorthogonal frequency hypercubes, an analogous construction can always be done. In addition, we give conditions under which an affine resolvable design can be converted to a complete set of mutually orthogonal Youden frequency hypercubes or a complete set of mutually equiorthogonal frequency hypercubes.     

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 K_n,n, and vice versa. Perfect 1‐factorizations of K_n,n can be constructed from a perfect 1‐factorization of K_n+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. © 2003 Wiley Periodicals, Inc.     

On a generalization of Hua’s theorem with five squares of primes

We sharpen Hua’s theorem with five squares of primes by proving that every sufficiently large integer N congruent to 5 modulo 24 can be written in the form

Eigenschaften von vollstaendigen Systemen orthogonaler lateinischer Quadrate,die bestimmte affine Ebenen repraesentieren

A set of n-1 mutually orthogonal Latin squares of order n is a model of an affine plane with exactly n points on a line and every affine plane with n points on a line can be represented by n-1 mutually orthogonal Latin squares ([1]). In this paper we investigate properties of finite planes through the complete set of mutually orthogonal Latin squares representing the plane and mainly — vice versa — properties of the squares representing a fixed plane. The results are based on the geometrical configurations which hold in the planes. For presumed definitions and theorems which are not specially referred to see [4], [7], [3] or [6].     

Why there is no an existence theorem for a convex polytope with prescribed directions and perimeters of the faces?

We choose some special unit vectors \({\mathbf {n}}_1,\ldots ,{\mathbf {n}}_5\) in \({\mathbb {R}}^3\) and denote by \({\mathscr {L}}\subset {\mathbb {R}}^5\) the set of all points \((L_1,\ldots ,L_5)\in {\mathbb {R}}^5\) with the following property: there exists a compact convex polytope \(P\subset {\mathbb {R}}^3\) such that the vectors \({\mathbf {n}}_1,\ldots ,{\mathbf {n}}_5\) (and no other vector) are unit outward normals to the faces of P and the perimeter of the face with the outward normal \({\mathbf {n}}_k\) is equal to \(L_k\) for all \(k=1,\ldots ,5\). Our main result reads that \({\mathscr {L}}\) is not a locally-analytic set, i.e., we prove that, for some point \((L_1,\ldots ,L_5)\in {\mathscr {L}}\), it is not possible to find a neighborhood \(U\subset {\mathbb {R}}^5\) and an analytic set \(A\subset {\mathbb {R}}^5\) such that \({\mathscr {L}}\cap U=A\cap U\). We interpret this result as an obstacle for finding an existence theorem for a compact convex polytope with prescribed directions and perimeters of the faces.     

Minimizers for the embedding of Besov spaces

Using the profile decomposition, we will show the relatively compactness of the minimizing sequence to the critical embeddings between Besov spaces, which implies the existence of minimizer of the critical embeddings of Besov spaces $\dot{B}^{s_1}_{p_1,q_1}\hookrightarrow \dot{B}^{s_2}_{p_2,q_2}$ in $d$ dimensions with $s_1-d/p_1=s_2-d/p_2$, $s_1>s_2$ and $1 \leq q_1相似文献   

HUA’S THEOREM WITH FIVE ALMOST EQUAL PRIME VARIABLES

It is proved that each sufficiently large integer N=5(mod24) can be written as N=p1^2+p2^2+p3^2+p4^2+p5^2 with|pj=√N/5|&#177;、≤U=N^1/2-1/35+e,where pj ae primes.This result,which is obtained by an iterative method and a hybrid estimate for Dirichlet polynomial, improves the previous results in this direction.     

三维拟线性波方程的小初值光滑解

对三维小初值拟线性波方程3∑(i,j=0)g~(ij)(u)■_(ij)u=0,H.Lindblad证明了它有整体光滑解.本文考虑如下带有小初值的拟线性波方程3∑(i,j=0)g~(ij)(u)■_(ij)u=(■u)~3,通过得到低阶导数的衰减估计和高阶导数的能量估计,由连续论证法证明了这个方程也存在整体光滑解.     

An Inverse Spectral Problem for a Nonsymmetric Differential Operator: Uniqueness and Reconstruction Formula

We consider an eigenvalue problem for a system on [0, 1]: $$\left\{ {\begin{array}{*{20}l} {\left[ {\left( {\begin{array}{*{20}c} 0 & 1 \\ 1 & 0 \\ \end{array} } \right)\frac{{\text{d}}} {{{\text{d}}x}} + \left( {\begin{array}{*{20}c} {p_{11} (x)} & {p_{12} (x)} \\ {p_{21} (x)} & {p_{22} (x)} \\ \end{array} } \right)} \right]\left( {\begin{array}{*{20}c} {\varphi ^{(1)} (x)} \\ {\varphi ^{(2)} (x)} \\ \end{array} } \right) = \lambda \left( {\begin{array}{*{20}c} {\varphi ^{(1)} (x)} \\ {\varphi ^{(1)} (x)} \\ \end{array} } \right)} \\ {\varphi ^{(2)} (0)\cosh \mu - \varphi ^{(1)} (0)\sinh \mu = \varphi ^{(2)} (1)\cosh \nu + \varphi ^{(1)} (1)\sinh \nu = 0} \\ \end{array} } \right.$$ with constants $$\mu ,\nu \in \mathbb{C}.$$ Under the assumption that p₂₁, p₂₂ are known, we prove a uniqueness theorem and provide a reconstruction formula for p₁₁ and p₁₂ from the spectral characteristics consisting of one spectrum and the associated norming constants.     

A note on orthogonal sets of hypercubes

Mutually orthogonal sets of hypercubes are higher dimensional generalizations of mutually orthogonal sets of Latin squares. For Latin squares, it is well known that the Cayley table of a group of order n is a Latin square, which has no orthogonal mate if n is congruent to 2 modulo 4. We will prove an analogous result for hypercubes. © 1997 John Wiley & Sons, Inc. J Combin Designs 5: 231–233, 1997     

Exponential sums over primes in short intervals

In this paper we establish one new estimate on exponential sums over primes in short intervals. As an application of this result, we sharpen Hua's result by proving that each sufficiently large integer N congruent to 5 modulo 24 can be written as N = p12 p22 p32 p42 p52, with |pj-(N/5)~(1/2)|≤U = N1/2-1/20 ε, where pj are primes. This result is as good as what one can obtain from the generalized Riemann hypothesis.     

On the maximality of a set of mutually orthogonal Sudoku Latin Squares

The maximum number of mutually orthogonal Sudoku Latin squares (MOSLS) of order \(n=m^2\) is \(n-m\). In this paper, we construct for \(n=q^2\), q a prime power, a set of \(q^2-q-1\) MOSLS of order \(q^2\) that cannot be extended to a set of \(q^2-q\) MOSLS. This contrasts to the theory of ordinary Latin squares of order n, where each set of \(n-2\) mutually orthogonal Latin Squares (MOLS) can be extended to a set of \(n-1\) MOLS (which is best possible). For this proof, we construct a particular maximal partial spread of size \(q^2-q+1\) in \(\mathrm {PG}(3,q)\) and use a connection between Sudoku Latin squares and projective geometry, established by Bailey, Cameron and Connelly.     

Sub-latin squares and incomplete orthogonal arrays

The main result of this paper is that for any pair of orthogonal Latin squares of side k, there will exist for all sufficiently large n a pair of orthogonal Latin squares with the first pair as orthogonal sub-squares. The orthogonal array corresponding to a set of pairwise orthogonal Latin squares, minus the sub-array corresponding to orthogonal sub-squares is called an incomplete orthogonal array; this concept is generalized slightly.     

Some new HSOLSSOMs of types hn and 1m u1

In this paper, two new direct construction methods are given for holey self‐orthogonal Latin squares with a symmetric orthogonal mate (HSOLSSOMs). Some new HSOLSSOMs using already known methods are also given. The known existence results for HSOLSSOMs of types 1^m u¹ and hⁿ are improved; for type 1^m u¹ there remain just four possible exceptions with u odd and 3 ≤ u ≤ 15; for type hⁿ, there are just two possible exceptions remaining, for (h, n) = (6, 12) and (6, 18). As a byproduct, the known existence results for three holey mutually orthogonal Latin squares (3 HMOLS) are also improved. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 435–444, 2001     

Diophantine approximation with four squares and one <Emphasis Type="Italic">k</Emphasis>th power of primes

Let k be an integer with \(k\ge 3\) and \(\eta \) be any real number. Suppose that \(\lambda _1, \lambda _2, \lambda _3, \lambda _4, \mu \) are non-zero real numbers, not all of the same sign and \(\lambda _1/\lambda _2\) is irrational. It is proved that the inequality \(|\lambda _1p_1^2+\lambda _2p_2^2+\lambda _3p_3^2+\lambda _4p_4^2+\mu p_5^k+\eta |<(\max \ p_j)^{-\sigma }\) has infinitely many solutions in prime variables \(p_1, p_2, \ldots , p_5\), where \(0<\sigma <\frac{1}{16}\) for \(k=3,\ 0<\sigma <\frac{5}{3k2^k}\) for \(4\le k\le 5\) and \(0<\sigma <\frac{40}{21k2^k}\) for \(k\ge 6\). This gives an improvement of an earlier result.     

最佳拉丁方与高级原幻方

本文证明了 (n ,2 ) =(n ,3) =1时 ,有n阶的正交的最佳拉丁方。若n =4k ,或n是个不为 3的奇数 ,则有n阶的正交的高级原幻方     

On generalized square-full numbers in an arithmetic progression

Czechoslovak Mathematical Journal - Let a and $$b \in \mathbb{N}$$ . Denote by Ra,b the set of all integers n &gt; 1 whose canonical prime representation $$n = p_1^{{\alpha _1}}p_2^{{\alpha...     

A note on geodetic graphs of diameter two and their relation to orthogonal Latin squares

A general class of matrices, which are equivalent to orthogonal Latin squares, is used to construct a class of geodetic graphs of diameter two. The argument is reversed to prove a necessary condition for the existence of general classes of such graphs in terms of orthogonal Latin squares.     

On the Waring-Goldbach Problem for Six Cubes and Two Biquadrates

Let P_r denote an almost prime with at most r prime factors, counted according to multiplicity. In the present paper, it is proved that for any sufficiently large even integer n, the equation

$$n = {x^3} + p_1^3 + p_2^3 + p_3^3 + p_4^3 + p_5^3 + p_6^4 + p_7^4$$

has solutions in primes p_i with x being a P₆. This result constitutes a refinement upon that of Hooley C.