PDα‐type distributed learning control for nonlinear fractional‐order multiagent systems

This paper considers the consensus tacking problem for nonlinear fractional‐order multiagent systems by presenting a PD^α‐type iterative learning control update law with initial learning mechanisms. The asymptotical convergence of the proposed distributed learning algorithm is strictly proved by using the properties of fractional calculus. A sufficient condition is derived to guarantee the whole multiagent system achieving an asymptotic output consensus. An illustrative example is given to verify the theoretical results.     

Multiple Phase Transitions in Long‐Range First‐Passage Percolation on Square Lattices

We consider a model of long‐range first‐passage percolation on the d‐dimensional square lattice ?d in which any two distinct vertices x,y ? ?^d are connected by an edge having exponentially distributed passage time with mean ‖ x – y ‖^α+o(1), where α > 0 is a fixed parameter and ‖·‖ is the l¹–norm on ?^d. We analyze the asymptotic growth rate of the set ß_t, which consists of all x ? ?^d such that the first‐passage time between the origin 0 and x is at most t as t → ∞. We show that depending on the values of α there are four growth regimes: (i) instantaneous growth for α < ^d, (ii) stretched exponential growth for α ? d,2d), (iii) superlinear growth for α ? (2d,2d + 1), and finally (iv) linear growth for α > 2d + 1 like the nearest‐neighbor first‐passage percolation model corresponding to α=∞. © 2015 Wiley Periodicals, Inc.     

Web‐compact spaces,Fréchet‐Urysohn groups and a Suslin closed graph theorem

