A Characterization of 3-(γ c , 2)-Critical Claw-Free Graphs Which are not 3-γ c -Critical

Let γ _c (G) denote the minimum cardinality of a connected dominating set for G. A graph G is k-γ _c -critical if γ _c (G) = k, but γ _c (G + xy) < k for ${xy \in E(\overline {G})}$ . Further, for integer r ≥ 2, G is said to be k-(γ _c , r)-critical if γ _c (G) = k, but γ _c (G + xy) < k for each pair of non-adjacent vertices x and y that are at distance at most r apart. k-γ _c -critical graphs are k-(γ _c , r)-critical but the converse need not be true. In this paper, we give a characterization of 3-(γ _c , 2)-critical claw-free graphs which are not 3-γ _c -critical. In fact, we show that there are exactly four classes of such graphs.     

Spreading Properties and Complex Dynamics for Monostable Reaction–Diffusion Equations

This paper is concerned with the study of the large-time behavior of the solutions u of a class of one-dimensional reaction–diffusion equations with monostable reaction terms f, including in particular the classical Fisher-KPP nonlinearities. The nonnegative initial data u ₀(x) are chiefly assumed to be exponentially bounded as x tends to + ∞ and separated away from the unstable steady state 0 as x tends to ? ∞. On the one hand, we give some conditions on u ₀ which guarantee that, for some λ > 0, the quantity c _λ = λ +f′(0)/λ is the asymptotic spreading speed, in the sense that lim  _t→+∞ u(t, ct) = 1 (the stable steady state) if c < c _λ and lim  _t→+∞ u(t, ct) = 0 if c > c _λ. These conditions are fulfilled in particular when u ₀(x) e ^λx is asymptotically periodic as x → + ∞. On the other hand, we also construct examples where the spreading speed is not uniquely determined. Namely, we show the existence of classes of initial conditions u ₀ for which the ω-limit set of u(t, ct + x) as t tends to + ∞ is equal to the whole interval [0, 1] for all x ∈ ? and for all speeds c belonging to a given interval (γ₁, γ₂) with large enough γ₁ < γ₂ ≤ + ∞.     

Heat transfer in a peristaltic flow of MHD fluid with partial slip

In the present note, we have discussed the effects of partial slip on the peristaltic flow of a MHD Newtonian fluid in an asymmetric channel. The governing equations of motion and energy are simplified using a long wave length approximation. A closed form solution of the momentum equation is obtained by Adomian decomposition method and an exact solution of the energy equation is presented in the presence of viscous dissipation term. The expression for pressure rise is calculated using numerical integration. The trapping phenomena is also discussed. The graphical results are presented to interpret various physical parameter of interest. It is found that the temperature field decreases with the increase in slip parameter L, and magnetic field M, while with the increase in P_r and E_c, the temperature field increases.     

Note on the heights of random recursive trees and random m-ary search trees

A process of growing a random recursive tree T_n is studied. The sequence {T_n} is shown to be a sequence of “snapshots” of a Crump–Mode branching process. This connection and a theorem by Kingman are used to show quickly that the height of T_n is asymptotic, with probability one, to c log n. In particular, c = e = 2.718 … for the uniform recursive tree, and c = (2γ)^?1, where γe^1+γ = 1, for the ordered recursive tree. An analogous reduction provides a short proof of Devroye's limit law for the height of a random m-ary search tree. We show finally a close connection between another Devroye's result, on the height of a random union-find tree, and our theorem on the height of the uniform recursive tree. © 1994 John Wiley & Sons, Inc.     

The structure and distances in Yule recursive trees

Based on uniform recursive trees, we introduce random trees with the factor of time, which are named Yule recursive trees. The structure and the distance between the vertices in Yule recursive trees are investigated in this paper. For arbitrary time t > 0, we first give the probability that a Yule recursive tree Y_t is isomorphic to a given rooted tree γ; and then prove that the asymptotic distribution of ζ_t,m, the number of the branches of size m, is the Poisson distribution with parameter λ = 1/m. Finally, two types of distance between vertices in Yule recursive trees are studied, and some limit theorems for them are established.© 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Co‐existence of Poisson and non‐Poisson processes in ordered parallel multilane pedestrian traffic

