Given a sequence of nonnegative real numbers λ0, λ1, … that sum to 1, we consider a random graph having approximately λin vertices of degree i. In [12] the authors essentially show that if [sum ]i(i−2)λi>0 then the graph a.s. has a giant component, while if [sum ]i(i−2)λi<0 then a.s. all components in the graph are small. In this paper we analyse the size of the giant component in the former case, and the structure of the graph formed by deleting that component. We determine ε, λ′0, λ′1 … such that a.s. the giant component, C, has εn+o(n) vertices, and the structure of the graph remaining after deleting C is basically that of a random graph with n′=n−[mid ]C[mid ] vertices, and with λ′in′ of them of degree i.

Let k be a positive integer and G a finite abelian group of order n, where n[ges ]k2−4k+8. Then every sequence of 2n−¼k2+k−2 elements in G assuming k distinct values has an n-subsequence with sum zero. This settles a conjecture of Bialostocki and Lotspeich.

Stacks which allow elements to be pushed into any of the top r positions and popped from any of the top s positions are studied. An asymptotic formula for the number un of permutations of length n sortable by such a stack is found in the cases r=1 or s=1. This formula is found from the generating function of un. The sortable permutations are characterized if r=1 or s=1 or r=s=2 by a forbidden subsequence condition.

The natural relations for sets are those definable in terms of the emptiness of the subsets corresponding to Boolean combinations of the sets. For pairs of sets, there are just five natural relations of interest, namely, strict inclusion in each direction, disjointness, intersection with the universe being covered, or not. Let N denote {1, 2, …, n} and (N2) denote {(i, j)[mid ]i, j∈N and i<j}. A function μ on (N2) specifies one of these relations for each pair of indices. Then μ is said to be consistent on M⊆N if and only if there exists a collection of sets corresponding to indices in M such that the relations specified by μ hold between each associated pair of the sets. Firstly, it is proved that if μ is consistent on all subsets of N of size three then μ is consistent on N. Secondly, explicit conditions that make μ consistent on a subset of size three are given as generalized transitivity laws. Finally, it is shown that the result concerning binary natural relations can be generalized to r-ary natural relations for arbitrary r[ges ]2.

Let a, b and n be integers with 2[les ]a[les ]b and n[ges ]a+b. Suppose that [Ascr]⊂([n]a) and [Bscr]⊂([n]b) are nontrivial cross-intersecting families. Then [mid ][Ascr][mid ]+[mid ][Bscr][mid ][les ]2+(nb)−2(n−ab)+(n−2ab). This result is best possible.

We consider the problem of fault diagnosis in multiprocessor systems. Processors performtests on one another: fault-free testers correctly identify the fault status of tested processors, while faulty testers can give arbitrary test results. Processors fail independently with constantprobability p<1/2 and the goal is to identify correctly the status of all processors, based on the set of test results. For 0<q<1, q-diagnosis is a fault diagnosis algorithm whose probability of error does not exceed q. We show that the minimum number of tests to perform q-diagnosis for n processors is Θ(n log 1/q) in the nonadaptive case and n+Θ( log 1/q) in the adaptive case. We also investigate q-diagnosis algorithms that minimize the maximum number of tests performed by, and performed on, processors in the system, constructing testing schemes in which each processor is involved in very few tests. Our results demonstrate that the flexibility yielded by adaptive testing permits a significant saving in the number of tests for the same reliability of diagnosis.

It is known that evaluating the Tutte polynomial, T(G; x, y), of a graph, G, is #P-hard at all but eight specific points and one specific curve of the (x, y)-plane. In contrast we show that if k is a fixed constant then for graphs of tree-width at most k there is an algorithm that will evaluate the polynomial at any point using only a linear number of multiplications and additions.

The cover time, C, for a simple random walk on a realization, GN, of [Gscr](N, p), the random graph on N vertices where each two vertices have an edge between them with probability p independently, is studied. The parameter p is allowed to decrease with N and p is written on the form f(N)/N, where it is assumed that f(N)[ges ]c log N for some c>1 to asymptotically ensure connectedness of the graph. It is shown that if f(N) is of higher order than log N, then, with probability 1−o(1), (1−ε)N log N[les ]E[C[mid ]GN][les ](1+ε)N log N for any fixed ε>0, whereas if f(N)=O(log N), there exists a constant a>0 such that, with probability 1−o(1), E[C[mid ]GN][ges ](1+a)N log N. It is furthermore shown that if f(N) is of higher order than (log N)3 then Var(C[mid ]GN)=o((N log N)2) with probability 1−o(1), so that with probability 1−o(1), the stronger statement that (1−ε)N log N[les ]C[les ](1+ε)N log N holds.

