Steiner triple systems with two disjoint subsystems

It is shown that there exists a triangle decomposition of the graph obtained from the complete graph of order v by removing the edges of two vertex disjoint complete subgraphs of orders u and w if and only if u,w, and v are odd, (mod 3), and . Such decompositions are equivalent to group divisible designs with block size 3, one group of size u, one group of size w, and v – u – w groups of size 1. This result settles the existence problem for Steiner triple systems having two disjoint specified subsystems, thereby generalizing the well‐known theorem of Doyen and Wilson on the existence of Steiner triple systems with a single specified subsystem. © 2005 Wiley Periodicals, Inc. J Combin Designs     

A proof of Lindner's conjecture on embeddings of partial Steiner triple systems

Lindner's conjecture that any partial Steiner triple system of order u can be embedded in a Steiner triple system of order v if and is proved. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 63–89, 2009     

Existence of 3‐chromatic Steiner quadruple systems

A Steiner quadruple system of order v (briefly SQS (v)) is a pair (X, ), where X is a v‐element set and is a set of 4‐element subsets of X (called blocks or quadruples), such that each 3‐element subset of X is contained in a unique block of . The chromatic number of an SQS(v)(X, ) is the smallest m for which there is a map such that for all , where . The system (X, ) is equitably m‐chromatic if there is a proper coloring with minimal m for which the numbers differ from each other by at most 1. Linek and Mendelsohn showed that an equitably 3‐chromatic SQS(v) exists for v ≡ 4, 8, 10 (mod 12), v ≥ 16. In this article we show that an equitably 3‐chromatic SQS(v) exists for v ≡ 2 (mod 12) with v > 2. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 469–477, 2007     

Explicit sparse almost‐universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$

For any integer n, let be a probability distribution on the family of graphs on n vertices (where every such graph has nonzero probability associated with it). A graph Γ is ‐almost‐universal if Γ satisifies the following: If G is chosen according to the probability distribution , then G is isomorphic to a subgraph of Γ with probability 1 ‐ . For any p ∈ [0,1], let (n,p) denote the probability distribution on the family of graphs on n vertices, where two vertices u and v form an edge with probability p, and the events {u and v form an edge}; u,v ∈ V (G) are mutually independent. For k ≥ 4 and n sufficiently large we construct a ‐almost‐universal‐graph on n vertices and with O(n)polylog(n) edges, where q = ? ? for such k ≤ 6, and where q = ? ? for k ≥ 7. The number of edges is close to the lower bound of Ω( ) for the number of edges in a universal graph for the family of graphs with n vertices and maximum degree k. © 2010 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

On the convergence rate of vanishing viscosity approximations

Given a strictly hyperbolic, genuinely nonlinear system of conservation laws, we prove the a priori bound ‖u(t, ·) ? u^?(t, ·)‖ = O(1)(1 + t) · |ln ?| on the distance between an exact BV solution u and a viscous approximation u^?, letting the viscosity coefficient ? → 0. In the proof, starting from u we construct an approximation of the viscous solution u^? by taking a mollification u * and inserting viscous shock profiles at the locations of finitely many large shocks for each fixed ?. Error estimates are then obtained by introducing new Lyapunov functionals that control interactions of shock waves in the same family and also interactions of waves in different families. © 2004 Wiley Periodicals, Inc.     

Global and blow‐up solutions for non‐linear degenerate parabolic systems

In this paper the degenerate parabolic system u_t=u(u_xx+av). vt=v(v_xx+bu) with Dirichlet boundary condition is studied. For , the global existence and the asymptotic behaviour (α₁=α₂) of solution are analysed. For , the blow‐up time, blow‐up rate and blow‐up set of blow‐up solution are estimated and the asymptotic behaviour of solution near the blow‐up time is discussed by using the ‘energy’ method. Copyright © 2003 John Wiley & Sons, Ltd.     

Blow‐up estimates for a quasi‐linear reaction–diffusion system

In this paper, some sufficient conditions under which the quasilinear elliptic system ‐div(∣?_u∣^p‐2?_u) = uv, ‐div(∣?_u∣^q‐2?_u) = uv in ?^N(N≥3) has no radially symmetric positive solution is derived. Then by using this non‐existence result, blow‐up estimates for a class of quasilinear reaction–diffusion systems u_t = div (∣?_u∣^p‐2?_u)+uv,vt = div(∣?_v∣^q‐2?_v) +uv with the homogeneous Dirichlet boundary value conditions are obtained. Copyright © 2003 John Wiley & Sons, Ltd.     