We show that non‐Poisson and Poisson processes can coexist in ordered parallel multilane pedestrian traffic, in the presence of lane switching which asymmetrically benefits the switchers and nonswitchers. Pedestrians join at the tail end of a queue and transact at the opposite front end. Their aim is to complete a transaction within the shortest possible time, and they can transfer to a shorter queue with probability p_s. Traffic is described by the utilization parameter U = λ〈t_s〉/N, where λ is the average rate of pedestrians entering the system, 〈t_s〉 is the average transaction time, and N is the number of lanes. Using an agent‐based model, we investigate the dependence of the average completion time 〈t_c〉 with variable K = 1 + (1 ? U)^?1 for different N and 〈t_s〉 values. In the absence of switching (p_s = 0), we found that 〈t_c〉 ∝ K^τ, where τ ≈ 1 regardless of N and 〈t_s〉. Lane switching (p_s = 1) reduces 〈t_c〉 for a given K, but its characteristic dependence with K differs for nonswitchers and switchers in the same traffic system. For the nonswitchers, 〈t_c〉 ∝ K^τ, where τ < 1. At low K values, switchers have a larger 〈t_c〉 that also increases more rapidly with K. At large K, the increase rates become equal for both. For nonswitchers, the possible t_c values obey an exponentially decaying probability density function p(t_c). The switchers on the other hand, are described by a fat‐tailed p(t_c) implying that a few are penalized with t_c values that are considerably longer than any of those experienced by nonswitchers. © 2006 Wiley Periodicals, Inc. Complexity 11: 35–42, 2006     

An Outer Commutator Multiplier and Capability of Finitely Generated Abelian Groups

We present an explicit structure for the Baer invariant of a finitely generated abelian group with respect to the variety [𝔑 _{c 1} , 𝔑 _{c 2} ], for all c ₂ ≤ c ₁ ≤ 2c ₂. As a consequence, we determine necessary and sufficient conditions for such groups to be [𝔑 _{c 1} , 𝔑 _{c 2} ]-capable. We also show that if c ₁ ≠ 1 ≠ c ₂, then a finitely generated abelian group is [𝔑 _{c 1} , 𝔑 _{c 2} ]-capable if and only if it is capable. Finally, we show that 𝔖₂-capability implies capability, but there is a capable finitely generated abelian group which is not 𝔖₂-capable.     

The slow wave solution to the FitzHugh-Nagumo equations

This paper gives a new existence proof for a travelling wave solution to the FitzHugh-Nagumo equations, u_t = u_xx +f(u)?w, w _t = ? (u?γw). The proof uses a contraction mapping argument, and also shows that the solution (u, c, w) to the travelling wave equations, where c is the wave speed, converges as ? → 0⁺ to the solution to the equations having ?=0, c=0, and w=0.     

Stability of nonlocal difference schemes in a subspace

We consider a family of two-layer difference schemes for the heat equation with nonlocal boundary conditions containing the parameter γ. In some interval γ ∈ (1, γ ₊), the spectrum of the main difference operator contains a unique eigenvalue λ ₀ in the left complex half-plane, while the remaining eigenvalues λ ₁, λ ₂, …, λ _N?1 lie in the right half-plane. The corresponding grid space H _N is represented as the direct sum H _N = H ₀⊕H _N?1 of a one-dimensional subspace and the subspace H _N?1 that is the linear span of eigenvectors µ⁽¹⁾, µ⁽²⁾, …, µ^(N?1). We introduce the notion of stability in the subspace H _N?1 and derive a stability criterion.     

Some results about operators on L1

Let (Ω, Σ, µ) be a probability space. We give a few results about operators on L₁(µ). Among these, we show that if T is a bounded linear operator on L₁(µ) which acts as a Hilbert-Schmidt operator on L₂(µ), then T : L₁(µ) → L₁(µ) is representable.     

On a method for computing waveguide scattering matrices in the presence of point spectrum

A waveguide occupies a domain G in ? ⁿ⁺¹, n ? 1, having several cylindrical outlets to infinity. The waveguide is described by a general elliptic boundary value problem that is self-adjoint with respect to the Green formula and contains a spectral parameter µ. As an approximation to a row of the scattering matrix S(µ) we suggest a minimizer of a quadratic functional J ^R (·, µ). To construct such a functional, we solve an auxiliary boundary value problem in the bounded domain obtained by cutting off, at a distance R, the waveguide outlets to infinity. It is proved that, if a finite interval [µ₁, µ₂] of the continuous spectrum contains no thresholds, then, as R → ∞, the minimizer tends to the row of the scattering matrix at an exponential rate uniformly with respect to µ ∈ [µ₁, µ₂]. The interval may contain some waveguide eigenvalues whose eigenfunctions exponentially decay at infinity.     

Inertia-preserving secant updates

A class of rank-two, inertia-preserving updates for symmetric matricesH _c is studied. To ensure that inertia is preserved, the updates are chosen to be of the formH ₊=FH _c F ^t, whereF=I+qr ^t, withq andr selected so that the secant equation is satisfied. A characterization is given for all such updates. Using a parameterization of this family of updates, the connection between them and the Broyden class of updates is established. Also, parameter selection criteria that can be used to choose the optimally conditioned update or the update closest to the SR1 update are discussed.The work of the first author was partially supported by AFOSR Grant 84-0326. The work of the second author was partially supported by NSF Grant EAR-82-18743.     

Asymptotics and numerics of polynomials used in Tricomi and Buchholz expansions of Kummer functions

