52 research outputs found

    On Maltsev Digraphs

    Get PDF
    This is an Open Access article, first published by E-CJ on 25 February 2015.We study digraphs preserved by a Maltsev operation: Maltsev digraphs. We show that these digraphs retract either onto a directed path or to the disjoint union of directed cycles, showing in this way that the constraint satisfaction problem for Maltsev digraphs is in logspace, L. We then generalize results from Kazda (2011) to show that a Maltsev digraph is preserved not only by a majority operation, but by a class of other operations (e.g., minority, Pixley) and obtain a O(|VG|4)-time algorithm to recognize Maltsev digraphs. We also prove analogous results for digraphs preserved by conservative Maltsev operations which we use to establish that the list homomorphism problem for Maltsev digraphs is in L. We then give a polynomial time characterisation of Maltsev digraphs admitting a conservative 2-semilattice operation. Finally, we give a simple inductive construction of directed acyclic digraphs preserved by a Maltsev operation, and relate them with series parallel digraphs.Peer reviewedFinal Published versio

    Improved Optimal and Approximate Power Graph Compression for Clearer Visualisation of Dense Graphs

    Full text link
    Drawings of highly connected (dense) graphs can be very difficult to read. Power Graph Analysis offers an alternate way to draw a graph in which sets of nodes with common neighbours are shown grouped into modules. An edge connected to the module then implies a connection to each member of the module. Thus, the entire graph may be represented with much less clutter and without loss of detail. A recent experimental study has shown that such lossless compression of dense graphs makes it easier to follow paths. However, computing optimal power graphs is difficult. In this paper, we show that computing the optimal power-graph with only one module is NP-hard and therefore likely NP-hard in the general case. We give an ILP model for power graph computation and discuss why ILP and CP techniques are poorly suited to the problem. Instead, we are able to find optimal solutions much more quickly using a custom search method. We also show how to restrict this type of search to allow only limited back-tracking to provide a heuristic that has better speed and better results than previously known heuristics.Comment: Extended technical report accompanying the PacificVis 2013 paper of the same nam

    Congruence modularity implies cyclic terms for finite algebras

    Get PDF
    An n-ary operation f : A(n) -> A is called cyclic if it is idempotent and f(a(1), a(2), a(3), ... , a(n)) = f(a(2), a(3), ... , a(n), a(1)) for every a(1), ... , a(n) is an element of A. We prove that every finite algebra A in a congruence modular variety has a p-ary cyclic term operation for any prime p greater than vertical bar A vertical bar

    A finer reduction of constraint problems to digraphs

    Full text link

    The lure of postwar London:networks of people, print and organisations

    Get PDF

    Birth, growth and computation of pi to ten trillion digits

    Get PDF

    'Vernacular Voices: Black British Poetry'

    Get PDF
    ABSTRACT Black British poetry is the province of experimenting with voice and recording rhythms beyond the iambic pentameter. Not only in performance poetry and through the spoken word, but also on the page, black British poetry constitutes and preserves a sound archive of distinct linguistic varieties. In Slave Song (1984) and Coolie Odyssey (1988), David Dabydeen employs a form of Guyanese Creole in order to linguistically render and thus commemorate the experience of slaves and indentured labourers, respectively, with the earlier collection providing annotated translations into Standard English. James Berry, Louise Bennett, and Valerie Bloom adapt Jamaican Patois to celebrate Jamaican folk culture and at times to represent and record experiences and linguistic interactions in the postcolonial metropolis. Grace Nichols and John Agard use modified forms of Guyanese Creole, with Nichols frequently constructing gendered voices whilst Agard often celebrates linguistic playfulness. The borders between linguistic varieties are by no means absolute or static, as the emergence and marked growth of ‘London Jamaican’ (Mark Sebba) indicates. Asian British writer Daljit Nagra takes liberties with English for different reasons. Rather than having recourse to established Creole languages, and blending them with Standard English, his heteroglot poems frequently emulate ‘Punglish’, the English of migrants whose first language is Punjabi. Whilst it is the language prestige of London Jamaican that has been significantly enhanced since the 1990s, a fact not only confirmed by linguistic research but also by its transethnic uses both in the streets and on the page, Nagra’s substantial success and the mainstream attention he receives also indicate the clout of vernacular voices in poetry. They have the potential to connect with oral traditions and cultural memories, to record linguistic varieties, and to endow ‘street cred’ to authors and texts. In this chapter, these double-voiced poetic languages are also read as signs of resistance against residual monologic ideologies of Englishness. © Book proposal (02/2016): The Cambridge History of Black and Asian British Writing p. 27 of 4
    corecore