Vertex splitting and connectivity augmentation in hypergraphs

We consider problems of splitting and connectivity augmentation in hypergraphs. In a hypergraph G = (V +s, E), to split two edges su, sv, is to replace them with a single edge uv. We are interested in doing this in such a way as to preserve a defined level of connectivity in V . The splitting technique is often used as a way of adding new edges into a graph or hypergraph, so as to augment the connectivity to some prescribed level. We begin by providing a short history of work done in this area. Then several preliminary results are given in a general form so that they may be used to tackle several problems. We then analyse the hypergraphs G = (V + s, E) for which there is no split preserving the local-edge-connectivity present in V. We provide two structural theorems, one of which implies a slight extension to Mader’s classical splitting theorem. We also provide a characterisation of the hypergraphs for which there is no such “good” split and a splitting result concerned with a specialisation of the local-connectivity function. We then use our splitting results to provide an upper bound on the smallest number of size-two edges we must add to any given hypergraph to ensure that in the resulting hypergraph we have λ(x, y) ≥ r(x, y) for all x, y in V, where r is an integer valued, symmetric requirement function on V*V. This is the so called “local-edge-connectivity augmentation problem” for hypergraphs. We also provide an extension to a Theorem of Szigeti, about augmenting to satisfy a requirement r, but using hyperedges. Next, in a result born of collaborative work with Zoltán Király from Budapest, we show that the local-connectivity augmentation problem is NP-complete for hypergraphs. Lastly we concern ourselves with an augmentation problem that includes a locational constraint. The premise is that we are given a hypergraph H = (V,E) with a bipartition P = {P1, P2} of V and asked to augment it with size-two edges, so that the result is k-edge-connected, and has no new edge contained in some P(i). We consider the splitting technique and describe the obstacles that prevent us forming “good” splits. From this we deduce results about which hypergraphs have a complete Pk-split. This leads to a minimax result on the optimal number of edges required and a polynomial algorithm to provide an optimal augmentation.

Transatlantic spaces: production, location and style in 1960s-1970s action-adventure TV series

This paper argues that transatlantic hybridity connects space, visual style and ideological point of view in British television action-adventure fiction of the 1960s–1970s. It analyses the relationship between the physical location of TV series production at Elstree Studios, UK, the representation of place in programmes, and the international trade in television fiction between the UK and USA. The TV series made at Elstree by the ITC and ABC companies and their affiliates linked Britishness with an international modernity associated with the USA, while also promoting national specificity. To do this, they drew on film production techniques that were already common for TV series production in Hollywood. The British series made at Elstree adapted versions of US industrial organization and television formats, and made programmes expected to be saleable to US networks, on the basis of British experiences in TV co-production with US companies and of the international cinema and TV market.

Marks, spaces and boundaries

Dictionary compilers and designers use punctuation to structure and clarify entries and to encode information. Dictionaries with a relatively simple structure can have simple typography, and simple punctuation; as dictionaries grew more complex, and encountered the space constraints of the printed page, complex encoding systems were developed, using punctuation and symbols. Two recent trends have emerged in dictionary design: to eliminate punctuation, and sometimes to use a larger number of fonts, so that the boundaries between elements are indicated by font change, not punctuation.

New results and open problems on Toeplitz operators in Bergman spaces

We discuss some of the recent progress in the field of Toeplitz operators acting on Bergman spaces of the unit disk, formulate some new results, and describe a list of open problems -- concerning boundedness, compactness and Fredholm properties -- which was presented at the conference "Recent Advances in Function Related Operator Theory'' in Puerto Rico in March 2010.

Solvability and spectral properties of integral equations on the real line: I. Weighted spaces of continuous functions

We consider in this paper the solvability of linear integral equations on the real line, in operator form (λ−K)φ=ψ, where and K is an integral operator. We impose conditions on the kernel, k, of K which ensure that K is bounded as an operator on . Let Xa denote the weighted space as |s|→∞}. Our first result is that if, additionally, |k(s,t)|⩽κ(s−t), with and κ(s)=O(|s|−b) as |s|→∞, for some b>1, then the spectrum of K is the same on Xa as on X, for 0and λφ=Kkφ has only the trivial solution in X, for all k∈W, then, for 0⩽a⩽b, (λ−K)φ=ψ has exactly one solution φ∈Xa for every k∈W and ψ∈Xa. These conditions ensure further that is bounded uniformly in k∈W, for 0⩽a⩽b. As a particular application we consider the case when the kernel takes the form k(s,t)=κ(s−t)z(t), with , , and κ(s)=O(|s|−b) as |s|→∞, for some b>1. As an example where kernels of this latter form occur we discuss a boundary integral equation formulation of an impedance boundary value problem for the Helmholtz equation in a half-plane.

Fractal spaces in planning and governance

This paper discusses concepts of space within the planning literature, the issues they give rise to and the gaps they reveal. It then introduces the notion of 'fractals' borrowed from complexity theory and illustrates how it unconsciously appears in planning practice. It then moves on to abstract the core dynamics through which fractals can be consciously applied and illustrates their working through a reinterpretation of the People's Planning Campaign of Kerala, India. Finally it highlights the key contribution of the fractal concept and the advantages that this conceptualisation brings to planning.