A theorem on the maximum number of disjoint steiner triple systems

We prove that D(2v + 1) ? v + 1 + D(v) for v > 3 where D(v) denotes the maximum number of pairwise disjoint Steiner triple systems of order v. Since D(v) ? v ? 2 it follows that for v > 3, D(2v + 1) = 2v ?1 whenever D(v) = v ? 2.     

On large sets of disjoint steiner triple systems I

Let D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. In this paper, it is proved that if D(2 + n) = n, p is a prime number, p ≡ 7 (mod 8) or p? {5, 17, 19, 2}, and (p, n) ≠ (5, 1), then D(2 + pn) = pn.     

On the maximum number of disjoint Steiner triple systems

Let D(v) be the maximum number of pairwise disjoint Steiner triple systems of order v. We prove that D(3v)≥2v+D(v) for every v ≡ 1 or 3 (mod 6), v≥3. As a corollary, we have D(3ⁿ)=3ⁿ-2 for every n≥1.     

The asymptotic distribution of weighted empirical distribution functions

Let G_n denote the empirical distribution based on n independent uniform (0, 1) random variables. The asymptotic distribution of the supremum of weighted discrepancies between G_n(u) and u of the forms 6w_v(u)D_n(u)6 and 6w_v(G_n(u))D_n(u)6, where D_n(u) = G_n(u)?u, w_v(u) = (u(1?u))^?1+v and 0 ? v < $\text{1}\text{2}$ is obtained. Goodness-of-fit tests based on these statistics are shown to be asymptotically sensitive only in the extreme tails of a distribution, which is exactly where such statistics that use a weight function w_v with $\text{1}\text{2}$ ? v ? 1 are insensitive. For this reason weighted discrepancies which use the weight function w_v with 0 ? v < $\text{1}\text{2}$ are potentially applicable in the construction of confidence contours for the extreme tails of a distribution.     

On large sets of disjoint steiner triple systems,VI

Let D(v) denote the maximum number of pairwise disjoint Steiner triple systems of order v. In this paper, we prove that D(v) = v ? 2 holds for all v ≡ 1, 3 (mod 6) (v>7), except possibly v = 141, 283, 501, 789, 1501, 2365.     

Oscillation theorems for nth-order differential equations with deviating arguments

This paper is concerned with the study of the oscillatory behavior of solutions of the nth-order nonlinear differential equation (a(t)x^{(n ? v)}(t))^(v) + q(t)f(x[g(t)]) = 0, where n is even and 1 ? v ? n ? 1. A systematic study is attempted which extends and correlates a number of existing results.     

Convexity in oriented graphs

For vertices u and v in an oriented graph D, the closed interval I[u,v] consists of u and v together with all vertices lying in a u−v geodesic or v−u geodesic in D. For S⊆V(D), I[S] is the union of all closed intervals I[u,v] with u,v∈S. A set S is convex if I[S]=S. The convexity number con(D) is the maximum cardinality of a proper convex set of V(D). The nontrivial connected oriented graphs of order n with convexity number n−1 are characterized. It is shown that there is no connected oriented graph of order at least 4 with convexity number 2 and that every pair k, n of integers with 1⩽k⩽n−1 and k≠2 is realizable as the convexity number and order, respectively, of some connected oriented graph. For a nontrivial connected graph G, the lower orientable convexity number con⁻(G) is the minimum convexity number among all orientations of G and the upper orientable convexity number con⁺(G) is the maximum such convexity number. It is shown that con⁺(G)=n−1 for every graph G of order n⩾2. The lower orientable convexity numbers of some well-known graphs are determined, with special attention given to outerplanar graphs.     

Meyniel's theorem for strongly (p,q) - Hamiltonian digraphs

We give the following theorem: Let D = (V, E) be a strongly (p + q + 1)-connected digraph with n ≥ p + q + 1 vertices, where p and q are nonnegative integers, p ≤ n - 2, n ≥ 2. Suppose that, for each four vertices u, v, w, z (not necessarily distinct) such that {u, v} ∩ {w, z} = Ø, (w, u) ? E, (v, z) ? E, we have id(u) + od(v) + od(w + id(z) ≥ 2 (n + p + q)) + 1. Then D is strongly (p, q)-Hamiltonian.     

A symmetry relationship for a class of partitions

Let S(n, k, v) denote the number of vectors (a₀,…, a_n?1) with nonnegative integer components that satisfy a₀ + … + a_{n ? 1} = k and Σ_i=0^n?1ia_i ≡ v (mod n). Two proofs are given for the relation S(n, k, v) = S(k, n, v). The first proof is by algebraic enumeration while the second is by combinatorial construction.     

Asymptotics of the complexity of systems of integer linear forms for additive computations

The computational complexity of integer linear forms is studied. By l ₂(A) we denote the minimal number of the additions and subtractions required for computing the system of p linear forms in q variables x ₁, x ₂, …, x _q that are defined by an integer matrix A of size p × q (repeated use of the results of intermediate computation is permitted). We show that l ₂(A) ? log D(A), where D(A) is the maximum of the absolute values of the minors of A over all minors from order 1 to order min (p, q) (Theorem 1). Moreover, for each sequence of matrices A(n) of size p(n) × q(n) satisfying the condition p + q = o ((log log D(A))^1/2) as n → ∞ the bound l ₂(A) ? log D(A) + o(log D(A)) is valid (Theorem 2). Hence, for all fixed (and even weakly increasing) sizes of matrices that determine a system of integer linear forms, the upper bound on the computational complexity of this system is asymptotically equal to the lower bound.     

A note on the number of solutions of the generalized Ramanujan-Nagell equation x 2 ? D = p n

