The Number of Lattice Points Above the Catenary

For fixed c > 1 and for arbitrary and independent a,b ≧ 1 let Z ²|b( cosh(x/a)−c) ≦ y < 0}. We investigate the asymptotic behaviour of R(a,b) for a,b → ∞. In the special case b = o(a ^5/6) the lattice rest has true order of magnitude . This revised version was published online in June 2006 with corrections to the Cover Date.     

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.     

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.     

An Arc as the Inverse Limit of a Single Bonding Map of Type N on [0,1]

Let I = [0, 1], c ₁, c ₂ ∈ (0, 1) with c ₁ < c ₂ and f : I⊸I be a continuous map satisfying: are both strictly increasing and is strictly decreasing. Let A = {x ∈ [0, c ₁]∣f(x) = x}, a=max A, a ₁ =max(A\{a}), and B = {x ∈ [c ₂, 1]∣f(x) = x}, b=minB, b ₁ =min(B\{b}). Then the inverse limit (I, f) is an arc if and only if one of the following three conditions holds: (1) If c ₁ < f (c ₁) ≤ c ₂ (resp. c ₁ ≤ f (c ₂) < c ₂), then f has a single fixed point, a period two orbit, but no points of period greater than two or f has more than one fixed point but no points of other periods, furthermore, if A≠φ and B≠φ, then f (c ₂) > a (resp. f (c ₁) < b). (2) If f (c ₁) ≤ c ₁ (resp. f (c ₂) ≥ c ₂), then f has more than one fixed point, furthermore, if B≠φ and A\ {a} ≠φ, f (c ₂) ≥ a or if a ₁ < f (c ₂) < a, f ² (c ₂) > f (c ₂), (resp. f has more than one fixed point, furthermore, if A≠φ and B\{b}≠φ, f (c ₁) ≤ b or if b < f (c ₂) < b ₁, f ² (c ₁) < f (c ₁)). (3) If f (c ₁) > c ₂ and f (c ₂) < c ₁, then f has a single fixed point, a single period two orbit lying in I\(u, v) but no points of period greater than two, where u, v ∈ [c ₁, c ₂] such that f (u) = c ₂ and f (v) = c ₁. Supported by the National Natural Science Foundation of China (No. 19961001, No. 60334020) and Outstanding Young Scientist Research Fund. (No. 60125310)     

Games of Chains and Cutsets in the Boolean Lattice II

Let 2 ^[n] denote the poset of all subsets of [n]={1,2,...,n} ordered by inclusion. Following Gutterman and Shahriari (Order 14, 1998, 321–325) we consider a game G _n (a,b,c). This is a game for two players. First, Player I constructs a independent maximal chains in 2 ^[n]. Player II will extend the collection to a+b independent maximal chains by finding another b independent maximal chains in 2 ^[n]. Finally, Player I will attempt to extend the collection further to a+b+c such chains. The last Player who is able to complete her move wins. In this paper, we complete the analysis of G _n (a,b,c) by considering its most difficult instance: when c=2 and a+b+2=n. We prove, the rather surprising result, that, for n7, Player I wins G _n (a,n–a–2,2) if and only if a3. As a consequence we get results about extending collections of independent maximal chains, and about cutsets (collections of subsets that intersect every maximal chain) of minimum possible width (the size of largest anti-chain).     

On (p a , p b , p a , p a-b )-Relative Difference Sets

This paper provides new exponent and rank conditions for the existence of abelian relative (p ^a,p ^b,p ^a,p ^a–b)-difference sets. It is also shown that no splitting relative (2^2c,2^d,2^2c,2^2c–d)-difference set exists if d > c and the forbidden subgroup is abelian. Furthermore, abelian relative (16, 4, 16, 4)-difference sets are studied in detail; in particular, it is shown that a relative (16, 4, 16, 4)-difference set in an abelian group G Z₈ × Z₄ × Z₂ exists if and only if exp(G) 4 or G = Z₈ × (Z₂)³ with N Z₂ × Z₂.     

Disjunctive Rado numbers

If L₁ and L₂ are linear equations, then the disjunctive Rado number of the set {L₁,L₂} is the least integer n, provided that it exists, such that for every 2-coloring of the set {1,2,…,n} there exists a monochromatic solution to either L₁ or L₂. If such an integer n does not exist, then the disjunctive Rado number is infinite. In this paper, it is shown that for all integers and b1, the disjunctive Rado number for the equations x₁+a=x₂ and x₁+b=x₂ is a+b+1-gcd(a,b) if is odd and the disjunctive Rado number for these equations is infinite otherwise. It is also shown that for all integers a>1 and b>1, the disjunctive Rado number for the equations ax₁=x₂ and bx₁=x₂ is c^s+t-1 if there exist natural numbers c,s, and t such that a=c^s and b=c^t and s+t is an odd integer and c is the largest such integer, and the disjunctive Rado number for these equations is infinite otherwise.     

