Minimum degree conditions for -linked graphs

For a fixed multigraph H with vertices w₁,…,w_m, a graph G is H-linked if for every choice of vertices v₁,…,v_m in G, there exists a subdivision of H in G such that v_i is the branch vertex representing w_i (for all i). This generalizes the notions of k-linked, k-connected, and k-ordered graphs.Given a connected multigraph H with k edges and minimum degree at least two and n7.5k, we determine the least integer d such that every n-vertex simple graph with minimum degree at least d is H-linked. This value D(H,n) appears to equal the least integer d^′ such that every n-vertex graph with minimum degree at least d^′ is b(H)-connected, where b(H) is the maximum number of edges in a bipartite subgraph of H.     

On reducibility of n-ary quasigroups

An n-ary operation Q:Σⁿ→Σ is called an n-ary quasigroup of order |Σ| if in the relation x₀=Q(x₁,…,x_n) knowledge of any n elements of x₀,…,x_n uniquely specifies the remaining one. Q is permutably reducible if Q(x₁,…,x_n)=P(R(x_σ(1),…,x_σ(k)),x_σ(k+1),…,x_σ(n)) where P and R are (n-k+1)-ary and k-ary quasigroups, σ is a permutation, and 1<k<n. An m-ary quasigroup S is called a retract of Q if it can be obtained from Q or one of its inverses by fixing n-m>0 arguments. We prove that if the maximum arity of a permutably irreducible retract of an n-ary quasigroup Q belongs to {3,…,n-3}, then Q is permutably reducible.     

Highly connected coloured subgraphs via the regularity lemma

For integers , n≥k and r≥s, let m(n,r,s,k) be the largest (in order) k-connected component with at most s colours one can find in any r-colouring of the edges of the complete graph K_n on n vertices. Bollobás asked for the determination of m(n,r,s,k).Here, bounds are obtained in the cases s=1,2 and k=o(n), which extend results of Liu, Morris and Prince. Our techniques use Szemerédi’s Regularity Lemma for many colours.We shall also study a similar question for bipartite graphs.     

Dynamical analysis of the transmission of seasonal diseases using the differential transformation method

The aim of this paper is to apply the differential transformation method (DTM) to solve systems of nonautonomous nonlinear differential equations that describe several epidemic models where the solutions exhibit periodic behavior due to the seasonal transmission rate. These models describe the dynamics of the different classes of the populations. Here the concept of DTM is introduced and then it is employed to derive a set of difference equations for this kind of epidemic models. The DTM is used here as an algorithm for approximating the solutions of the epidemic models in a sequence of time intervals. In order to show the efficiency of the method, the obtained numerical results are compared with the fourth-order Runge–Kutta method solutions. Numerical comparisons show that the DTM is accurate, easy to apply and the calculated solutions preserve the properties of the continuous models, such as the periodic behavior. Furthermore, it is showed that the DTM avoids large computational work and symbolic computation.     

Existence of periodic solutions for a fourth-order -Laplacian equation with a deviating argument

In this paper, we study the existence of periodic solutions for a fourth-order p-Laplacian differential equation with a deviating argument as follows:

[φ_p(u^″(t))]^″+f(u^″(t))+g(u(t−τ(t)))=e(t).

Under various assumptions, the existence of periodic solutions of the problem is obtained by applying Mawhin’s continuation theorem.     

Error-correcting pooling designs associated with some distance-regular graphs

Motivated by the pooling designs over the incidence matrices of matchings with various sizes of the complete graph K_2n considered by Ngo and Du [Ngo and Du, Discrete Math. 243 (2003) 167–170], two families of pooling designs over the incidence matrices oft-cliques (resp. strongly t-cliques) with various sizes of the Johnson graph J(n,t) (resp. the Grassmann graph J_q(n,t)) are considered. Their performances as pooling designs are better than those given by Ngo and Du. Moreover, pooling designs associated with other special distance-regular graphs are also considered.     

Soliton solutions of a BBM(m, n) equation with generalized evolution