Resonance phenomena for a class of partial differential equations of higher order in cylindrical waveguides

We consider a domain Ω in ?ⁿ of the form Ω = ?^l × Ω′ with bounded Ω′ ? ?^n?l. In Ω we study the Dirichlet initial and boundary value problem for the equation ? u + [(? ? ?… ? ?)^m + (? ? ?… ? ?)^m]u = fe^?iωt. We show that resonances can occur if 2m ≥ l. In particular, the amplitude of u may increase like t^α (α rational, 0<α<1) or like in t as t∞∞. Furthermore, we prove that the limiting amplitude principle holds in the remaining cases.     

Infinite games in the Cantor space and subsystems of second order arithmetic

In this paper we study the determinacy strength of infinite games in the Cantor space and compare them with their counterparts in the Baire space. We show the following theorems: 1. RCA₀ ? ‐Det* ? ‐Det* ? WKL₀. 2. RCA₀ ? ( )2‐Det* ? ACA₀. 3. RCA₀ ? ‐Det* ? ‐Det* ? ‐Det ? ‐Det ? ATR₀. 4. For 1 < k < ω, RCA₀ ? ( )_k ‐Det* ? ( )_{k –1}‐Det. 5. RCA₀ ? ‐Det* ? ‐Det. Here, Det* (respectively Det) stands for the determinacy of infinite games in the Cantor space (respectively the Baire space), and ( )_k is the collection of formulas built from formulas by applying the difference operator k – 1 times. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Upper bounds on the general covering number Cλ(v,k, t,m)

A collection of k‐subsets (called blocks) of a v‐set X (v) = {1, 2,…, v} (with elements called points) is called a t‐(v, k, m, λ) covering if for every m‐subset M of X (v) there is a subcollection of with such that every block K ∈ has at least t points in common with M. It is required that v ≥ k ≥ t and v ≥ m ≥ t. The minimum number of blocks in a t‐(v, k, m, λ) covering is denoted by C_λ(v, k, t, m). We present some constructions producing the best known upper bounds on C_λ(v, k, t, m) for k = 6, a parameter of interest to lottery players. © 2004 Wiley Periodicals, Inc.     

Construction of graphs with given circular flow numbers

Suppose r ≥ 2 is a real number. A proper r‐flow of a directed multi‐graph is a mapping such that (i) for every edge , ; (ii) for every vertex , . The circular flow number of a graph G is the least r for which an orientation of G admits a proper r‐flow. The well‐known 5‐flow conjecture is equivalent to the statement that every bridgeless graph has circular flow number at most 5. In this paper, we prove that for any rational number r between 2 and 5, there exists a graph G with circular flow number r. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 304–318, 2003     

Unboundedness of solutions of a class of planar Hamiltonian systems

In this paper, the unboundedness of solutions for the following planar Hamilton system Ju ′ = ?H (u) + h (t) is discussed, where the function H (u) ∈ C²(R², R) is positive for u ≠ 0 and is positively (q, p)‐quasihomogeneous of quasi‐degree pq, where p > 1 and + = 1, h: S¹ → R² with h ∈ L^∞(0, 2π) is 2π ‐periodic and J is the standard symplectic matrix. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Tauberian theorem for m‐spherical transforms on the Heisenberg group

