Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.     

Improvement of eigenvalues of Sturm–Liouville problem with -periodic boundary conditions

The computation of eigenvalues of Sturm–Liouville problem with t-periodic boundary conditions is considered. Using the Richardson extrapolation based on the finite difference, the accuracy of the eigenvalues are improved. Numerical results demonstrate the usefulness of the correction.     

Super-Brownian motion with reflecting historical paths. II. Convergence of approximations

We prove that the sequence of finite reflecting branching Brownian motion forests defined by Burdzy and Le Gall ([1]) converges in probability to the “super-Brownian motion with reflecting historical paths.” This solves an open problem posed in [1], where only tightness was proved for the sequence of approximations. Several results on path behavior were proved in [1] for all subsequential limits–they obviously hold for the unique limit found in the present paper.Mathematics Subject Classification (2000): Primary 60H15, Secondary 35R60Supported in part by NSF Grant DMS-0071486, Israel Science Foundation Grants 12/98 and 116/01 - 10.0, and the U.S.-Israel Binational Science Foundation (grant No. 2000065).     

A Stability Estimate for a Solution to a Three-Dimensional Inverse Problem for the Maxwell Equations

We consider the problem of determining dielectric permittivity and conductivity in the Maxwell equations. As additional information we prescribe the traces of the tangential components of the electromagnetic field on the lateral surface of a cylindric domain. We establish a stability estimate for a solution to the inverse problem and a uniqueness theorem.     

On the Global Stability of Solutions of Moment Systems in Nonequilibrium Thermodynamics

In this paper, we study the linearization of the Cauchy problem and the mixed problem for the system of Grad--Hermite moments in nonequilibrium thermodynamics in the neighborhood of the equilibrium state. Stability conditions for solutions of the Cauchy problem are proved as a generalization of the classical Hermite--Biller theorem on stable polynomials. For the mixed problem, we prove an analog of the Vishik--Lyusternik theorem on small singular perturbations of general elliptic problems. The last observation allows us to introduce the Shapiro--Lopatinskii condition, which implies the well-posedness of the mixed problem.     

On the multidimensional distribution of the subset sum generator of pseudorandom numbers

We show that for a random choice of the parameters, the subset sum pseudorandom number generator produces a sequence of uniformly and independently distributed pseudorandom numbers. The result can be useful for both cryptographic and quasi-Monte Carlo applications and relies on bounds of exponential sums.

     

Lorentz Invariant Decompositions of the State Vector Spaces and the Basis Problem

We consider a representation of the state reduction which depends neither on its reality nor on the details of when and how it emerges. Then by means of the representation we find necessary conditions, even if not the sufficient ones, for a decomposition of the state vector space to be a solution to the basis problem. The conditions are that the decomposition should be Lorentz invariant and orthogonal and that the associated projections should be continuous. They are shown to be able to determine a decomposition in each of a few examples considered if the other circumstances are taken into account together.     

Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

On two functionals connected to the Laplacian in a class of doubly connected domains in space-forms

LetB ₁ be a ball of radiusr ₁ inS ⁿ (ℍⁿ), and letB ₀ be a smaller ball of radiusr ₀ such thatB ₀ ⊂B ₁ . ForS ⁿ we considerr ₁ π. Let u be a solution of the problem- δm = 1 in Ω :=B ₁ /B ₀ vanishing on the boundary. It is shown that the associated functionalJ (Ω) is minimal if and only if the balls are concentric. It is also shown that the first Dirichlet eigenvalue of the Laplacian on Ω is maximal if and only if the balls are concentric.     

ON THE EQUATION □φ = |vφ|2 IN FOUR SPACE DIMENSIONS

This paper considers the following Cauchy problem for semilinear wave equations in n spacedimensions□φ = F( φ),φ(0, x) = f(x), tφ(0, x) = g(x),The minimal value of s is determined such that the above Cauchy problem is locally well-posed in Hs. It turns out that for the general equation s must satisfyThis is due to Ponce and Sideris (when n = 3) and Tataru (when n ≥ 5). The purpose of thispaper is to supplement with a proof in the case n = 2, 4.