We consider a BBM(m, n) equation which is a generalization of the celebrated Benjamin-Bona-Mahony equation with generalized evolution term. By using two solitary wave ansatze in terms of sech^p(x) and tanh^p(x) functions, we find exact analytical bright and dark soliton solutions for the considered model. The physical parameters in the soliton solutions are obtained as function of the dependent model coefficients. The conditions of existence of solitons are presented. Note that, it is always useful and desirable to construct exact analytical solutions especially soliton-type envelope for the understanding of most nonlinear physical phenomena.     

Application of continuous-time programming problems to a class of variational-type inequalities

In this paper, we establish sufficiency criteria under generalized ρ−(η,θ)-invexity conditions for general continuous-time programming problems with nonlinear equality/inequality constraints. Using this we establish some existence criteria for solutions of a class of variational-type inequalities.     

The limiting case of Haglund's (q,t)-Schröder theorem and an involution formula

As a generalization of Haglund's statistic on Dyck paths [Conjectured statistics for the q,t-Catalan numbers, Adv. Math. 175 (2) (2003) 319–334; A positivity result in the theory of Macdonald polynomials, Proc. Nat. Acad. Sci. 98 (2001) 4313–4316], Egge et al. introduced the (q,t)-Schröder polynomial S_n,d(q,t), which evaluates to the Schröder number when q=t=1 [A Schröder generalization of Haglund's statistic on Catalan paths, Electron. J. Combin. 10 (2003) 21pp (Research Paper 16, electronic)]. In their paper, S_n,d(q,t) was conjectured to be equal to the coefficient of a hook shape on the Schur function expansion of the symmetric function e_n, which Haiman [Vanishing theorems and character formulas for the Hilbert scheme of points in the plane, Invent. Math. 149 (2002) 371–407] has shown to have a representation-theoretic interpretation. This conjecture was recently proved by Haglund [A proof of the q,t-Schröder conjecture, Internat. Math. Res. Not. (11) (2004) 525–560]. However, because that proof makes heavy use of symmetric function identities and plethystic machinery, the combinatorics behind it is not understood. Therefore, it is worthwhile to study it combinatorially. This paper investigates the limiting case of the (q,t)-Schröder Theorem and obtains interesting results by looking at some special cases.     

Christoffel-type functions for -orthogonal polynomials for Freud weights

This paper gives upper and lower bounds of the Christoffel-type functions , for the m-orthogonal polynomials for a Freud weight W=e^-Q, which are given as follows. Let a_n=a_n(Q) be the nth Mhaskar–Rahmanov–Saff number, φ_n(x)=max{n^-2/3,1-|x|/a_n}, and d>0. Assume that QC(R) is even, , and for some A,B>1

Then for xR

and for |x|a_n(1+dn^-2/3)

     

Minimum number of below average triangles in a weighted complete graph

Let G be an edge weighted graph with n nodes, and let A(3,G) be the average weight of a triangle in G. We show that the number of triangles with weight at most equal to A(3,G) is at least (n−2) and that this bound is sharp for all n≥7. Extensions of this result to cliques of cardinality k>3 are also discussed.     

Connected -tuple twin domination in de Bruijn and Kautz digraphs

For a digraph G, a k-tuple twin dominating set D of G for some fixed k≥1 is a set of vertices such that every vertex is adjacent to at least k vertices in D, and also every vertex is adjacent from at least k vertices in D. If the subgraph of G induced by D is strongly connected, then D is called a connected k-tuple twin dominating set of G. In this paper, we give constructions of minimal connected k-tuple twin dominating sets for de Bruijn digraphs and Kautz digraphs.     

The topological structure of fuzzy sets with endograph metric

For a non-degenerate convex subset Y of the n-dimensional Euclidean space Rⁿ, let be the family of all fuzzy sets ofRⁿ, which are upper-semicontinuous, fuzzy convex and normal with compact supports contained in Y. We show that the space with the topology of endograph metric is homeomorphic to the Hilbert cube Q=[-1,1]^ω iff Y is compact; and the space is homeomorphic to {(x_n)Q:sup|x_n|<1} iff Y is non-compact and locally compact.     

New exact solutions to the -dimensional Konopelchenko–Dubrovsky equation

In this paper, the extended tanh method, the sech–csch ansatz, the Hirota’s bilinear formalism combined with the simplified Hereman form and the Darboux transformation method are applied to determine the traveling wave solutions and other kinds of exact solutions for the (2+1)-dimensional Konopelchenko–Dubrovsky equation and abundant new soliton solutions, kink solutions, periodic wave solutions and complexiton solutions are formally derived. The work confirms the significant features of the employed methods and shows the variety of the obtained solutions.     

