What Remains: Pseudotranslation as Salvage

Pseudotranslations are literary works which purport to be translations of lost or suppressed originals, i.e. to be ‘salvaged’ from oblivion or obscurity. Pseudotranslation has attracted a good deal of attention within translation studies in recent years, but as a practice it can be traced back a long way. This article discusses a number of examples of the type, from Cervantes’ Don Quixote and modern works treating Shakespeare as pseudotranslated (Star Trek VI, Tom Stoppard’s Arcadia) through notable eighteenth-century examples (Walpole’s The Castle of Otranto, MacPherson’s Ossian) to non-fictional fictions The Book of Mormon and ‘Nietzsche’s’ fraudulent late autobiography My Sister and I. Readers of translations usually trust that an original exists, and pseudotranslations abuse that trust. But even when an original does exist, translation performs a kind of salvage operation, acting as a kind of lifeboat which rescues a text from the passing of time and keeps it afloat for posterity

Study of the Potts Model on the Honeycomb and Triangular Lattices: Low-Temperature Series and Partition Function Zeros

We present and analyze low-temperature series and complex-temperature partition function zeros for the $q$-state Potts model with $q=4$ on the honeycomb lattice and $q=3,4$ on the triangular lattice. A discussion is given as to how the locations of the singularities obtained from the series analysis correlate with the complex-temperature phase boundary. Extending our earlier work, we include a similar discussion for the Potts model with $q=3$ on the honeycomb lattice and with $q=3,4$ on the kagom\'e lattice.Comment: 33 pages, Latex, 9 encapsulated postscript figures, J. Phys. A, in pres

Computing normalisers of intransitive groups

Funding: The first and third authors would like to thank the Isaac Newton Institute for Mathematical Sciences, Cambridge, for support and hospitality during the programme “Groups, Representations and Applications: New perspectives”, where work on this paper was undertaken. This work was supported by EPSRC grant no EP/R014604/1. This work was also partially supported by a grant from the Simons Foundation. The first and second authors are supported by the Royal Society (RGF\EA\181005 and URF\R\180015).The normaliser problem takes as input subgroups G and H of the symmetric group Sn, and asks one to compute NG(H). The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for restricted classes of groups. In this paper, we will focus on groups with many orbits. We give a new algorithm for the normaliser problem for these groups that performs many orders of magnitude faster than previous implementations in GAP. We also prove that the normaliser problem for the special case G=Sn  is at least as hard as computing the group of monomial automorphisms of a linear code over any field of fixed prime order.Publisher PDFPeer reviewe

Breaking the symmetries of indistinguishable objects

Funding: This work was supported by the Engineering and Physical Sciences Research Council EP/Y000609/1.Indistinguishable objects often occur when modelling problems in constraint programming, as well as in other related paradigms. They occur when objects can be viewed as being drawn from a set of unlabelled objects, and the only operation allowed on them is equality testing. For example, the golfers in the social golfer problem are indistinguishable. If we do label the golfers, then any relabelling of the golfers in one solution gives another valid solution. In this paper, we show how we can break the symmetries resulting from indistinguishable objects. We show how these symmetries induce symmetries of types built from indistinguishable objects, for example in a matrix indexed by indistinguishable objects. We then show how the resulting symmetries can be broken correctly and completely. As the method can be prohibitively expensive, we also study methods for breaking the symmetry only partially. In Essence, a high-level modelling language, indistinguishable objects are encapsulated in ‘unnamed types’. We provide an implementation to automatically break symmetries of unnamed types

Open Datasheets: Machine-readable Documentation for Open Datasets and Responsible AI Assessments

This paper introduces a no-code, machine-readable documentation framework for open datasets, with a focus on responsible AI (RAI) considerations. The framework aims to improve comprehensibility, and usability of open datasets, facilitating easier discovery and use, better understanding of content and context, and evaluation of dataset quality and accuracy. The proposed framework is designed to streamline the evaluation of datasets, helping researchers, data scientists, and other open data users quickly identify datasets that meet their needs and organizational policies or regulations. The paper also discusses the implementation of the framework and provides recommendations to maximize its potential. The framework is expected to enhance the quality and reliability of data used in research and decision-making, fostering the development of more responsible and trustworthy AI systems