Let D be a positive integer, and let p be an odd prime with p ? D. In this paper we use a result on the rational approximation of quadratic irrationals due to M. Bauer, M.A. Bennett: Applications of the hypergeometric method to the generalized Ramanujan-Nagell equation. Ramanujan J. 6 (2002), 209–270, give a better upper bound for N(D, p), and also prove that if the equation U ² ? DV ² = ?1 has integer solutions (U, V), the least solution (u ₁, v ₁) of the equation u ² ? pv ² = 1 satisfies p ? v ₁, and D > C(p), where C(p) is an effectively computable constant only depending on p, then the equation x ² ? D = p ⁿ has at most two positive integer solutions (x, n). In particular, we have C(3) = 10⁷.     

RELATIONS AMONG SOME PARAMETERS OF HYPERGRAPHS

The relations among the dominating number, independence number and covering number of hypergraphs are investigated. Main results are as follows：Dv（H）≤min{α≤（H）, p（H）, p（H）, T（H）}; De（H）≤min{v（H）, T（H）, p（H）}; DT（H） ≤αT（H）; S（H）≤ Dv （H） ＋ α（H）≤n; 2≤ Dv （H） ＋ T（H） ≤n; 2 〈 Dv （H） ＋ v（H）≤n/2 ＋ [n/r]; Dv （H） ＋ p（H） 〈_n;2≤De（H） ＋ Dv（H）≤n/2 ＋ [n/r];α（H） ＋ De（H）≤n;2 ≤ De（H） ＋ v（H）≤2[n/r]; 2 De（H） ＋ p（H）≤n-r ＋ 2.     

A short proof of Meyniel's theorem

Meyniel's theorem states that a strict diconnected digraph has a directed Hamilton cycle if d(u) + d(v) ? 2n ? 1 for every pair u, v of nonadjacent vertices. We give short proof of this theorem.     

On the number of combinations without unit separation

Let f(n, k) denote the number of ways of selecting k objects from n objects arrayed in a line with no two selected having unit separation (i.e., having exactly one object between them). Then, if $\text{n ? 2(k ? 1), f(n,k)=}\text{∑}\text{i=0}\text{κ}\text{(}\text{n?k+I?2i}\text{k?2i}\text{)}$ (where $\text{κ = [}\text{k}\text{2}\text{]}$). If n < 2(k ? 1), then f(n, k) = 0. In addition, f(n, k) satisfies the recurrence relation f(n, k) = f(n ? 1, k) + f(n ? 3, k ? 1) + f(n ? 4, k ? 2). If the objects are arrayed in a circle, and the corresponding number is denoted by g(n, k), then for n > 3, g(n, k) = f(n ? 2, k) + 2f(n ? 5, k ? 1) + 3f(n ? 6, k ? 2). In particular, if n ? 2k + 1 then $\text{(n,k)=(}\text{n?k}\text{k}\text{)+(}\text{n?k?1}\text{k?1}\text{)}$.     

Extremal problems on detectable colorings of trees

Let G be a connected graph of order 3 or more and let be a coloring of the edges of G (where adjacent edges may be colored the same). For each vertex v of G, the color code of v is the k-tuple c(v)=(a₁,a₂,…,a_k), where a_i is the number of edges incident with v that are colored i (1?i?k). The coloring c is called detectable if distinct vertices have distinct color codes; while the detection number det(G) of G is the minimum positive integer k for which G has a detectable k-coloring. For each integer n?3, let D_T(n) be the maximum detection number among all trees of order n and d_T(n) the minimum detection number among all trees of order n. The numbers D_T(n) and d_T(n) are determined for all integers n?3. Furthermore, it is shown that for integers k?2 and n?3, there exists a tree T of order n having det(T)=k if and only if d_T(n)?k?D_T(n).     

Pancyclic oriented graphs

Let D be an oriented graph of order n ≧ 9 and minimum degree n ? 2. This paper proves that D is pancyclic if for any two vertices u and v, either uv ? A(D), or d_D⁺(u) + d_D^?(v) ≧ n ? 3.     

Volume mean densities for the heat equation

It is shown that, for solid caps D of heat balls in ? ^{d + 1} with center z ₀ = (0, 0), there exist Borel measurable functions w on D such that inf w(D) > 0 and ∫ v(z)w(z) dz ≤ v(z ₀), for every supertemperature v on a neighborhood of D?. This disproves a conjecture by N. Suzuki and N.A. Watson. On the other hand, it turns out that there is no such volume mean density, if the bounded domain D in ? ^d × (?∞, 0) is only slightly wider at z ₀ than a heat ball.     

Multiple solutions of coupled Sturm-Liouville systems

This paper deals with the coupled Sturm-Liouville system ? (pu′)′ + Pu + rv = λ₁u + λ₁N₁₁(u, v) + λ₂N₂₁(u, v), ? (qv′)′ + Qv + ru = λ₂v + λ₁N₁₂(u, v) + λ₂N₂₂(u, v), α₁₁u(0) + α₁₂u′(0) = 0 = α₂₁v(0) + α₂₂v′(0), β₁₁u(1) + β₁₂u′(1) = 0 = β₂₁v(1) + β₂₂v′(1). The functions p, P, q, Q, r are smooth; λ₁ and λ₂ are eigenparameters; N_ij(u, v) is analytic and of higher order. The linearized problem, all $\text{N}{}_{\mathrm{ij}}\text{\&z.tbnd; 0}$, is shown to have eigenvalues (λ₁, λ₂) which are continuously distributed along a sequence of monotonically decreasing curves in the λ₁λ₂-plane. A generalized Lyapunov-Schmidt method establishes that if (λ₁, λ₂) is near a simple eigenvalue of the linearized problem, then the number of small solutions of the nonlinear problem corresponds to the number of real roots of a certain polynomial.