Frame self-orthogonal Mendelsohn triple systems of type

A Mendelsohn triple system (MTS) corresponds to an idempotent semisymmetric Latin square (quasigroup) of the same order. A holey MTS is called frame self-orthogonal, briefly FSOMTS, if its associated holey semisymmetric Latin square is frame self-orthogonal. In this paper, we use FSOMTS(hⁿ) to denote an FSOMTS with n spanning holes of size h. The existence of FSOMTS(hⁿ) for h3 has been known with a few exceptions. We extend the existing results and determine the necessary and sufficient conditions for the existence of FSOMTS(hⁿ) for any h and n with some possible exceptions.     

A Conjecture Concerning the Pure Exponential Diophantine Equation a^x ＋ b^y = c^z

Let a, b, c, r be fixed positive integers such that a^2 ＋ b^2 = c^r, min（a, b, c, r） 〉 1 and 2 r. In this paper we prove that if a ≡ 2 （mod 4）, b ≡ 3 （mod 4）, c 〉 3.10^37 and r 〉 7200, then the equation a^x ＋ b^y = c^z only has the solution （x, y, z） = （2, 2, r）.     

On the Terai-Jésmanowicz conjecture

In this paper, we prove that if a, b and c are pairwise coprime positive integers such that a^2＋b^2=c^r,a〉b,a≡3 （mod4）,b≡2 （mod4） and c-1 is not a square, thena a^x＋b^y=c^z has only the positive integer solution （x, y, z） = （2, 2, r）.
Let m and r be positive integers with 2｜m and 2 r, define the integers Ur, Vr by （m ＋√-1）^r=Vr＋Ur√-1. If a = ｜Ur｜,b=｜Vr｜,c = m^2＋1 with m ≡ 2 （mod 4）,a ≡ 3 （mod 4）, and if r 〈 m/√1.5log3（m^2＋1）-1, then a^x ＋ b^y = c^z has only the positive integer solution （x,y, z） = （2, 2, r）. The argument here is elementary.     

3-(v, 4, 1) covering designs with chromatic numbers 2 and 3

