On the Existence of

Let there is an . For or , has been determined by Hanani, and for or , has been determined by the first author. In this paper, we investigate the case . A necessary condition for is . It is known that , and that there is an for all with a possible exception . We need to consider the case . It is proved that there is an for all with an exception and a possible exception , thereby, .     

On the numerical solution of the Klein‐Gordon equation

A predictor–corrector (P–C) scheme based on the use of rational approximants of second‐order to the matrix‐exponential term in a three‐time level reccurence relation is applied to the nonlinear Klein‐Gordon equation. This scheme is accelerated by using a modification (MPC) in which the already evaluated values are used for the corrector. Both the predictor and the corrector scheme are analyzed for local truncation error and stability. The proposed method is applied to problems possessing periodic, kinks and single, double‐soliton waves. The accuracy as well as the long time behavior of the proposed scheme is discussed. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

On the eigenvectors of the q‐Bernstein operators

In this article, both the eigenvectors and the eigenvalues of the q‐Bernstein operators have been studied. Explicit formulae are presented for the eigenvectors, whose limit behavior is determined both in the case 0 < q < 1 and in the case q > 1. Because the classical case, where q = 1, was investigated exhaustively by S. Cooper and S. Waldron back in 2000, the present article also discusses the related similarities and distinctions with the results in the classical case. Copyright © 2013 John Wiley & Sons, Ltd.     

Spaces of Bessel‐potential type and embeddings: the super‐limiting case

We consider Bessel‐potential spaces modelled upon Lorentz‐Karamata spaces and establish embedding theorems in the super‐limiting case. In addition, we refine a result due to Triebel, in the context of Bessel‐potential spaces, itself an improvement of the Brézis‐Wainger result (super‐limiting case) about the “almost Lipschitz continuity” of elements of H^1+n/p_p (?ⁿ). These results improve and extend results due to Edmunds, Gurka and Opic in the context of logarithmic Bessel potential spaces. We also give examples of embeddings of Besselpotential type spaces which are not of logarithmic type. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Algebraization of the Three‐valued BCK‐logic

In this paper a definition of n‐valued system in the context of the algebraizable logics is proposed. We define and study the variety V₃, showing that it is definitionally equivalent to the equivalent quasivariety semantics for the “Three‐valued BCK‐logic”. As a consequence we find an axiomatic definition of the above system.     

An Asymptotic Version of the Multigraph 1‐Factorization Conjecture

We give a self‐contained proof that for all positive integers r and all , there is an integer such that for all any regular multigraph of order 2n with multiplicity at most r and degree at least is 1‐factorizable. This generalizes results of Perkovi? and Reed (Discrete Math 165/166 (1997), 567–578) and Plantholt and Tipnis (J London Math Soc 44 (1991), 393–400).     

Remarks on the qualitative behavior of the undamped Klein‐Gordon equation

We consider the undamped Klein‐Gordon equation in bounded domains with homogeneous Dirichlet boundary conditions. For any real value of the initial energy, particularly for supercritical values of the energy, we give sufficient conditions to conclude blow‐up in finite time of weak solutions. The success of the analysis is based on a detailed analysis of a differential inequality. Our results improve previous ones in the literature.     

Asymptotic results on the existence of 4‐RGDDs and uniform 5‐GDDs

In this paper, we continue to investigate the existence of 4‐RGDDs and uniform 5‐GDDs. It is proved that the necessary conditions for the existence of such designs are also sufficient with a finite number of possible exceptions. As an application, the known results on the existence of uniform 4‐frames are also improved. © 2004 Wiley Periodicals, Inc.     

On the Cauchy problem for the two‐component b‐family system

In this paper, we establish the local well‐posedness for the two‐component b‐family system in a range of the Besov space. We also derive the blow‐up scenario for strong solutions of the system. In addition, we determine the wave‐breaking mechanism to the two‐component Dullin–Gottwald–Holm system. Copyright © 2013 John Wiley & Sons, Ltd.     

Solution of solute transport in unsaturated porous media by the method of characteristics

A degenerate convection‐diffusion problem is approximated using the scheme that is based on the relaxation method and also the method of characteristics. A mathematical model for solute transport in unsaturated porous media is included. Moreover, multiple site adsorption is considered. Convergence of the scheme is proved and numerical experiments in 1D and 2D are presented. © 2003 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 19: 732–761, 2003.     

Convergence of V‐ and F‐cycle multigrid methods for the biharmonic problem using the Hsieh‐Clough‐Tocher element

Multigrid V‐ and F‐cycle algorithms for the biharmonic problem using the H‐C‐T element are studied in the article. We show that the contraction numbers can be uniformly improved by increasing the number of smoothing steps. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

Convergence analysis of the streamline diffusion and discontinuous Galerkin methods for the Vlasov‐Fokker‐Planck system

We prove stability estimates and derive optimal convergence rates for the streamline diffusion and discontinuous Galerkin finite element methods for discretization of the multi‐dimensional Vlasov‐Fokker‐Planck system. The focus is on the theoretical aspects, where we deal with construction and convergence analysis of the discretization schemes. Some related special cases are implemented in M. Asadzadeh [Appl Comput Meth 1(2) (2002), 158–175] and M. Asadzadeh and A. Sopasakis [Comput Meth Appl Mech Eng 191(41–42) (2002), 4641–4661]. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005     