In this paper we prove a Tauberian type theorem for the space L ( H _n ). This theorem gives sufficient conditions for a L ( H _n ) submodule J ? L ( H _n ) to make up all of L ( H _n ). As a consequence of this theorem, we are able to improve previous results on the Pompeiu problem with moments on the Heisenberg group for the space L^∞( H _n ). In connection with the Pompeiu problem, given the vanishing of integrals ∫ z ^m L _g f ( z , 0) dσ ( z ) = 0 for all g ∈ H _n and i = 1, 2 for appropriate radii r₁ and r₂, we now have the (improved) conclusion f ≡ 0, where = · · · and form the standard basis for T^(0,1)( H _n ). (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Phase transition for potentials of high‐dimensional wells

For a potential function that attains its global minimum value at two disjoint compact connected submanifolds N^± in , we discuss the asymptotics, as ? → 0, of minimizers u_? of the singular perturbed functional under suitable Dirichlet boundary data . In the expansion of E _? (u_?) with respect to , we identify the first‐order term by the area of the sharp interface between the two phases, an area‐minimizing hypersurface Γ, and the energy c of minimal connecting orbits between N⁺ and N^?, and the zeroth‐order term by the energy of minimizing harmonic maps into N^± both under the Dirichlet boundary condition on ?Ω and a very interesting partially constrained boundary condition on the sharp interface Γ. © 2012 Wiley Periodicals, Inc.     

Giant components in Kronecker graphs

Let \begin{align*}n\in\mathbb{N}\end{align*}, 0 <α,β,γ< 1. Define the random Kronecker graph K(n,α,γ,β) to be the graph with vertex set \begin{align*}\mathbb{Z}_2^n\end{align*}, where the probability that u is adjacent to v is given by p_u,v =α ^{u ? v} γ^{( 1‐u )?( 1‐v )}β^{n‐ u ? v ‐( 1‐u )?( 1‐v )}. This model has been shown to obey several useful properties of real‐world networks. We establish the asymptotic size of the giant component in the random Kronecker graph.© 2011 Wiley Periodicals, Inc. Random Struct. Alg.,2011     

The red‐shift effect and radiation decay on black hole spacetimes

We consider solutions to the linear wave equation □_g? = 0 on a (maximally extended) Schwarzschild spacetime with parameter M > 0, evolving from sufficiently regular initial data prescribed on a complete Cauchy surface Σ, where the data are assumed only to decay suitably at spatial infinity. (In particular, the support of ? may contain the bifurcate event horizon.) It is shown that the energy flux F(??) of the solution (as measured by a strictly timelike T? that asymptotically matches the static Killing field) through arbitrary achronal subsets ?? of the black hole exterior region satisfies the bound F(??) ≤ C E(v + u), where v and u denote the infimum of the Eddington‐Finkelstein advanced and retarded time of ??, v₊ denotes max{1, v}, and u₊ denotes max{1, u}, where C is a constant depending only on the parameter M, and E depends on a suitable norm of the solution on the hypersurface t ? u + v = 1. (The bound applies in particular to subsets ?? of the event horizon or null infinity.) It is also shown that ? satisfies the pointwise decay estimate |?| ≤ C Ev in the entire exterior region, and the estimates |r?| ≤ C_R?E(1 + |u|)^?1/2 and |r^1/2?| ≤ C_R?Eu in the region {r ≥ R?} ∩ J⁺(Σ) for any R? > 2M. The estimates near the event horizon exploit an integral energy identity normalized to local observers. This estimate can be thought to quantify the celebrated red‐shift effect. The results in particular give an independent proof of the classical result |?| ≥ C E of Kay and Wald without recourse to the discrete isometries of spacetime. © 2009 Wiley Periodicals, Inc.     

The spectrum of equitable, 4‐chromatic Steiner quadruple systems

A Steiner quadruple system of order v (briefly an SQS(v)) is a pair (X, ) with |X| = v and a set of quadruples taken from X such that every triple in X is in a unique quadruple in . Hanani [Canad J Math 12 (1960), 145–157] showed that an SQS(v) exists if and only if v is {admissible}, that is, v = 0,1 or v ≡ 2,4 (mod 6). Each SQS(v) has a chromatic number when considered as a 4‐uniform hypergraph. Here we show that a 4‐chromatic SQS(v) exists for all admissible v ≥ 20, and that no 4‐chromatic SQS(v) exists for v < 20. Each system we construct admits a proper 4‐coloring that is equitable, that is, any two color classes differ in size by at most one. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 369–392, 2007     

Random coloring method in the combinatorial problem of Erdős and Lovász

The work deals with a combinatorial problem of P. Erd?s and L. Lovász concerning simple hypergraphs. Let denote the minimum number of edges in an n‐uniform simple hypergraph with chromatic number at least . The main result of the work is a new asymptotic lower bound for . We prove that for large n and r satisfying the following inequality holds where . This bound improves previously known bounds for . The proof is based on a method of random coloring. We have also obtained results concerning colorings of h‐simple hypergraphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

On the Lp–Lq maximal regularity for the linear thermoelastic plate equation in a bounded domain

This paper is concerned with the thermoelastic plate equations in a domain Ω: subject to the boundary condition: u|=D_νu|=θ|=0 and initial condition: (u, u_t, θ)|_t=0=(u₀, v₀, θ₀). Here, Ω is a bounded domain in ?ⁿ(n≧2). We assume that the boundary ?Ω of Ω is a C⁴ hypersurface. We obtain an L_p–L_q maximal regularity theorem. Copyright © 2008 John Wiley & Sons, Ltd.     

A generalization of a result of Tran Van Trung on t-designs

We prove that if there exists a t − (v, k, λ) design satisfying the inequality for some positive integer j (where m = min{j, v − k} and n = min {i, t}), then there exists a t − (v + j, k, λ ()) design. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 107–112, 1999