A topological space X is strongly web‐compact if X admits a family {A_α: α ∈ ?^?} of relatively countably compact sets covering X and such that A_α ? A_β for α ≤ β. The main result of this paper states the following: Theorem A Let X and Y be topological groups and f a homomorphism between X and Y with closed graph. If X is Fréchet‐Urysohn and Baire and Y is strongly web‐compact, then f is continuous. This extends a result of Valdivia. We provide an example showing that the property of being strongly web‐compact is not productive. This applies to show that there are quasi‐Suslin spaces X whose product X × X is not quasi‐Suslin (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A consistency result on cardinal sequences of scattered Boolean spaces

We prove that if GCH holds and τ = 〈κ_α : α < η 〉 is a sequence of infinite cardinals such that κ_α ≥ |η | for each α < η, then there is a cardinal‐preserving partial order that forces the existence of a scattered Boolean space whose cardinal sequence is τ. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Regular reals

Say that α is an n‐strongly c. e. (n‐strongly computably enumerable) real if α is a sum of n many strongly c. e. reals, and that α is regular if α is n‐strongly c. e. for some n. Let Sⁿ be the set of all n‐strongly c. e. reals, Reg be the set of regular reals and CE be the set of c. e. reals. Then we have: S¹ ? S² ? · · · ? Sⁿ ? · · · ? ? Reg ? CE . This gives a hierarchy of the c. e. reals. We also study the regularity of the d. c. e. reals. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A calculus for ideal triangulations of three‐manifolds with embedded arcs

Refining the notion of an ideal triangulation of a compact three‐manifold, we provide in this paper a combinatorial presentation of the set of pairs (M,α), where M is a three‐manifold and α is a collection of properly embedded arcs. We also show that certain well‐understood combinatorial moves are sufficient to relate to each other any two refined triangulations representing the same (M,α). Our proof does not assume the Matveev–Piergallini calculus for ideal triangulations, and actually easily implies this calculus. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the Distribution of the Derivative Zeros of a Complex Polynomial

We consider the class S(n) of all complex polynomials of degree n > 1 having all their zeros in the closed unit disk ē. By S(n,β) we denote the subclass of p ? S(n) vanishing in the prescribed point β ? ē. For an arbitrary point α ? C and p ? S(n,β) let |p| _α be the distance of α and the set of zeros of P'. Then there exists some P ? S(n,β) with maximal |P|α. We give an estimation for the number of zeros of P on |z| = 1$ resp. P' on $ |z-α| = |P| _α .     

On neat embeddings of cylindric algebras

We show that certain properties of dimension complemented cylindric algebras, concerning neat embeddings, do not generalize much further. Let α ≥ ω. There are non‐isomorphic representable cylindric algebras of dimension α each of which is a generating subreduct of the same β dimensional cylindric algebra. We also show that there exists a representable cylindric algebra ?? of dimension α, such that ?? is a generating subreduct of ?? and ??′, both in CA_{α +ω} , however ?? and ??′ are not isomorphic. This settle questions raised by Henkin, Monk and Tarski (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The limit behavior of the second‐grade fluid equations

In the paper, the limit behavior of solutions to the second‐grade fluid system with no‐slip boundary conditions is studied as both ν→0 and α→0. More precisely, it is verified that the convergence from second‐grade fluid system to Euler system holds as ν→0 and α→0 independently under the radial symmetry case.     

Blowup of solutions for a class of non‐linear evolution equations with non‐linear damping and source terms

We consider the blowup of solutions of the initial boundary value problem for a class of non‐linear evolution equations with non‐linear damping and source terms. By using the energy compensation method, we prove that when p>max{m, α}, where m, α and p are non‐negative real numbers and m+1, α+1, p+1 are, respectively, the growth orders of the non‐linear strain terms, damping term and source term, under the appropriate conditions, any weak solution of the above‐mentioned problem blows up in finite time. Comparison of the results with the previous ones shows that there exist some clear condition boundaries similar to thresholds among the growth orders of the non‐linear terms, the states of the initial energy and the existence and non‐existence of global weak solutions. Copyright © 2002 John Wiley & Sons, Ltd.     

Analysis of the operator splitting scheme for the Cahn‐Hilliard equation with a viscosity term

In this paper, we consider a second‐order fast explicit operator splitting method for the viscous Cahn‐Hilliard equation, which includes a viscosity term αΔu_t (α ∈ (0, 1)) described the influences of internal micro‐forces. The choice α = 0 corresponds to the classical Cahn‐Hilliard equation whilst the choice α = 1 recovers the nonlocal Allen‐Cahn equation. The fundamental idea of our method is to split the original problem into linear and nonlinear parts. The linear subproblem is numerically solved using a pseudo‐spectral method, and thus an ordinary differential equation is obtained. The nonlinear one is solved via TVD‐RK method. The stability and convergence are discussed in L²‐norm. Numerical experiments are performed to validate the accuracy and efficiency of the proposed method. Besides, a detailed comparison is made for the dynamics and the coarsening process of the metastable pattern for various values of α. Moreover, energy degradation and mass conservation are also verified.     

Spanning trees in randomly perturbed graphs

A classical result of Komlós, Sárközy, and Szemerédi states that every n‐vertex graph with minimum degree at least (1/2 + o(1))n contains every n‐vertex tree with maximum degree . Krivelevich, Kwan, and Sudakov proved that for every n‐vertex graph G_α with minimum degree at least αn for any fixed α > 0 and every n‐vertex tree T with bounded maximum degree, one can still find a copy of T in G_α with high probability after adding O(n) randomly chosen edges to G_α. We extend the latter results to trees with (essentially) unbounded maximum degree; for a given and α > 0, we determine up to a constant factor the number of random edges that we need to add to an arbitrary n‐vertex graph with minimum degree αn in order to guarantee with high probability a copy of any fixed n‐vertex tree with maximum degree at most Δ.     

Time decay rate for two 3D magnetohydrodynamics‐ α models

We consider the long time behavior of solutions to the magnetohydrodynamics‐ α model in three spatial dimensions. Time decay rate in L²‐norm of the solution is obtained. Similar results for a generalized Leray‐ α‐magnetohydrodynamics model are also established. As a by‐product, an optimal time decay rate for the Navier–Stokes‐ α model is achieved. Copyright © 2013 John Wiley & Sons, Ltd.     

The evolution dam problem for a compressible fluid with nonlinear Darcy's law and Dirichlet boundary condition

In this paper, we consider the evolution dam problem (P) related to a compressible fluid flow governed by a generalized nonlinear Darcy's law with Dirichlet boundary conditions on some part of the boundary. We establish existence of a solution for this problem. We choose a convenient regularized problem (P_?) for which we prove the existence and uniqueness of solution using the comparison Lemma 2.1 and the Schauder fixed‐point theorem. Then, we pass to the limit, when ? goes to 0, to get a solution for our problem. Moreover, we will see another approach for the incompressible case where we pass to the limit in (P), when α goes to 0, to get a solution.     

Claw‐free circular‐perfect graphs

The circular chromatic number of a graph is a well‐studied refinement of the chromatic number. Circular‐perfect graphs form a superclass of perfect graphs defined by means of this more general coloring concept. This article studies claw‐free circular‐perfect graphs. First, we prove that if G is a connected claw‐free circular‐perfect graph with χ(G)>ω(G), then min{α(G), ω(G)}=2. We use this result to design a polynomial time algorithm that computes the circular chromatic number of claw‐free circular‐perfect graphs. A consequence of the strong perfect graph theorem is that minimal imperfect graphs G have min{α(G), ω(G)}=2. In contrast to this result, it is shown in Z. Pan and X. Zhu [European J Combin 29(4) (2008), 1055–1063] that minimal circular‐imperfect graphs G can have arbitrarily large independence number and arbitrarily large clique number. In this article, we prove that claw‐free minimal circular‐imperfect graphs G have min{α(G), ω(G)}≤3. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 163–172, 2010     

Path factors in cubic graphs

Let ? be a set of connected graphs. An ?‐factor of a graph is its spanning subgraph such that each component is isomorphic to one of the members in ?. Let P_k denote the path of order k. Akiyama and Kano have conjectured that every 3‐connected cubic graph of order divisible by 3 has a {P₃}‐factor. Recently, Kaneko gave a necessary and sufficient condition for a graph to have a {P₃, P₄, P₅}‐factor. As a corollary, he proved that every cubic graph has a {P₃, P₄, P₅}‐factor. In this paper, we prove that every 2‐connected cubic graph of order at least six has a {P_k ∣ k ≥ , 6}‐factor, and hence has a {P₃, P₄}‐factor. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 188–193, 2002; DOI 10.1002/jgt.10022     

An a priori error estimate for the finite element modelling of electromagnetic waves interacting with a periodic diffraction grating

An a priori error estimate using a so called α,β‐ periodic transformation to study electromagnetic waves in a periodic diffraction grating is derived. It has been reported for single scattering that there is an instability in numerical methods for high wavenumbers. To address this problem, the analytical solution of the scattering problem when the domain is scatterer free and an unknown function called the α,β‐quasi periodic solution are used to transform the associated Helmholtz problem. The well‐posedness of the resulting continuous problem is analysed before approximating its solution using a finite element discretization. To guarantee the uniqueness of this approximate solution, an a priori error estimate is derived. Finally, numerical results are presented that suggest that the α,β‐quasi periodic method converges at a far lower number of degrees of freedom than the α,0‐quasi periodic method reported previously; especially for high wavenumbers. This is particularly true when the incident wave only undergoes a small perturbation because of the presence of the scatterer. Copyright © 2012 John Wiley & Sons, Ltd.     

Fixed points of (α,ψ)‐contractions in Hausdorff partial metric spaces

The concept of (α,ψ)‐contractions was introduced by Samet et al. in this paper, we introduce (α,ψ)‐generalized contractions in a Hausdorff partial metric space. We discuss its significance and obtain some common fixed point theorems for a pair of self‐mappings. Some examples are given to support the theory.     

On a Class of Integer-Valued Functions

The paper deals with the class of entire functions that increase not faster than exp{γ∣z∣^6/5(ln∣z∣)^?1} and that, together with their first derivatives, take values from a fixed field of algebraic numbers at the points of a two-dimensional lattice of general form (in this case, the values increase not too fast). It is shown that any such functions is either a polynomial or can be represented in the form e^?mαzP(e^αz), where m is a nonnegative integer, P is a polynomial, and α is an algebraic number.

     

Claw‐free graphs and 2‐factors that separate independent vertices

In this article, we prove that a line graph with minimum degree δ≥7 has a spanning subgraph in which every component is a clique of order at least three. This implies that if G is a line graph with δ≥7, then for any independent set S there is a 2‐factor of G such that each cycle contains at most one vertex of S. This supports the conjecture that δ≥5 is sufficient to imply the existence of such a 2‐factor in the larger class of claw‐free graphs. It is also shown that if G is a claw‐free graph of order n and independence number α with δ≥2n/α?2 and n≥3α³/2, then for any maximum independent set S, G has a 2‐factor with α cycles such that each cycle contains one vertex of S. This is in support of a conjecture that δ≥n/α≥5 is sufficient to imply the existence of a 2‐factor with α cycles, each containing one vertex of a maximum independent set. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 251–263, 2012