Existence results for -point boundary value problem of second order ordinary differential equations

This study concerns the existence of positive solutions to the boundary value problemwhere ξ_i(0,1) with 0<ξ₁<ξ₂<<ξ_n-2<1, a_i, b_i[0,∞) with and . By applying the Krasnoselskii's fixed-point theorem in Banach spaces, some sufficient conditions guaranteeing the existence of at least one positive solution or at least two positive solutions are established for the above general n-point boundary value problem.     

Interlacing and spacing properties of zeros of polynomials, in particular of orthogonal and -minimal polynomials,

Let be a sequence of polynomials with real coefficients such that uniformly for [α-δ,β+δ] with G(eⁱ)≠0 on [α,β], where 0α<βπ and δ>0. First it is shown that the zeros of are dense in [α,β], have spacing of precise order π/n and are interlacing with the zeros of p_n+1(cos) on [α,β] for every nn₀. Let be another sequence of real polynomials with uniformly on [α-δ,β+δ] and on [α,β]. It is demonstrated that for all sufficiently large n the zeros of p_n(cos) and strictly interlace on [α,β] if on [α,β]. If the last expression is zero then a weaker kind of interlacing holds. These interlacing properties of the zeros are new for orthogonal polynomials also. For instance, for large n a simple criteria for interlacing of zeros of Jacobi polynomials on [-1+,1-], >0, is obtained. Finally it is shown that the results hold for wide classes of weighted L_q-minimal polynomials, q[1,∞], linear combinations and products of orthogonal polynomials, etc.     

-Linked planar graphs

A graph G is (m,n)-linked if for any two disjoint subsets R,BV(G) with |R|m and |B|n, G has two disjoint connected subgraphs containing R and B, respectively. We shall prove that a planar graph with at least six vertices is (3,3)-linked if and only if G is 4-connected and maximal.     

Labeling the -path with a condition at distance two

For integer r≥2, the infinite r-path P_∞(r) is the graph on vertices …v₋₃,v₋₂,v₋₁,v₀,v₁,v₂,v₃… such that v_s is adjacent to v_t if and only if |s−t|≤r−1. The r-path on n vertices is the subgraph of P_∞(r) induced by vertices v₀,v₁,v₂,…,v_n−1. For non-negative reals x₁ and x₂, a λ_x1,x2-labeling of a simple graph G is an assignment of non-negative reals to the vertices of G such that adjacent vertices receive reals that differ by at least x₁, vertices at distance two receive reals that differ by at least x₂, and the absolute difference between the largest and smallest assigned reals is minimized. With λ_x1,x2(G) denoting that minimum difference, we derive λ_x1,x2(P_n(r)) for r≥3, 1≤n≤∞, and . For , we obtain upper bounds on λ_x1,x2(P_∞(r)) and use them to give λ_x1,x2(P_∞(r)) for r≥5 and . We also determine λ_x1,x2(P_∞(3)) and λ_x1,x2(P_∞(4)) for all .     

On the nonlinear wave equation with the mixed nonhomogeneous conditions: Linear approximation and asymptotic expansion of solutions

In this paper, we consider the following nonlinear wave equation

(1)

where , , μ, f, g are given functions. To problem (1), we associate a linear recursive scheme for which the existence of a local and unique weak solution is proved by applying the Faedo–Galerkin method and the weak compact method. In the case of , , μ(z)≥μ₀>0, μ₁(z)≥0, for all , and , , , a weak solution u_ε1,ε2(x,t) having an asymptotic expansion of order N+1 in two small parameters ε₁, ε₂ is established for the following equation associated to (1)_2,3:

(2)

     

Anti-periodic solutions for a class of nonlinear th-order differential equations with delays

In this paper, we use the Leray–Schauder degree theory to establish new results on the existence and uniqueness of anti-periodic solutions for a class of nonlinear nth-order differential equations with delays of the form

x⁽ⁿ⁾(t)+f(t,x⁽ⁿ⁻¹⁾(t))+g(t,x(t−τ(t)))=e(t).