s‐Regular cubic graphs as coverings of the complete bipartite graph K3,3

A graph is s‐regular if its automorphism group acts freely and transitively on the set of s‐arcs. An infinite family of cubic 1‐regular graphs was constructed in [10], as cyclic coverings of the three‐dimensional Hypercube. In this paper, we classify the s‐regular cyclic coverings of the complete bipartite graph K_3,3 for each ≥ 1 whose fibre‐preserving automorphism subgroups act arc‐transitively. As a result, a new infinite family of cubic 1‐regular graphs is constructed. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 101–112, 2004     

On the stability of alternating‐direction explicit methods for advection‐diffusion equations

Alternating‐Direction Explicit (A.D.E.) finite‐difference methods make use of two approximations that are implemented for computations proceeding in alternating directions, e.g., from left to right and from right to left, with each approximation being explicit in its respective direction of computation. Stable A.D.E. schemes for solving the linear parabolic partial differential equations that model heat diffusion are well‐known, as are stable A.D.E. schemes for solving the first‐order equations of fluid advection. Several of these are combined here to derive A.D.E. schemes for solving time‐dependent advection‐diffusion equations, and their stability characteristics are discussed. In each case, it is found that it is the advection term that limits the stability of the scheme. The most stable of the combinations presented comprises an unconditionally stable approximation for computations carried out in the direction of advection of the system, from left to right in this case, and a conditionally stable approximation for computations proceeding in the opposite direction. To illustrate the application of the methods and verify the stability conditions, they are applied to some quasi‐linear one‐dimensional advection‐diffusion problems. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Non‐compactness of the solution operator to $ \bar \partial $ on the Fock‐space in several dimensions

We consider the canonical solution operator to restricted to (0, 1)‐forms with coefficients in the generalized Fock‐spaces (1) We will show that the canonical solution operator restricted to (0, 1)‐forms with ‐coefficients can be interpreted as a Hankel‐operator. Furthermore we will show that the canonical solution operator is not compact for m ≥ 2. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the Existence of Friendship Hypergraphs

A 3‐uniform friendship hypergraph is a 3‐uniform hypergraph in which, for all triples of vertices x, y, z there exists a unique vertex w, such that , and are edges in the hypergraph. Sós showed that such 3‐uniform friendship hypergraphs on n vertices exist with a so‐called universal friend if and only if a Steiner triple system, exists. Hartke and Vandenbussche used integer programming to search for 3‐uniform friendship hypergraphs without a universal friend and found one on 8, three nonisomorphic on 16 and one on 32 vertices. So far, these five hypergraphs are the only known 3‐uniform friendship hypergraphs. In this paper we construct an infinite family of 3‐uniform friendship hypergraphs on 2^k vertices and edges. We also construct 3‐uniform friendship hypergraphs on 20 and 28 vertices using a computer. Furthermore, we define r‐uniform friendship hypergraphs and state that the existence of those with a universal friend is dependent on the existence of a Steiner system, . As a result hereof, we know infinitely many 4‐uniform friendship hypergraphs with a universal friend. Finally we show how to construct a 4‐uniform friendship hypergraph on 9 vertices and with no universal friend.     

On the spouse‐loving variant of the Oberwolfach problem

We prove that , the complete graph of even order with a 1‐factor duplicated, admits a decomposition into 2‐factors, each a disjoint union of cycles of length if and only if , except possibly when is odd and . In addition, we show that admits a decomposition into 2‐factors, each a disjoint union of cycles of lengths , whenever are all even.     

On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

We consider the least‐recently‐used cache replacement rule with a Zipf‐type page request distribution and investigate an asymptotic property of the fault probability with respect to an increase of cache size. We first derive the asymptotics of the fault probability for the independent‐request model and then extend this derivation to a general dependent‐request model, where our result shows that under some weak assumptions the fault probability is asymptotically invariant with regard to dependence in the page request process. In a previous study, a similar result was derived by applying a Poisson embedding technique, where a continuous‐time proof was given through some assumptions based on a continuous‐time modeling. The Poisson embedding, however, is just a technique used for the proof and the problem is essentially on a discrete‐time basis; thus, it is preferable to make assumptions, if any, directly in the discrete‐time setting. We consider a general dependent‐request model and give a direct discrete‐time proof under different assumptions. A key to the proof is that the numbers of requests for respective pages represent conditionally negatively associated random variables. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

A method to construct 1‐rotational factorizations of complete graphs and solutions to the oberwolfach problem

The concept of a 1‐rotational factorization of a complete graph under a finite group was studied in detail by Buratti and Rinaldi. They found that if admits a 1‐rotational 2‐factorization, then the involutions of are pairwise conjugate. We extend their result by showing that if a finite group admits a 1‐rotational ‐factorization with even and odd, then has at most conjugacy classes containing involutions. Also, we show that if has exactly conjugacy classes containing involutions, then the product of a central involution with an involution in one conjugacy class yields an involution in a different conjugacy class. We then demonstrate a method of constructing a 1‐rotational ‐factorization under given a 1‐rotational 2‐factorization under a finite group . This construction, given a 1‐rotational solution to the Oberwolfach problem , allows us to find a solution to when the ’s are even (), and when is an odd prime, with no restrictions on the ’s.