A t-(v, k, λ) covering design is a pair (X, B) where X is a v-set and B is a collection of k-sets in X, called blocks, such that every t element subset of X is contained in at least λ blocks of B. The covering number, C_λ(t, k, v), is the minimum number of blocks a t-(v, k, λ) covering design may have. The chromatic number of (X, B) is the smallest m for which there exists a map φ: X → Z_m such that ∣φ((β)∣ ≥2 for all β ∈ B, where φ(β) = {φ(x): x ∈ β}. The system (X, B) is equitably m-chromatic if there is a proper coloring φ with minimal m for which the numbers ∣φ^?1(c)∣ c ∈ Z_m differ from each other by at most 1. In this article we show that minimum, (i.e., ∣B∣ = C λ (t, k, v)) equitably 3-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0 (mod 6), v ≥ 18 for v ≥ 1, 13 (mod 36), v ≡ 13 and for all numbers v = n, n + 1, where n ≡ 4, 8, 10 (mod 12), n ≥ 16; and n = 6.5^a 13^b 17^c ?4, a + b + c > 0, and n = 14, 62. We also show that minimum, equitably 2-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0, 5, 9 (mod 12), v ≥ 0, v = 2.5^a 13^b 17^c + 1, a + b + c > 0, and v = 23. © 1993 John Wiley & Sons, Inc.     

The spectrum for large sets of pure directed triple systems

An LPDTS(ν) is a collection of 3(ν-2) disjoint pure directed triple systems on the same set ofνelements. It is showed in Tian's doctoral thesis that there exists an LPDTS(ν) forν=0,4 (mod 6),ν≥4. In this paper, we establish the existence of an LPDTS(ν) forν= 1,3 (mod 6),ν> 3. Thus the spectrum for LPDTS(ν) is completely determined to be the set {ν:ν= 0, 1 (mod 3),ν≥4}.     

A note on the diophantine equation x 2 + b y = c z

Let a, b, c, r be positive integers such that a ² + b ² = c ^r , min(a, b, c, r) > 1, gcd(a, b) = 1, a is even and r is odd. In this paper we prove that if b ≡ 3 (mod 4) and either b or c is an odd prime power, then the equation x ² + b ^y = c ^z has only the positive integer solution (x, y, z) = (a, 2, r) with min(y, z) > 1.     

On the embeddings of mendelsohn triple systems

It is proved in this paper that there exists an incomplete Mendelsohn triple system IMTS(u,v; λ) if and only ifλ(u-v)(u-2v-1)≡0(mod 3),u≥2v+1 and (u, v, λ) ≠ (6, 1, 1). As a consequence, it is proved that for any given λ≥1, a Mendelsohn triple system MTS (v, λ) can be embedded in an MTS (u, λ) if and only ifλu(u-1)≡0(mod 3) andu≥2v+1. Project supported by the National Natural Science Foundation of China.     

Properties of digraphs connected with some congruence relations

The paper extends the results given by M. Křížek and L. Somer, On a connection of number theory with graph theory, Czech. Math. J. 54 (129) (2004), 465–485 (see [5]). For each positive integer n define a digraph Γ(n) whose set of vertices is the set H = {0, 1, ..., n − 1} and for which there is a directed edge from a ∈ H to b ∈ H if a ³ ≡ b (mod n). The properties of such digraphs are considered. The necessary and the sufficient condition for the symmetry of a digraph Γ(n) is proved. The formula for the number of fixed points of Γ(n) is established. Moreover, some connection of the length of cycles with the Carmichael λ-function is presented.      

The structure of digraphs associated with the congruence <Emphasis Type="Italic">x</Emphasis><Superscript><Emphasis Type="Italic">k</Emphasis></Superscript> ≡ <Emphasis Type="Italic">y</Emphasis> (mod <Emphasis Type="Italic">n</Emphasis>)

We assign to each pair of positive integers n and k ⩾ 2 a digraph G(n, k) whose set of vertices is H = {0, 1, ..., n − 1} and for which there is a directed edge from a ∈ H to b ∈ H if a ^k ≡ b (mod n). We investigate the structure of G(n, k). In particular, upper bounds are given for the longest cycle in G(n, k). We find subdigraphs of G(n, k), called fundamental constituents of G(n, k), for which all trees attached to cycle vertices are isomorphic.     

Lower bounds for numbers of ABC-hits

By an ABC-hit, we mean a triple (a,b,c) of relatively prime positive integers such that a+b=c and rad(abc)<c. Denote by N(X) the number of ABC-hits (a,b,c) with c?X. In this paper we discuss lower bounds for N(X). In particular we prove that for every ?>0 and X large enough N(X)?exp((logX)^1/2−?).     

Further Results on the Existence of Splitting BIBDs and Application to Authentication Codes

Let (v,u×c,λ)-splitting BIBD denote a (v,u×c,λ)-splitting balanced incomplete block design of order v with block size u×c and index λ. Necessary conditions for the existence of a (v,u×c,λ)-splitting BIBD are v≥uc, λ(v−1)≡0 (mod c(u−1)) and λ v(v−1)≡0 (mod (c ² u(u−1))). We show in this paper that the necessary conditions for the existence of a (v,3×3,λ)-splitting BIBD are also sufficient with possible exceptions when (1) (v,λ)∈{(55,1),(39,9k):k=1,2,…}, (2) λ≡0 (mod 54) and v≡0 (mod 2). We also show that there exists a (v,3×4,1)-splitting BIBD when v≡1 (mod 96). As its application, we obtain a new infinite class of optimal 4-splitting authentication codes.     

On the generalization of the D. H. Lehmer problem

Let n ≥ 2 be a fixed positive integer, q ≥ 3 and c be two integers with （n, q） = （c, q） = 1. We denote by rn（51, 52, C; q） （δ 〈 δ1,δ2≤ 1） the number of all pairs of integers a, b satisfying ab ≡ c（mod q）, 1 〈 a ≤δ1q, 1 ≤ b≤δ2q, （a,q） = （b,q） = 1 and nt（a＋b）. The main purpose of this paper is to study the asymptotic properties of rn （δ1, δ2, c; q）, and give a sharp asymptotic formula for it.     

Penultimate limiting forms in extreme value theory

Summary Let {X _n}_n≧1 be a sequence of independent, identically distributed random variables. If the distribution function (d.f.) ofM _n=max (X ₁,…,X _n), suitably normalized with attraction coefficients {α_n}_n≧1(α_n>0) and {b _n}_n≧1, converges to a non-degenerate d.f.G(x), asn→∞, it is of interest to study the rate of convergence to that limit law and if the convergence is slow, to find other d.f.'s which better approximate the d.f. of(M _n−b_n)/a_n thanG(x), for moderaten. We thus consider differences of the formF ⁿ(a_nx+b_n)−G(x), whereG(x) is a type I d.f. of largest values, i.e.,G(x)≡Λ(x)=exp (-exp(−x)), and show that for a broad class of d.f.'sF in the domain of attraction of Λ, there is a penultimate form of approximation which is a type II [Ф _α(x)=exp (−x^−α), x>0] or a type III [Ψ _α(x)= exp (−(−x)^α), x<0] d.f. of largest values, much closer toF ⁿ(a_nx+b_n) than the ultimate itself.     

Tripling Construction for Large Sets of Resolvable Directed Triple Systems

In this paper, we first define a doubly transitive resolvable idempotent quasigroup （DTRIQ）, and show that aDTRIQ of order v exists if and only ifv ≡0（mod3） and v ≠ 2（mod4）. Then we use DTRIQ to present a tripling construction for large sets of resolvable directed triple systems, which improves an earlier version of tripling construction by Kang （J. Combin. Designs, 4 （1996）, 301-321）. As an application, we obtain an LRDTS（4·3^n） for any integer n ≥ 1, which provides an infinite family of even orders.     

Equidistribution of sparse sequences on nilmanifolds

We study equidistribution properties of nil-orbits (b ⁿ x) _n∈ℕ when the parameter n is restricted to the range of some sparse sequence that is not necessarily polynomial. For example, we show that if X = G/Γ is a nilmanifold, b ∈ G is an ergodic nilrotation, and c ∈ ℝ \ ℤ is positive, then the sequence $ (b^{[n^c ]} x)_{n \in \mathbb{N}} $ (b^{[n^c ]} x)_{n \in \mathbb{N}} is equidistributed in X for every x ∈ X. This is also the case when n ^c is replaced with a(n), where a(t) is a function that belongs to some Hardy field, has polynomial growth, and stays logarithmically away from polynomials, and when it is replaced with a random sequence of integers with sub-exponential growth. Similar results have been established by Boshernitzan when X is the circle.     

On Non-Essential Edges in 3-Connected Graphs

 An edge e in a simple 3-connected graph is deletable (simple-contractible) if the deletion G\e (contraction G/e) is both simple and 3-connected. Suppose a, b, and c are three non-negative integers. If there exists a simple 3-connected graph with exactly a edges which are deletable but not simple-contractible, exactly b edges which are simple-contractible but not deletable, and exactly c edges which are both deletable and simple-contractible, then we call the triple (a, b, c) realizable, and such a graph is said to be an (a, b, c)-graph. Tutte's Wheels Theorem says the only (0, 0, 0)-graphs are the wheels. In this paper, we characterize the (a, b, c) realizable triples for which at least one of a + b≤2, c=0, and c≥16 holds. Received: February 12, 1997 Revised: February 13, 1998     

Distribution of a certain partition function modulo powers of primes

In this paper, we study a certain partition function a(n) defined by Σ _n≥0 a(n)q ⁿ := Π _n=1(1 − q ⁿ )⁻¹(1 − q ²ⁿ )⁻¹. We prove that given a positive integer j ≥ 1 and a prime m ≥ 5, there are infinitely many congruences of the type a(An + B) ≡ 0 (mod m ^j ). This work is inspired by Ono’s ground breaking result in the study of the distribution of the partition function p(n).     

Characterization of separating couples

Let A, B be two archimedean ℓ-algebras and let U,V be two positive linear maps from A to B. We call that the couple (U,V) is separating with respect to A and B if |a||b| = 0 in A implies |U (a)||V (b)| = 0 in B. In this paper, we prove that if A is an f-algebra with unit elment e, if B is an ℓ-algebra and if (U,V) is a separating couple with respect to A and B then (U ^∼∼,V ^∼∼), where U ^∼∼ (resp V ^∼∼) is the bi-adjoint of U (resp of V), is again a separating couple with respect to the order continuous order biduals (A′)′ _n and (B′)′ _n of A and B respectively furnished with their Arens products respectively. Moreover, in the case where B′ separates the points of B, we give a characterization of any separating couple with respect to A and B.      

NON-EMPTY CROSS-2-INTERSECTING FAMILIES OF SUBSETS

Let Cdenote the set of all k-subests of an n-set.Assume Alohtain in Ca,and A lohtain in (A,B) is called a cross-2-intersecting family if |A B≥2 for and A∈A,B∈B.In this paper,the best upper bounds of the cardinalities for non-empty cross-2-intersecting familles of a-and b-subsets are obtained for some a and b,A new proof for a Frankl-Tokushige theorem[6] is also given.