Universality and summability of trigonometric polynomials and trigonometric series

Periodica Mathematica Hungarica -     

The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds

This paper is the second of a two part series and describes new lower and upper bounds for a more general version of the Two-Dimensional Finite Bin Packing Problem (2BP) than the one considered in Part I (see Boschetti and Mingozzi 2002). With each item is associated an input parameter specifying if it has a fixed orientation or it can be rotated by . This problem contains as special cases the oriented and non-oriented 2BP. The new lower bound is based on the one described in Part I for the oriented 2BP. The computational results on the test problems derived from the literature show the effectiveness of the new proposed lower and upper bounds.     

An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|r_j|L_max which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity.     

Construction of graphs with given circular flow numbers

Suppose r ≥ 2 is a real number. A proper r‐flow of a directed multi‐graph is a mapping such that (i) for every edge , ; (ii) for every vertex , . The circular flow number of a graph G is the least r for which an orientation of G admits a proper r‐flow. The well‐known 5‐flow conjecture is equivalent to the statement that every bridgeless graph has circular flow number at most 5. In this paper, we prove that for any rational number r between 2 and 5, there exists a graph G with circular flow number r. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 304–318, 2003     

Estimation over Curves of the Functions Given by Dirichlet Series on a Half-Plane

We study the maximal term of the Hadamard composition of Dirichlet series with real exponents. We obtain a lower estimate for the sum of a Dirichlet series over a curve arbitrarily approaching the convergence line.     

HILBERTIAN INVARIANCE PRINCIPLE FOR EMPIRICAL PROCESS ASSOCIATED WITH A MARKOV PROCESS

The authors establish the Hilbertian invariance principle for the empirical process of a stationary Markov process, by extending the forward-backward martingale decomposition of Lyons-Meyer-Zheng to the Hilbert space valued additive functionals associated with general non-reversible Markov processes.     

ASYMPTOTIC NORMALITY OF KERNEL ESTIMATES OF A DENSITY FUNCTION UNDER ASSOCIATION DEPENDENCE

Let {X_n, n≥1} be a strictly stationary sequence of random variables, whichare either associated or negatively associated, f(·) be their common density. In this paper,the author shows a central limit theorem for a kernel estimate of f(·) under certain regularconditions.     

Boolean algebras and uniform convergence of series

Several classical results on uniform convergence of unconditionally Cauchy series are generalized to weakly unconditionally Cauchy series. This uniform convergence is characterized through subalgebras and subfamilies of . A generalization of the Orlicz-Pettis theorem is also proved by mean of subalgebras of .     

A nonterminating 8φ7 summation for the root system Cr

Using multiple q-integrals and a determinant evaluation, we establish a nonterminating ₈φ₇ summation for the root system C_r. We also give some important specializations explicitly.     

Proof of some conjectures on the mean-value of Titchmarsh series — III

With some applications in view, the following problem is solved in some special case which is not too special. LetF(s) =Σ _n ^∞ =1a_n λ _n ^−s be a generalized Dirichlet series with 1 =λ ₁ <λ ₂ < …,λ _n≤Dn, andλ _n+1 -λ _n ≥D ^{− 1} λ _n+1 ^{− a} where α>0 andD(≥ 1) are constants. Then subject to analytic continuation and some growth conditions, a lower bound is obtained for . These results will be applied in other papers to appear later.