Expansions in terms of Bessel functions are considered of the Kummer function ₁ F ₁(a; c, z) (or confluent hypergeometric function) as given by Tricomi and Buchholz. The coefficients of these expansions are polynomials in the parameters of the Kummer function and the asymptotic behavior of these polynomials for large degree is given. Tables are given to show the rate of approximation of the asymptotic estimates. The numerical performance of the expansions is discussed together with the numerical stability of recurrence relations to compute the polynomials. The asymptotic character of the expansions is explained for large values of the parameter a of the Kummer function.     

The eigenvalues of the sum of matrices with prescribed invariant polynomials *

Let A and B be n×n matrices over a field F, and c ₁,…,c_n ∈F. We give a sufficient condition for the existence of matrices A' and B' similar to A and B, respectively, such that A' + B' has eigenvalues c ₁,…,c_n .     

Qualitative behavior of two systems of higher‐order difference equations

In this paper, we study the qualitative behavior of following two systems of higher‐order difference equations: and where the parameters α,β,γ,α₁,β₁,γ₁,a,b,c,a₁,b₁,andc₁ and the initial conditions x₀, x_?1, ?, x_?k, y₀, y_?1 ,?, y_?k are positive real numbers. More precisely, we study the equilibrium points, local asymptotic stability, instability, global asymptotic stability of equilibrium points, and rate of convergence of positive solutions that converges to the equilibrium point P₀=(0,0) of these systems. Some numerical examples are given to verify our theoretical results. These examples are experimental verification of our theoretical discussions. Copyright © 2015 John Wiley & Sons, Ltd.     

Merging percolation on Zd and classical random graphs: Phase transition

We study a random graph model which is a superposition of bond percolation on Z^d with parameter p, and a classical random graph G(n,c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so‐called “rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe the phase diagram on the set of parameters c ≥ 0 and 0 ≤ p < p_c, where p_c = p_c(d) is the critical probability for the bond percolation on Z^d. The phase transition is of second order as in the classical random graph. We find the scaled size of the largest connected component in the supercritical regime. We also provide a sharp upper bound for the largest connected component in the subcritical regime. The latter is a new result for inhomogeneous random graphs with unbounded kernels. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2010     

When almost all sets are difference dominated

We investigate the relationship between the sizes of the sum and difference sets attached to a subset of {0,1,…,N}, chosen randomly according to a binomial model with parameter p(N), with N^?1 = o(p(N)). We show that the random subset is almost surely difference dominated, as N → ∞, for any choice of p(N) tending to zero, thus confirming a conjecture of Martin and O'Bryant. The proofs use recent strong concentration results. Furthermore, we exhibit a threshold phenomenon regarding the ratio of the size of the difference to the sumset. If p(N) = o(N^?1/2) then almost all sums and differences in the random subset are almost surely distinct and, in particular, the difference set is almost surely about twice as large as the sumset. If N^?1/2 = o(p(N)) then both the sum and difference sets almost surely have size (2N + 1) ? O(p(N)^?2), and so the ratio in question is almost surely very close to one. If p(N) = c · N^?1/2 then as c increases from zero to infinity (i.e., as the threshold is crossed), the same ratio almost surely decreases continuously from two to one according to an explicitly given function of c. We also extend our results to the comparison of the generalized difference sets attached to an arbitrary pair of binary linear forms. For certain pairs of forms f and g, we show that there in fact exists a sharp threshold at c_f,g · N^?1/2, for some computable constant c_f,g, such that one form almost surely dominates below the threshold and the other almost surely above it. The heart of our approach involves using different tools to obtain strong concentration of the sizes of the sum and difference sets about their mean values, for various ranges of the parameter p. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009     

Construction of nonnegative matrices and the inverse eigenvalue problem

This article presents a technique for combining two matrices, an n?×?n matrix M and an m?×?m matrix B, with known spectra to create an (n?+?m???p)?×?(n?+?m???p) matrix N whose spectrum consists of the spectrum of the matrix M and m???p eigenvalues of the matrix B. Conditions are given when the matrix N obtained in this construction is nonnegative. Finally, these observations are used to obtain several results on how to construct a realizable list of n?+?1 complex numbers (λ₁,λ₂,λ₃,σ) from a given realizable list of n complex numbers (c ₁,c ₂,σ), where c ₁ is the Perron eigenvalue, c ₂ is a real number and σ is a list of n???2 complex numbers.     

The Division Relation: Congruence Conditions and Axiomatisability

We examine a universal algebraic abstraction of the semigroup theoretic concept of “divides:” a divides b in an algebra A if for some n ∈ ω, there is a term t(x, y ₁,…, y _n ) involving all of the listed variables, and elements c ₁,…, c _n such that t ^A (a, c ₁,…, c _n ) = b. The first order definability of this relation is shown to be a very broad generalisation of some familiar congruence properties, such as definability of principal congruences. The algorithmic problem of deciding when a finitely generated variety has this relation definable is shown to be equivalent to an open problem concerning flat algebras. We also use the relation as a framework for establishing some results concerning the finite axiomatisability of finitely generated varieties.