Distributivity conditions and the order-skeleton of a lattice

We introduce “π-versions” of five familiar conditions for distributivity by applying the various conditions to 3-element antichains only. We prove that they are inequivalent concepts, and characterize them via exclusion systems. A lattice L satisfies D _0π if aù(búc)  \leqslant  (aùb)úc{{{a}\wedge({b}\vee{c})\;\leqslant\;({a}\wedge{b})\vee{c}}} for all 3-element antichains {a, b, c}. We consider a congruence relation ~ whose blocks are the maximal autonomous chains and define the order-skeleton of a lattice L to be [(L)\tilde] : = L/ ~ {{\tilde{L} : = L/{\sim}}}. We prove that the following are equivalent for a lattice L: (i) L satisfies D _0π , (ii) [(L)\tilde]{{\tilde{L}}} satisfies any of the five π-versions of distributivity, (iii) the order-skeleton [(L)\tilde]{{\tilde{L}}} is distributive.     

Proof of Oppenheim's area inequalities for triangles and quadrilaterals

Leta ₁,b ₁,c ₁,A ₁ anda ₂,b ₂,c ₂,A ₂ be the sides and areas of two triangles. Ifa=(a ₁ ^p +a ₂ ^p )^1/p ,b=(b ₁ ^p +b ₂ ^p )^1/p ,c=(c ₁ ^p +c ₂ ^p )^1/p , and 1p4, thena, b, c are the sides of a triangle and its area satisfiesA ^p/2A ₁ ^p/2 +A ₂ ^p/2 . If obtuse triangles are excluded,p>4 is allowed. For convex cyclic quadrilaterals, a similar inequality holds. Also, leta, b, c, A be the sides and area of an acute or right triangle. Iff(x) satisfies certain conditions,f(a),f(b),f(c) are the sides of a triangle having areaA _f, which satisfies (4A _f/3)^1/2f((4A/3)^1/2).     

Strongly Singular Sturm – Liouville Problems