For an undirected graph G=(V, E), let σ(L(G)) be the size of the maximum cut of theline graph L(G). Let dv denote the degree of the vertex v in G. Then we have the followingresults.

(a) If G=(V, E) is Eulerian, then

formula here

(b) If G is not Eulerian, then

formula here

This paper determines the asymptotic solution of certain initial-boundary value problems for singularly-perturbed reaction-diffusion equations, including the Allen–Cahn and Cahn–Hilliard equations, on bounded one-dimensional spatial domains for r[ges ]0. Attention is focused on the metastable evolution of a transition layer over an asymptotically exponentially-long time interval.

An algorithm, based on a discrete nonlinear model, is presented for evaluation of the critical shear stress required to move a dislocation through a lattice. The stability of solutions of the corresponding evolution problem is analysed. Numerical results provide upper and lower bounds for the critical shear stress.

In this paper domain decomposition methods for radiative transfer problems including conductive heat transfer are treated. The paper focuses on semi-transparent materials, like glass, and the associated conditions at the interface between the materials. Using asymptotic analysis we derive conditions for the coupling of the radiative transfer equations and a diffusion approximation. Several test casts are treated and a problem appearing in glass manufacturing processes is computed. The results clearly show the advantages of a domain decomposition approach. Accuracy equivalent to the solution of the global radiative transfer solution is achieved, whereas computation time is strongly reduced.

We consider the distinguished limits of the phase field equations and prove that the corresponding free boundary problem is attained in each case. These include the classical Stefan model, the surface tension model (with or without kinetics), the surface tension model with zero specific heat, the two phase Hele–Shaw, or quasi-static, model. The Hele–Shaw model is also a limit of the Cahn–Hilliard equation, which is itself a limit of the phase field equations. Also included in the distinguished limits is the motion by mean curvature model that is a limit of the Allen–Cahn equation, which can in turn be attained from the phase field equations.

The behaviour of adhesively bonded joints is investigated using a continuum mechanical description for the adhesive. The gradient of the adhesion variable, which describes the volumetric proportion of cavities within the adhesive, is introduced in the free energy, so that the model accounts for the intrinsic cohesion of the adhesive. The adherends are linear elastic materials and the adhesive is first given an elastic behaviour. Using a thermodynamical framework, an adhesion potential function is established, the subdifferential of which is determined in a rigorous way, so that three-dimensional coupled elastic-adhesion evolution equations are derived. Then we consider a generalization to the coupling of adhesion with elastoplasticity. A two-dimensional model of adhesive bonding is derived using a perturbation method. Finally, a finite element discretization of the coupled evolution problem is presented and a resolution scheme based on Newton's method is developed, while the integration of the constitutive law is performed using a three-step operator splitting method.

The spectral function ρα(μ) (−∞<μ<∞) associated with the Sturm–Liouville equation

and a boundary condition

is a non-decreasing function of μ which is defined in terms of the Titchmarsh–Weyl function mα(λ) for (1.1) and (1.2). Thus, taking into account a standardization of the sign attached to mα(λ), we have

[4, Chapter 9, Theorem 3.1; 9, Section 2.3; 21, Sections 3.3 and 6.7].

We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the Cartesian products of graphs.

In this note we give an answer to the following problem of Todorcevic: Find out the combinatorial essence behind the fact that the family ℋ of the ground-model infinite sets of integers in a Perfect-set forcing extension has the property that for any Borel f: [ℕ]ω → {0, 1} there exists an A ∈ ℋ such that f is constant on [A]ω (see [7], [13]). In other words, one needs to capture the combinatorial properties of the family ℋ of ground-model subsets of ℕ which assure that it diagonalizes all Borel partitions. It turns out that the notion which results from our analysis of this problem is a bit more optimal than the older notion of a “happy family” (or selective coideal) introduced by A.R.D. Mathias [16] long ago in order to extend the well-known theorems of Galvin–Prikry [6] and Silver [25] (see Theorems 3.1 and 4.1 below). We should remark that these Mathias-style extensions can indeed be as useful in the applications as the original partition theorems.

Let M be a loopless matroid with rank r and c components. Let P(M, t) be the characteristic polynomial of M. We shall show that (−1)rP(M, t)[ges ](1−t)r for t∈(−∞, 1), that the multiplicity of the zeros of P(M, t) at t=1 is equal to c, and that (−1)r+cP(M, t)[ges ](t−1)r for t∈(1, 32/27]. Using a result of C. Thomassen we deduce that the maximal zero-free intervals for characteristic polynomials of loopless matroids are precisely (−∞, 1) and (1, 32/27].