Multiplicity in the documentation of performance-based artworks: Displaying multi-media documentation in Rebecca Horn’s Body Sculptures at Tate

This is the author accepted manuscript. The final version is available from Taylor & Francis via the DOI in this recordThis paper addresses some of the key issues around authenticity within the ephemeral performance and durable document dichotomy. Engaging with these two artistic practices within the frame of the museum and in the context of displays and exhibitions, this paper considers some of the ways in which the role of performance documentation has been reassessed over the past 20 years. It will focus on the access the document provides to a now-absent ‘performance moment’, the benefit of acquiring and displaying multiple types of documentation, and the experience of the museum visitor within this.Arts and Humanities Research Council (AHRC

Space and value in the contemporary art museum: The journey of a performance document at Tate

This is the author accepted manuscript. The final version is available from Intellect via the DOI in this recordThe space of the museum, rather than being monolithic and heterogeneous, is complex, fluid and fractured. As an institution, its multiple spaces relate to a variety of activities, motivations and attitudes towards the objects it collects, conserves and displays. By using Michel Foucault’s 1967 notion of the ‘heterotopia’ to read the museum as a space of spaces, and focusing on the complex object of the performance document, this article traces the link between the placement of objects in a specific space, and how this can be read as a perspective on their value. In tracing the journey of the Joseph Beuys performance document Four Blackboards (1972) through various spaces at Tate Gallery (now Tate Britain) and Tate Modern, this article will demonstrate those acts of valuation being undertaken over a 50-year period in the institution, and explore how changing value perspectives result in a changing space, both physically and conceptually, for the performance document.Arts and Humanities Research Council (AHRC

Hyperopic Cops and Robbers

We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds and other properties of this parameter. We characterize the cop-win graphs for this variant, along with graphs with the largest possible hyperopic cop number. We analyze the cases of graphs with diameter 2 or at least 3, focusing on when the hyperopic cop number is at most one greater than the cop number. We show that for planar graphs, as with the usual cop number, the hyperopic cop number is at most 3. The hyperopic cop number is considered for countable graphs, and it is shown that for connected chains of graphs, the hyperopic cop density can be any real number in $[0,1/2].

On well-covered triangulations: Part I

AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It is the aim of this paper to prove that there are no 5-connected planar well-covered triangulations

The Firefighter Problem: A Structural Analysis

We consider the complexity of the firefighter problem where b>=1 firefighters are available at each time step. This problem is proved NP-complete even on trees of degree at most three and budget one (Finbow et al.,2007) and on trees of bounded degree b+3 for any fixed budget b>=2 (Bazgan et al.,2012). In this paper, we provide further insight into the complexity landscape of the problem by showing that the pathwidth and the maximum degree of the input graph govern its complexity. More precisely, we first prove that the problem is NP-complete even on trees of pathwidth at most three for any fixed budget b>=1. We then show that the problem turns out to be fixed parameter-tractable with respect to the combined parameter "pathwidth" and "maximum degree" of the input graph

NP-Completeness Results for Graph Burning on Geometric Graphs

Graph burning runs on discrete time steps. The aim is to burn all the vertices in a given graph in the least number of time steps. This number is known to be the burning number of the graph. The spread of social influence, an alarm, or a social contagion can be modeled using graph burning. The less the burning number, the faster the spread. Optimal burning of general graphs is NP-Hard. There is a 3-approximation algorithm to burn general graphs where as better approximation factors are there for many sub classes. Here we study burning of grids; provide a lower bound for burning arbitrary grids and a 2-approximation algorithm for burning square grids. On the other hand, burning path forests, spider graphs, and trees with maximum degree three is already known to be NP-Complete. In this article we show burning problem to be NP-Complete on connected interval graphs, permutation graphs and several other geometric graph classes as corollaries.Comment: 17 pages, 5 figure

Structure of aluminum atomic chains

First-principles density functional calculations reveal that aluminum can form planar chains in zigzag and ladder structures. The most stable one has equilateral triangular geometry with four nearest neighbors; the other stable zigzag structure has wide bond angle and allows for two nearest neighbors. An intermediary structure has the ladder geometry and is formed by two strands. All these planar geometries are, however, more favored energetically than the linear chain. We found that by going from bulk to a chain the character of bonding changes and acquires directionality. The conductance of zigzag and linear chains is 4e^2/h under ideal ballistic conditions.Comment: modified detailed version, one new structure added, 4 figures, modified figure1, 1 tabl

Structural Transitions and Global Minima of Sodium Chloride Clusters

In recent experiments on sodium chloride clusters structural transitions between nanocrystals with different cuboidal shapes were detected. Here we determine reaction pathways between the low energy isomers of one of these clusters, (NaCl)35Cl-. The key process in these structural transitions is a highly cooperative rearrangement in which two parts of the nanocrystal slip past one another on a {110} plane in a direction. In this way the nanocrystals can plastically deform, in contrast to the brittle behaviour of bulk sodium chloride crystals at the same temperatures; the nanocrystals have mechanical properties which are a unique feature of their finite size. We also report and compare the global potential energy minima for (NaCl)NCl- using two empirical potentials, and comment on the effect of polarization.Comment: extended version, 13 pages, 8 figures, revte