We consider a Sturm – Liouville operator Lu = —(r(t)u′)′ + p (t)u , where r is a (strictly) positive continuous function on ]a, b [ and p is locally integrable on ]a, b[. Let r₁(t) = (1/r) ds andchoose any c ∈]a, b[. We are interested in the eigenvalue problem Lu = λm(t)u, u (a) = u (b) = 0,and the corresponding maximal and anti .maximal principles, in the situation when 1/r ∈ L¹ (a, c),1 /r ∉ L¹ (c, b), pr₁ ∉ L¹ (a, c) and pr₁ ∉ L¹(c, b).     

Convexity preserving and predicting by Bernstein polynomials

It is known that the Bernstein polynomials of a function f defined on [0, 1 ] preserve its convexity properties, i.e., if f⁽ⁿ⁾ 0 then for m n, (B_mf)⁽ⁿ⁾ 0. Moreover, if f is n-convex then (B_mf)⁽ⁿ⁾ 0. While the converse is not true, we show that if f is bounded on (a, b) and if for every subinterval [α, β] (a, b) the nth derivative of the mth Bernstein polynomial of f on [α, β] is nonnegative then f is n-convex.     

Latin bitrades,dissections of equilateral triangles,and abelian groups

Let T=(T^*, T^?) be a spherical latin bitrade. With each a=(a₁, a₂, a₃)∈T^* associate a set of linear equations Eq(T, a) of the form b₁+b₂=b₃, where b=(b₁, b₂, b₃) runs through T^*\{a}. Assume a₁=0=a₂ and a₃=1. Then Eq(T,a) has in rational numbers a unique solution $b_{i}=\bar{b}_{i}Let T=(T^*, T^?) be a spherical latin bitrade. With each a=(a₁, a₂, a₃)∈T^* associate a set of linear equations Eq(T, a) of the form b₁+b₂=b₃, where b=(b₁, b₂, b₃) runs through T^*\{a}. Assume a₁=0=a₂ and a₃=1. Then Eq(T,a) has in rational numbers a unique solution $b_{i}=\bar{b}_{i}$. Suppose that $\bar{b}_{i}\not= \bar{c}_{i}$ for all b, c∈T^* such that $\bar{b}_{i}\not= \bar{c}_{i}$ and i∈{1, 2, 3}. We prove that then T^? can be interpreted as a dissection of an equilateral triangle. We also consider group modifications of latin bitrades and show that the methods for generating the dissections can be used for a proof that T^* can be embedded into the operational table of a finite abelian group, for every spherical latin bitrade T. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 1–24, 2010     

Simple two-sided anti-Lie-admissible algebras

For a Lie algebra L, a bilinear map is called a commutative cocycle if ψ(a, b) = ψ(b, a) and ψ([a, b], c) + ψ([b, a], c) + ψ([c, a], b) = 0 for any a, b, c ∈ L. We prove that any commutative cocycle of a simple Lie algebra of characteristic p ≠ 2, 3 is trivial if the rank of L is at least 2. In particular, any two-sided Alia algebra connected with a simple, finite-dimensional Lie algebra L is isomorphic to L, except for the case where L = sl ₂ . Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 60, Algebra, 2008.     

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     

Admissibility of the natural estimator of the mean of a Gaussian process

Let {X(t): t [a, b]} be a Gaussian process with mean μ L₂[a, b] and continuous covariance K(s, t). When estimating μ under the loss ∫_a^b ( (t)−μ(t))² dt the natural estimator X is admissible if K is unknown. If K is known, X is minimax with risk ∫_a^b K(t, t) dt and admissible if and only if the three by three matrix whose entries are K(t_i, t_j) has a determinant which vanishes identically in t_i [a, b], i = 1, 2, 3.     

Disjoint Paths in Graphs II,A Special Case

Let G be a graph,{a,b,c} í V(G) \{a,b,c\}\subseteq V(G) , and {a￠,b￠,c￠} í V(G) \{a',b',c'\}\subseteq V(G) such that {a,b,c} 1 {a￠,b￠,c￠} \{a,b,c\}\neq \{a',b',c'\} . We say that (G,{a,c}, {a￠,c￠}, (b, b￠)) (G,\{a,c\}, \{a',c'\}, (b, b')) is an obstruction if, for any three vertex disjoint paths from {a, b, c} to {a', b', c'} in G, one path is from b to b'. In this paper, we characterize a special class of obstructions. This will be used to characterize all obstructions.     

Bounding the Derived Length for a Given Set of Character Degrees

Let G be a finite solvable group with {1, a, b, c, ab, ac} as the character degree set, where a ,b, and c are pairwise coprime integers greater than 1. We show that the derived length of G is at most 4. This verifies that the Taketa inequality, dl(G) ≤ |cd(G)|, is valid for solvable groups with {1, a, b, c, ab, ac} as the character degree set. Also, as a corollary, we conclude that if a, b, c, and d are pairwise coprime integers greater than 1 and G is a solvable group such that cd(G) = {1, a, b, c, d, ac, ad, bc, bd}, then dl(G) ≤ 5. Finally, we construct a family of solvable groups whose derived lengths are 4 and character degree sets are in the form {1, p, b, pb, q ^p , pq ^p }, where p is a prime, q is a prime power of an odd prime, and b > 1 is integer such that p, q, and b are pairwise coprime. Hence, the bound 4 is the best bound for the derived length of solvable groups whose character degree set is in the form {1, a, b, c, ab, ac} for some pairwise coprime integers a, b, and c.     

Triangle-free distance-regular graphs

Let Γ denote a distance-regular graph with diameter d≥3. By a parallelogram of length 3, we mean a 4-tuple xyzw consisting of vertices of Γ such that ∂(x,y)=∂(z,w)=1, ∂(x,z)=3, and ∂(x,w)=∂(y,w)=∂(y,z)=2, where ∂ denotes the path-length distance function. Assume that Γ has intersection numbers a ₁=0 and a ₂≠0. We prove that the following (i) and (ii) are equivalent. (i) Γ is Q-polynomial and contains no parallelograms of length 3; (ii) Γ has classical parameters (d,b,α,β) with b<−1. Furthermore, suppose that (i) and (ii) hold. We show that each of b(b+1)²(b+2)/c ₂, (b−2)(b−1)b(b+1)/(2+2b−c ₂) is an integer and that c ₂≤b(b+1). This upper bound for c ₂ is optimal, since the Hermitian forms graph Her₂(d) is a triangle-free distance-regular graph that satisfies c ₂=b(b+1). Work partially supported by the National Science Council of Taiwan, R.O.C.     

Distance-regular Subgraphs in a Distance-regular Graph, VI

In this paper we give a sufficient condition for the existence of a strongly closed subgraph which is (c_q+a_q)-regular of diameterqcontaining a given pair of vertices at distanceqin a distance-regular graph. Moreover we show that a distance-regular graph withr = max {j| (c_j,a_j,b_j) = (c₁,a₁,b₁)} ,b_{q − 1}>b_qandc_q+r = 1 satisfies our sufficient condition.