On upper bounds of Fourier-Walsh coefficients

An upper bound is established for the upper bounds of the Fourier-Walsh coefficients a_n(f) whose modulus of continuity (,f) does not exceed a given modulus of continuity (). In the case of convex majorants of (), these bounds are attained for individual ordinal numbers n.Translated from Matematicheskie Zametki, Vol. 6, No. 6, pp. 725–736, December, 1969.     

On lower and upper bounds of matrices

Using an approach of Bergh, we give an alternate proof of Bennett's result on lower bounds for non-negative matrices acting on non-increasing non-negative sequences in lp when p?1 and its dual version, the upper bounds when 0<p?1. We also determine such bounds explicitly for some families of matrices.     

On upper bounds of bandwidths of trees

ＯＮＵＰＰＥＲＢＯＵＮＤＳＯＦＢＡＮＤＷＩＤＴＨＳＯＦＴＲＥＥＳＷＡＮＧＪＩＡＮＦＡＮＧ（王建方）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ,ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓ,Ｂｅｉｊｉｎｇ１０００８０,Ｃｈｉ...     

On upper bounds for Laplacian graph eigenvalues

In this paper, we obtain the following upper bound for the largest Laplacian graph eigenvalue λ(G):

     

Tight upper bounds for semi-online scheduling on two uniform machines with known optimum

We consider a semi-online version of the problem of scheduling a sequence of jobs of different lengths on two uniform machines with given speeds 1 and s. Jobs are revealed one by one (the assignment of a job has to be done before the next job is revealed), and the objective is to minimize the makespan. In the considered variant the optimal offline makespan is known in advance. The most studied question for this online-type problem is to determine the optimal competitive ratio, that is, the worst-case ratio of the solution given by an algorithm in comparison to the optimal offline solution. In this paper, we make a further step towards completing the answer to this question by determining the optimal competitive ratio for s between \(\frac{5 + \sqrt{241}}{12} \approx 1.7103\) and \(\sqrt{3} \approx 1.7321\), one of the intervals that were still open. Namely, we present and analyze a compound algorithm achieving the previously known lower bounds.

     

On a global upper bound for Jensen's inequality

In this paper we shall give a global upper bound for Jensen's inequality without restrictions on the target convex function f. We also introduce a characteristic c(f) i.e. an absolute constant depending only on f, by which the global bound is improved.     

On upper bounds for positive solutions of semilinear equations

Suppose that E is a bounded domain of class C^2,λ in and L is a uniformly elliptic operator in E. The set of all positive solutions of the equation Lu=ψ(u) in E was investigated by a number of authors for various classes of functions ψ. In Dynkin and Kuznetsov (Comm. Pure Appl. Math. 51 (1998) 897) we defined, for every Borel subset Γ of ∂E, two such solutions u_Γ?w_Γ. We also introduced a class of solutions u_ν in 1-1 correspondence with a certain class of σ-finite measures ν on ∂E. With every we associated a pair (Γ,ν) where Γ is a Borel subset of ∂E and . We called this pair the fine boundary trace of u and we denoted in tr(u).Let u⊕v stand for the maximal solution dominated by u+v. We say that u belongs to the class if the condition tr(u)=(Γ,ν) implies that u?w_Γ⊕u_ν and we say that u belongs to if the condition tr(u)=(Γ,ν) implies that u?u_Γ⊕u_ν.It was proved in Dynkin and Kuznetsov (1998) that, under minimal assumptions on L and ψ, the class contains all bounded domains. It follows from results of Mselati (Thése de Doctorat de l'Université Paris 6, 2002; C.R. Acad. Sci. Paris Sér. I 332 (2002); Mem. Amer. Math. Soc. (2003), to appear), that all E of the class C⁴ belong to where Δ is the Laplacian and ψ(u)=u². [Mselati proved that, in his case, u_Γ=w_Γ and therefore the condition tr(u)=(Γ,ν) implies u=u_Γ⊕u_ν=w_Γ⊕u_ν.]By modifying Mselati's arguments, we extend his result to ψ(u)=u^α with 1<α?2 and all bounded domains of class C^2,λ.We start from proving a general localization theorem: under broad assumptions on L, ψ if, for every y∈∂E there exists a domain such that E′⊂E and ∂E∩∂E′ contains a neighborhood of y in ∂E.     

On upper bounds of sequential stochastic production planning problems

In this paper we consider a class of problems that determine production, inventory and work force levels for a firm in order to meet fluctuating demand requirements. A production planning problem arises because of the need to match, at the firm level, supply and demand efficiently. In practice, the two common approaches to counter demand uncertainties are (i) carrying a constant safety stock from period to period, and (ii) planning with a rolling horizon. Under the rolling horizon (or sequential) strategy the planning model is repeatedly solved, usually at the end of every time period, as new information becomes available and is used to update the model parameters. The costs associated with a rolling horizon strategy are hard to compute a priori because the solution of the model in any intermediate time period depends on the actual demands of the previous periods.In this paper we derive two a priori upper bounds on the costs for a class of production planning problems under the rolling horizon strategy. These upper bounds are derived by establishing correspondences between the rolling horizon problems and related deterministic programs. One of the upper bounds is obtained through Lagrangian relaxation of the service level constraint. We propose refinements to the non-Lagrangian bounds and present limited computational results. Extensions of the main results to the multiple item problems are also discussed. The results of this paper are intended to support production managers in estimating the production costs and value of demand information under a rolling horizon strategy.     

Reduced-basis approximation of the viscous Burgers equation: rigorous a posteriori error bounds

We present rigorous, sharp, and inexpensive a posteriori error bounds for reduced-basis approximations of the viscosity-parametrized Burgers equation. There are two critical ingredients: the Brezzi, Rappaz and Raviart (Numer. Math. 36 (1980) 1–25) framework for analysis of approximations of nonlinear elliptic partial differential equations; and offline/online computational procedures for efficient calculation of the necessary continuity and stability constants, and of the dual norm of the residual. Numerical results confirm the performance of the error bounds. To cite this article: K. Veroy et al., C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

Lower bounds and upper bounds for chromatic polynomials

In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on n vertices having m edges and girth exceeding g © 1993 John Wiley & Sons, Inc.     

On improved asymptotic bounds for codes from global function fields

We analyse a binary cyclotomic sequence constructed via generalized cyclotomic classes by Bai et al. (IEEE Trans Inforem Theory 51: 1849–1853, 2005). First we determine the linear complexity of a natural generalization of this binary sequence to arbitrary prime fields. Secondly we consider k-error linear complexity and autocorrelation of these sequences and point out certain drawbacks of this construction. The results show that the parameters for the sequence construction must be carefully chosen in view of the respective application.      

On upper bounds of Chalk and Hua for exponential sums

Let be a polynomial of degree with integer coefficients, any prime, any positive integer and the exponential sum . We establish that if is nonconstant when read , then . Let , let be a zero of the congruence of multiplicity and let be the sum with restricted to values congruent to . We obtain for odd, and . If, in addition, , then we obtain the sharp upper bound .