The effect of spherical shells of matter on the Schwarzschild black hole

Based on previous work we show how to join two Schwarzschild solutions, possibly with different masses, along null cylinders each representing a spherical shell of infalling or outgoing massless matter. One of the Schwarzschild masses can be zero, i.e. one region can be flat. The above procedure can be repeated to produce space-times with aC ⁰ metric describing several different (possibly flat) Schwarzschild regions separated by shells of matter. An exhaustive treatment of the ways of combining four such regions is given; the extension to many regions is then straightforward. Cases of special interest are: (1) the scattering of two spherical gravitational shock waves at the horizon of a Schwarzschild black hole, and (2) a configuration involving onlyone external universe, which may be relevant to quantization problems in general relativity. In the latter example, only an infinitesimal amount of matter is sufficient to remove the Wheeler wormhole to another universe.Supported in part by the Stichting voor Fundamenteel Onderzoek der Materie     

Set to set broadcasting in communication networks

Suppose G = (V,E) is a graph whose vertices represent people and edges represent telephone lines between pairs of people. Each person knows a unique message and is ignorant of the messages of other people at the beginning. These messages are then spread by telephone calls. In each call, two people exchange all information they have so far in exactly one unit of time. Suppose A and B are two nonempty subsets of V. The main purpose of this paper is to study the minimum number b(A,B,G) of telephone calls by which A broadcasts to B; and the minimum time t(A,B,G) such that A broadcasts to B. In particular, we give an exact formula for b(A,B,K_n) and linear-time algorithms for computing b(A,B,T) and t(A,B,T) of a tree T.     

Practical strategies for generating rank-1 split cuts in mixed-integer linear programming

In this paper we propose practical strategies for generating split cuts, by considering integer linear combinations of the rows of the optimal simplex tableau, and deriving the corresponding Gomory mixed-integer cuts; potentially, we can generate a huge number of cuts. A key idea is to select subsets of variables, and cut deeply in the space of these variables. We show that variables with small reduced cost are good candidates for this purpose, yielding cuts that close a larger integrality gap. An extensive computational evaluation of these cuts points to the following two conclusions. The first is that our rank-1 cuts improve significantly on existing split cut generators (Gomory cuts from single tableau rows, MIR, Reduce-and-Split, Lift-and-Project, Flow and Knapsack cover): on MIPLIB instances, these generators close 24% of the integrality gap on average; adding our cuts yields an additional 5%. The second conclusion is that, when incorporated in a Branch-and-Cut framework, these new cuts can improve computing time on difficult instances.     

On free p-superalgebras

In this article we consider several aspects of algebraic combinatorics and combinatorial algebra over fields of prime characteristics. P-super-Radford theorem gives the structure of the free associative algebra over a field of prime characteristic with the new multiplication given by the super shuffle product, we show that this algebra is isomorphic to the reduced free super commutative algebra on s-regular words. We prove the elimination theorem for free partially commutative color Lie p-superalgebras and obtain a Schreier type formula for free Lie p-superalgebras using formal power series techniques.     

On the covariance of the level sizes in random recursive trees

In this paper we study the covariance structure of the number of nodes k and l steps away from the root in random recursive trees. We give an analytic expression valid for all k, l and tree sizes N. The fraction of nodes k steps away from the root is a random probability distribution in k. The expression for the covariances allows us to show that the total variation distance between this (random) probability distribution and its mean converges in probability to zero. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 20: 519–539, 2002     

Numerical solution of the two-dimensional Poincaré equation

This paper deals with numerical approximation of the two-dimensional Poincaré equation that arises as a model for internal wave motion in enclosed containers. Inspired by the hyperbolicity of the equation we propose a discretisation particularly suited for this problem, which results in matrices whose size varies linearly with the number of grid points along the coordinate axes. Exact solutions are obtained, defined on a perturbed boundary. Furthermore, the problem is seen to be ill-posed and there is need for a regularisation scheme, which we base on a minimal-energy approach.     

Crossed products of C*-algebras by endomorphisms

The concept of a twisted crossed product associated to a non-classical C^*-dynamical system is introduced and studied. The relationship between a covariant projective representation of the system and the corresponding induced representation of the twisted crossed product is investigated, particularly from the point of view of determining when the induced representation is faithful. Conditions are given on the C^*-dynamical system that ensure nuclearity, simplicity or primeness of the twisted crossed product.     

On L(d,1)-labelings of graphs

Given a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assigns to each vertex of G a non-negative integer such that if two vertices u and v are adjacent, then |f(u)−f(v)|d; if u and v are not adjacent but there is a two-edge path between them, then |f(u)−f(v)|1. The L(d,1)-number of G, λ_d(G), is defined as the minimum m such that there is an L(d,1)-labeling f of G with f(V){0,1,2,…,m}. Motivated by the channel assignment problem introduced by Hale (Proc. IEEE 68 (1980) 1497–1514), the L(2,1)-labeling and the L(1,1)-labeling (as d=2 and 1, respectively) have been studied extensively in the past decade. This article extends the study to all positive integers d. We prove that λ_d(G)Δ²+(d−1)Δ for any graph G with maximum degree Δ. Different lower and upper bounds of λ_d(G) for some families of graphs including trees and chordal graphs are presented. In particular, we show that the lower and the upper bounds for trees are both attainable, and the upper bound for chordal graphs can be improved for several subclasses of chordal graphs.     

Tables of curves with many points

These tables record results on curves with many points over finite fields. For relatively small genus () and a small power of or we give in two tables the best presently known bounds for , the maximum number of rational points on a smooth absolutely irreducible projective curve of genus over a field of cardinality . In additional tables we list for a given pair the type of construction of the best curve so far, and we give a reference to the literature where such a curve can be found.