Weighted Davenport’s constant and the weighted EGZ Theorem

Let G^∗,G be finite abelian groups with nontrivial homomorphism group . Let Ψ be a non-empty subset of . Let D_Ψ(G) denote the minimal integer, such that any sequence over G^∗ of length D_Ψ(G) must contain a nontrivial subsequence s₁,…,s_r, such that for some ψ_i∈Ψ. Let E_Ψ(G) denote the minimal integer such that any sequence over G^∗ of length E_Ψ(G) must contain a nontrivial subsequence of length |G|,s₁,…,s_|G|, such that for some ψ_i∈Ψ. In this paper, we show that E_Ψ(G)=|G|+D_Ψ(G)−1.     

Matrix-valued polynomials generated by the scalar-type Rodrigues’ formulas

The properties of matrix-valued polynomials generated by the scalar-type Rodrigues’ formulas are analyzed. A general representation of these polynomials is found in terms of products of simple differential operators. The recurrence relations, leading coefficients, completeness are established, as well as, in the commutative case, the second order equations for which these polynomials are eigenfunctions and the corresponding eigenvalues, and ladder operators.A new, direct proof is given to the conjecture of Durán and Grünbaum that if the weights are self-adjoint and positive semidefinite then they are necessarily of scalar type.Commutative classes of orthogonal polynomials (corresponding to weights that are self-adjoint but not positive semidefinite) are found, which satisfy all the properties usually associated to orthogonal polynomials, and are not of scalar type.     

Devaney’s chaos implies distributional chaos in a sequence

Let X be a complete metric space without isolated points, and let f:X→X be a continuous map. In this paper we prove that if f is transitive and has a periodic point of period p, then f is distributionally chaotic in a sequence. Particularly, chaos in the sense of Devaney is stronger than distributional chaos in a sequence.     

On the expressive power of CNF formulas of bounded tree- and clique-width

We study representations of polynomials over a field K from the point of view of their expressive power. Three important examples for the paper are polynomials arising as permanents of bounded tree-width matrices, polynomials given via arithmetic formulas, and families of so called CNF polynomials. The latter arise in a canonical way from families of Boolean formulas in conjunctive normal form. To each such CNF formula there is a canonically attached incidence graph. Of particular interest to us are CNF polynomials arising from formulas with an incidence graph of bounded tree- or clique-width.We show that the class of polynomials arising from families of polynomial size CNF formulas of bounded tree-width is the same as those represented by polynomial size arithmetic formulas, or permanents of bounded tree-width matrices of polynomial size. Then, applying arguments from communication complexity we show that general permanent polynomials cannot be expressed by CNF polynomials of bounded tree-width. We give a similar result in the case where the clique-width of the incidence graph is bounded, but for this we need to rely on the widely believed complexity theoretic assumption #P?FP/poly.     

Convergence rates for weighted sums in noncommutative probability space

We study convergence rates for weighted sums of pairwise independent random variables in a noncommutative probability space of which the weights are in a von Neumann algebra. As applications, we first study convergence rates for weighted sums of random variables in the noncommutative Lorentz space, and second we study convergence rates for weighted sums of probability measures with respect to the free additive convolution.     

Appell’s lemma and conservation laws of KdV equation

An alternative method to construct a class of conservation laws of the KdV equation based on the classical Appell’s lemma and the trace formulas of Deift-Trubowitz type is studied. A new type of infinite sequence of conservation laws whose local densities cannot be expressed in terms of differential polynomials is constructed.     

Asymptotic expansions for infinite weighted convolutions of rapidly varying subexponential distributions

We establish some asymptotic expansions for infinite weighted convolutions of distributions having rapidly varying subexponential tails. Examples are presented, some showing that in order to obtain an expansion with two significant terms, one needs to have a general way to calculate higher order expansions, due to possible cancellations of terms. An algebraic methodology is employed to obtain the results.      

Weaker conditions for the convergence of Newton’s method

Newton’s method is often used for solving nonlinear equations. In this paper, we show that Newton’s method converges under weaker convergence criteria than those given in earlier studies, such as Argyros (2004) [2, p. 387], Argyros and Hilout (2010)[11, p. 12], Argyros et al. (2011) [12, p. 26], Ortega and Rheinboldt (1970) [26, p. 421], Potra and Pták (1984) [36, p. 22]. These new results are illustrated by several numerical examples, for which the older convergence criteria do not hold but for which our weaker convergence criteria are satisfied.     

Classes of series identities and associated hypergeometric reduction formulas

