Two-Sided Optimal Bounds for Green Functions of Half-Spaces for Relativistic <Emphasis Type="Italic">α</Emphasis>-Stable Process

The purpose of this paper is to find optimal estimates for the Green function of a half-space of the relativistic α -stable process with parameter m on ℝ ^d space. This process has an infinitesimal generator of the form mI–(m ^2/α I–Δ) ^α/2, where 0<α<2, m>0, and reduces to the isotropic α-stable process for m=0. Its potential theory for open bounded sets has been well developed throughout the recent years however almost nothing was known about the behaviour of the process on unbounded sets. The present paper is intended to fill this gap and we provide two-sided sharp estimates for the Green function for a half-space. As a byproduct we obtain some improvements of the estimates known for bounded sets. Our approach combines the recent results obtained in Byczkowski et al. (Bessel Potentials, Hitting Distributions and Green Functions (2006) (preprint). ), where an explicit integral formula for the m-resolvent of a half-space was found, with estimates of the transition densities for the killed process on exiting a half-space. The main result states that the Green function is comparable with the Green function for the Brownian motion if the points are away from the boundary of a half-space and their distance is greater than one. On the other hand for the remaining points the Green function is somehow related the Green function for the isotropic α-stable process. For example, for d≥3, it is comparable with the Green function for the isotropic α-stable process, provided that the points are close enough. Research supported by KBN Grants.     

A priori bounds and weak solutions for the nonlinear Schrödinger equation in Sobolev spaces of negative order

Solutions to the Cauchy problem for the one-dimensional cubic nonlinear Schrödinger equation on the real line are studied in Sobolev spaces Hs, for s negative but close to 0. For smooth solutions there is an a priori upper bound for the Hs norm of the solution, in terms of the Hs norm of the datum, for arbitrarily large data, for sufficiently short time. Weak solutions are constructed for arbitrary initial data in Hs.     

The rate of convergence of q-Bernstein polynomials for

In the note, we obtain the estimates for the rate of convergence for a sequence of q-Bernstein polynomials {B_n,q(f)} for 0<q<1 by the modulus of continuity of f, and the estimates are sharp with respect to the order for Lipschitz continuous functions. We also get the exact orders of convergence for a family of functions , and the orders do not depend on α, unlike the classical case.     

Topological games and continuity of group operations

We consider a topological game GΠ involving two players α and β and show that, for a paratopological group, the absence of a winning strategy for player β implies the group is a topological one. We provide a large class of topological spaces X for which the absence of a winning strategy for player β is equivalent to the requirement that X is a Baire space. This allows to extend the class of paratopological or semitopological groups for which one can prove that they are, actually, topological groups.Conditions of the type “existence of a winning strategy for the player α” or “absence of a winning strategy for the player β” are frequently used in mathematics. Though convenient and satisfactory for theoretical considerations, such conditions do not reveal much about the internal structure of the topological space where they hold. We show that the existence of a winning strategy for any of the players in all games of Banach-Mazur type can be expressed in terms of “saturated sieves” of open sets.     

On the modulus of continuity for spectral measures in substitution dynamics

The paper gives first quantitative estimates on the modulus of continuity of the spectral measure for weak mixing suspension flows over substitution automorphisms, which yield information about the “fractal” structure of these measures. The main results are, first, a Hölder estimate for the spectral measure of almost all suspension flows with a piecewise constant roof function; second, a log-Hölder estimate for self-similar suspension flows; and, third, a Hölder asymptotic expansion of the spectral measure at zero for such flows. Our second result implies log-Hölder estimates for the spectral measures of translation flows along stable foliations of pseudo-Anosov automorphisms. A key technical tool in the proof of the second result is an “arithmetic-Diophantine” proposition, which has other applications. In Appendix A this proposition is used to derive new decay estimates for the Fourier transforms of Bernoulli convolutions.     

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

Given an undirected graph with edge weights, we are asked to find an orientation, that is, an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree in the resulted directed graph. The problem is called MMO, and is a restricted variant of the well-known minimum makespan problem. As in previous studies, it is shown that MMO is in P for trees, weak NP-hard for planar bipartite graphs, and strong NP-hard for general graphs. There are still gaps between those graph classes. The objective of this paper is to show tighter thresholds of complexity: We show that MMO is (i) in P for cactus graphs, (ii) weakly NP-hard for outerplanar graphs, and also (iii) strongly NP-hard for graphs which are both planar and bipartite. This implies the NP-hardness for P₄-bipartite, diamond-free or house-free graphs, each of which is a superclass of cactus. We also show (iv) the NP-hardness for series-parallel graphs and multi-outerplanar graphs, and (v) present a pseudo-polynomial time algorithm for graphs with bounded treewidth.     

Global solutions of the Navier-Stokes equations for compressible flow with density-dependent viscosity and discontinuous initial data