The main object of the present paper is to investigate some classes of series identities and their applications and consequences leading naturally to several (known or new) hypergeometric reduction formulas. We also indicate how some of these series identities and reduction formulas would yield several series identities which emerged recently in the context of fractional calculus (that is, calculus of integrals and derivatives of any arbitrary real or complex order).     

The density condition and distinguishedness for weighted Fréchet spaces of holomorphic functions

We consider weighted Fréchet spaces of holomorphic functions which are defined as countable intersections of weighted Banach spaces of type H^∞. We study when these spaces have Stefan Heinrich's density condition and when they are distinguished.     

A semilocal convergence result for Newton’s method under generalized conditions of Kantorovich

From Kantorovich’s theory we establish a general semilocal convergence result for Newton’s method based fundamentally on a generalization required to the second derivative of the operator involved. As a consequence, we obtain a modification of the domain of starting points for Newton’s method and improve the a priori error estimates. Finally, we illustrate our study with an application to a special case of conservative problems.     

The Cauchy problem for operators with injective symbol in the Lebesgue space <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript> in a domain

Let D be a bounded domain in ? ⁿ (n ≥ 2) with infinitely smooth boundary ?D. We give some necessary and sufficient conditions for the Cauchy problem to be solvable in the Lebesgue space L ²(D) in D for an arbitrary differential operator A having an injective principal symbol. Furthermore, using bases with double orthogonality, we construct Carleman’s formula that restores a (vector-)function in L ²(D) from the Cauchy data given on a relatively open connected set Γ ? ?D and the values Au in D whenever the data belong to L ²(Γ) and L ²(D) respectively.     

On the convergence of Variational multiscale methods based on Newton’s iteration for the incompressible flows

In this paper, the convergence of a general algorithm with θ$\theta$-type stabilization form for the variational multiscale (VMS) method is presented. Meanwhile, explicit-type and implicit-type algorithms with linear convergence and quadratic convergence are derived from the θ$\theta$-type algorithm, respectively. The combination of explicit-type and implicit-type algorithms are applied to adaptive VMS, which shows good efficiency. Finally, some numerical tests are shown to support the convergence analysis.     

Optimality conditions for Hunter’s bound

The bound known as Hunter’s bound states that , where T designates the heaviest spanning tree of the graph on n nodes with edge weights p_i,j. We prove that Hunter’s bound is optimal if and only if the input probabilities are given on a tree.     

An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives

Iterated Greedy (IG) algorithms are based on a very simple principle, are easy to implement and can show excellent performance. In this paper, we propose two new IG algorithms for a complex flowshop problem that results from the consideration of sequence dependent setup times on machines, a characteristic that is often found in industrial settings. The first IG algorithm is a straightforward adaption of the IG principle, while the second incorporates a simple descent local search. Furthermore, we consider two different optimization objectives, the minimization of the maximum completion time or makespan and the minimization of the total weighted tardiness. Extensive experiments and statistical analyses demonstrate that, despite their simplicity, the IG algorithms are new state-of-the-art methods for both objectives.     

On the m order difference sequence space of generalized weighted mean and compact operators

In this article, using generalized weighted mean and difference matrix of order m, we introduce the paranormed sequence space ?(u, v, p; Δ^(m)), which consist of the sequences whose generalized weighted Δ^(m)-difference means are in the linear space ?(p) defined by I.J. Maddox. Also, we determine the basis of this space and compute its α-, β- and γ-duals. Further, we give the characterization of the classes of matrix mappings from ?(u, v, p, Δ^(m)) to ?_∞, c and c₀. Finally, we apply the Hausdorff measure of noncompacness to characterize some classes of compact operators given by matrices on the space ?_p(u, v, Δ^(m))(1 ≤ p < ∞).     

Ramanujan formula for the generalized Stirling approximation

The aim of this paper is to improve Ramanujan’s formula for approximation of the factorial function, starting from Burnside’s formula in contradistinction with the classical formula that starts from Stirling’s formula.     

Sharp error estimates for the numerical differentiation formulas on the classes of entire functions of exponential type

We establish sharp error estimates for some numerical di.erentiation formulas on the classes of entire functions of exponential type. The estimates strengthen some classical sharp inequalities of approximation theory.     

Attracting cycles for the relaxed Newton’s method

We study the relaxed Newton’s method applied to polynomials. In particular, we give a technique such that for any n≥2, we may construct a polynomial so that when the method is applied to a polynomial, the resulting rational function has an attracting cycle of period n. We show that when we use the method to extract radicals, the set consisting of the points at which the method fails to converge to the roots of the polynomial p(z)=z^m−c (this set includes the Julia set) has zero Lebesgue measure. Consequently, iterate sequences under the relaxed Newton’s method converge to the roots of the preceding polynomial with probability one.