In this paper, we study the evolutions of the interfaces between the gas and the vacuum for viscous one-dimensional isentropic gas motions. We prove the global existence and uniqueness for discontinuous solutions of the Navier-Stokes equations for compressible flow with density-dependent viscosity coefficient. Precisely, the viscosity coefficient μ is proportional to ρ^θ with 0<θ<1. Specifically, we require that the initial density be piecewise smooth with arbitrarily large jump discontinuities, bounded above and below away from zero, in the interior of gas. We show that the discontinuities in the density persist for all time, and give a decay result for the density as t→+∞.     

On finite lattice coverings

We consider finite lattice coverings of strictly convex bodies K. For planar centrally symmetric K we characterize the finite arrangements C _n such that conv , where C _n is a subset of a covering lattice for K (which satisfies some natural conditions). We prove that for a fixed lattice the optimal arrangement (measured with the parametric density) is either a sausage, a so-called double sausage or tends to a Wulff-shape, depending on the parameter. This shows that the Wulff-shape plays an important role for packings as well as for coverings. Further we give a version of this result for variable lattices. For the Euclidean d-ball we characterize the lattices, for which the optimal arrangement is a sausage, for large parameter. Received 19 May 1999.     

Spot Self-Replication and Dynamics for the Schnakenburg Model in a Two-Dimensional Domain

The dynamical behavior of multi-spot solutions in a two-dimensional domain Ω is analyzed for the two-component Schnakenburg reaction–diffusion model in the singularly perturbed limit of small diffusivity ε for one of the two components. In the limit ε→0, a quasi-equilibrium spot pattern in the region away from the spots is constructed by representing each localized spot as a logarithmic singularity of unknown strength S _j for j=1,…,K at unknown spot locations x _j ∈Ω for j=1,…,K. A formal asymptotic analysis, which has the effect of summing infinite logarithmic series in powers of −1/log ε, is then used to derive an ODE differential algebraic system (DAE) for the collective coordinates S _j and x _j for j=1,…,K, which characterizes the slow dynamics of a spot pattern. This DAE system involves the Neumann Green’s function for the Laplacian. By numerically examining the stability thresholds for a single spot solution, a specific criterion in terms of the source strengths S _j , for j=1,…,K, is then formulated to theoretically predict the initiation of a spot-splitting event. The analytical theory is illustrated for spot patterns in the unit disk and the unit square, and is compared with full numerical results computed directly from the Schnakenburg model.      

On the OBDD size for graphs of bounded tree- and clique-width

We study the size of OBDDs (ordered binary decision diagrams) for representing the adjacency function f_G of a graph G on n vertices. Our results are as follows:

-

for graphs of bounded tree-width there is an OBDD of size O(logn) for f_G that uses encodings of size O(logn) for the vertices;

-

for graphs of bounded clique-width there is an OBDD of size O(n) for f_G that uses encodings of size O(n) for the vertices;

-

for graphs of bounded clique-width such that there is a clique-width expression for G whose associated binary tree is of depth O(logn) there is an OBDD of size O(n) for f_G that uses encodings of size O(logn) for the vertices;

-

for cographs, i.e. graphs of clique-width at most 2, there is an OBDD of size O(n) for f_G that uses encodings of size O(logn) for the vertices. This last result complements a recent result by Nunkesser and Woelfel [R. Nunkesser, P. Woelfel, Representation of graphs by OBDDs, in: X. Deng, D. Du (Eds.), Proceedings of ISAAC 2005, in: Lecture Notes in Computer Science, vol. 3827, Springer, 2005, pp. 1132-1142] as it reduces the size of the OBDD by an O(logn) factor using encodings whose size is increased by an O(1) factor.

     

A-optimal designs for an additive cubic model

Chan et al. (1998a) obtained A-optimal designs for an additive quadratic mixture model for q≥3 mixture components. In this paper, we obtain the A-optimal designs for an additive cubic model for q≥3 mixture components using the class of symmetric weighted centroid designs based on barycentres of various depths. We observe that barycentres of depths 0 and 2 are possible support points for an A-optimal design. We have also given the optimal weights of A-optimal designs for 3≤q≤17.     

An efficient algorithm for accelerating the convergence of oscillatory series,useful for computing the polylogarithm and Hurwitz zeta functions

This paper sketches a technique for improving the rate of convergence of a general oscillatory sequence, and then applies this series acceleration algorithm to the polylogarithm and the Hurwitz zeta function. As such, it may be taken as an extension of the techniques given by Borwein’s “An efficient algorithm for computing the Riemann zeta function” by Borwein for computing the Riemann zeta function, to more general series. The algorithm provides a rapid means of evaluating Li _s (z) for general values of complex s and a kidney-shaped region of complex z values given by ∣z ²/(z–1)∣<4. By using the duplication formula and the inversion formula, the range of convergence for the polylogarithm may be extended to the entire complex z-plane, and so the algorithms described here allow for the evaluation of the polylogarithm for all complex s and z values. Alternatively, the Hurwitz zeta can be very rapidly evaluated by means of an Euler–Maclaurin series. The polylogarithm and the Hurwitz zeta are related, in that two evaluations of the one can be used to obtain a value of the other; thus, either algorithm can be used to evaluate either function. The Euler–Maclaurin series is a clear performance winner for the Hurwitz zeta, while the Borwein algorithm is superior for evaluating the polylogarithm in the kidney-shaped region. Both algorithms are superior to the simple Taylor’s series or direct summation. The primary, concrete result of this paper is an algorithm allows the exploration of the Hurwitz zeta in the critical strip, where fast algorithms are otherwise unavailable. A discussion of the monodromy group of the polylogarithm is included.      

Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots

This paper addresses cyclic scheduling of a no-wait robotic cell with multiple robots. In contrast to many previous studies, we consider r-degree cyclic (r > 1) schedules, in which r identical parts with constant processing times enter and leave the cell in each cycle. We propose an algorithm to find the minimal number of robots for all feasible r-degree cycle times for a given r (r > 1). Consequently, the optimal r-degree cycle time for any given number of robots for this given r can be obtained with the algorithm. To develop the algorithm, we first show that if the entering times of r parts, relative to the start of a cycle, and the cycle time are fixed, minimizing the number of robots for the corresponding r-degree schedule can be transformed into an assignment problem. We then demonstrate that the cost matrix for the assignment problem changes only at some special values of the cycle time and the part entering times, and identify all special values for them. We solve our problem by enumerating all possible cost matrices for the assignment problem, which is subsequently accomplished by enumerating intervals for the cycle time and linear functions of the part entering times due to the identification of the special values. The algorithm developed is shown to be polynomial in the number of machines for a fixed r, but exponential if r is arbitrary.     

On equivalence of moduli of smoothness of polynomials in ,

It is well known that for functions , 1p∞. For general functions fL_p, it does not hold for 0<p<1, and its inverse is not true for any p in general. It has been shown in the literature, however, that for certain classes of functions the inverse is true, and the terms in the inequalities are all equivalent. Recently, Zhou and Zhou proved the equivalence for polynomials with p=∞. Using a technique by Ditzian, Hristov and Ivanov, we give a simpler proof to their result and extend it to the L_p space for 0<p∞. We then show its analogues for the Ditzian–Totik modulus of smoothness and the weighted Ditzian–Totik modulus of smoothness for polynomials with .     

General discrepancy estimates III: The Erdös-Turán-Koksma inequality for the Haar function system

The classical Erdös-Turán-Koksma inequality gives us an upper bound for the discrepancy of a sequence in thes-dimensional unit cube in terms of exponential sums, more precisely, in terms of the trigonometric function system.In this paper, we shall prove the inequality of Erdös-Turán-Koksma for the extreme and the star discrepancy, for generalized Haar function systems. Further, we shall show the existence of the inequality of Erdös-Turán-Koksma for the isotropic discrepancy, for generalized Haar and Walsh function systems.Research supported by the Austrian Science Foundation, project no. P9285/TEC.     

<Emphasis Type="Italic">K</Emphasis><Subscript>4</Subscript>-free subgraphs of random graphs revisited

In Combinatorica 17(2), 1997, Kohayakawa, ?uczak and Rödl state a conjecture which has several implications for random graphs. If the conjecture is true, then, for example, an application of a version of Szemerédi’s regularity lemma for sparse graphs yields an estimation of the maximal number of edges in an H-free subgraph of a random graph G _{n, p} . In fact, the conjecture may be seen as a probabilistic embedding lemma for partitions guaranteed by a version of Szemerédi’s regularity lemma for sparse graphs. In this paper we verify the conjecture for H = K ₄, thereby providing a conceptually simple proof for the main result in the paper cited above.     

Double integrals and infinite products for some classical constants via analytic continuations of Lerch’s transcendent

The two-fold aim of the paper is to unify and generalize on the one hand the double integrals of Beukers for ζ(2) and ζ(3), and of the second author for Euler’s constant γ and its alternating analog ln (4/π), and on the other hand the infinite products of the first author for e, of the second author for π, and of Ser for e ^γ . We obtain new double integral and infinite product representations of many classical constants, as well as a generalization to Lerch’s transcendent of Hadjicostas’s double integral formula for the Riemann zeta function, and logarithmic series for the digamma and Euler beta functions. The main tools are analytic continuations of Lerch’s function, including Hasse’s series. We also use Ramanujan’s polylogarithm formula for the sum of a particular series involving harmonic numbers, and his relations between certain dilogarithm values.      

An Itô Formula of Generalized Functionals and Local Time for Fractional Brownian Sheet

Abstract

By using the white noise theory for a fractional Brownian sheet, we derive an Itô formula for the generalized functionals for the fractional Brownian sheet with arbitrary Hurst parameters H ₁, H ₂ ∈ (0,1). As an application, we give the integral representations for two versions of local times of a fractional Brownian sheet, respectively.     

On the number of primitive representations of integers as sums of squares

Formulas for the number of primitive representations of any integer n as a sum of k squares are given, for 2 ≤ k ≤ 8, and for certain values of n, for 9 ≤ k ≤ 12. The formulas have a similar structure and are striking for their simplicity. Dedicated to Richard Askey on the occasion of his 70th birthday. 2000 Mathematics Subject Classification Primary—11E25; Secondary—05A15, 33E05.