126 research outputs found
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
We consider the multivariate interlace polynomial introduced by Courcelle
(2008), which generalizes several interlace polynomials defined by Arratia,
Bollobas, and Sorkin (2004) and by Aigner and van der Holst (2004). We present
an algorithm to evaluate the multivariate interlace polynomial of a graph with
n vertices given a tree decomposition of the graph of width k. The best
previously known result (Courcelle 2008) employs a general logical framework
and leads to an algorithm with running time f(k)*n, where f(k) is doubly
exponential in k. Analyzing the GF(2)-rank of adjacency matrices in the context
of tree decompositions, we give a faster and more direct algorithm. Our
algorithm uses 2^{3k^2+O(k)}*n arithmetic operations and can be efficiently
implemented in parallel.Comment: v4: Minor error in Lemma 5.5 fixed, Section 6.6 added, minor
improvements. 44 pages, 14 figure
Ribbon Graph Minors and Low-Genus Partial Duals
We give an excluded minor characterisation of the class of ribbon graphs that
admit partial duals of Euler genus at most one
Exploring a neural-network account of age-of-acquisition effects using repetition priming of faces
On the Potts model partition function in an external field
We study the partition function of Potts model in an external (magnetic)
field, and its connections with the zero-field Potts model partition function.
Using a deletion-contraction formulation for the partition function Z for this
model, we show that it can be expanded in terms of the zero-field partition
function. We also show that Z can be written as a sum over the spanning trees,
and the spanning forests, of a graph G. Our results extend to Z the well-known
spanning tree expansion for the zero-field partition function that arises
though its connections with the Tutte polynomial
The politics of the teaching of reading
Historically, political debates have broken out over how to teach reading in primary schools and infant classrooms. These debates and “reading wars” have often resulted from public concerns and media reportage of a fall in reading standards. They also reflect the importance placed on learning to read by parents, teachers, employers, and politicians. Public and media-driven controversies over the teaching of reading have resulted in intense public and professional debates over which specific methods and materials to use with beginning readers and with children who have reading difficulties. Recently, such debates have led to a renewed emphasis on reading proficiency and “standardized” approaches to teaching reading and engaging with literacy. The universal acceptance of the importance of learning to read has also led to vested interests in specific methods, reading programmes, and early literacy assessments amongst professional, business, commercial, and parental lobbying groups. This article traces these debates and the resulting growing support for a quantitative reductionist approach to early-reading programmes
Does Sleep Improve Your Grammar? : Preferential Consolidation of Arbitrary Components of New Linguistic Knowledge
We examined the role of sleep-related memory consolidation processes in learning new form-meaning mappings. Specifically, we examined a Complementary Learning Systems account, which implies that sleep-related consolidation should be more beneficial for new hippocampally dependent arbitrary mappings (e.g. new vocabulary items) relative to new systematic mappings (e.g. grammatical regularities), which can be better encoded neocortically. The hypothesis was tested using a novel language with an artificial grammatical gender system. Stem-referent mappings implemented arbitrary aspects of the new language, and determiner/suffix+natural gender mappings implemented systematic aspects (e.g. tib scoiffesh + ballerina, tib mofeem + bride; ked jorool + cowboy, ked heefaff + priest). Importantly, the determiner-gender and the suffix-gender mappings varied in complexity and salience, thus providing a range of opportunities to detect beneficial effects of sleep for this type of mapping. Participants were trained on the new language using a word-picture matching task, and were tested after a 2-hour delay which included sleep or wakefulness. Participants in the sleep group outperformed participants in the wake group on tests assessing memory for the arbitrary aspects of the new mappings (individual vocabulary items), whereas we saw no evidence of a sleep benefit in any of the tests assessing memory for the systematic aspects of the new mappings: Participants in both groups extracted the salient determiner-natural gender mapping, but not the more complex suffix-natural gender mapping. The data support the predictions of the complementary systems account and highlight the importance of the arbitrariness/systematicity dimension in the consolidation process for declarative memories
New Polynomial-Based Molecular Descriptors with Low Degeneracy
In this paper, we introduce a novel graph polynomial called the ‘information polynomial’ of a graph. This graph polynomial can be derived by using a probability distribution of the vertex set. By using the zeros of the obtained polynomial, we additionally define some novel spectral descriptors. Compared with those based on computing the ordinary characteristic polynomial of a graph, we perform a numerical study using real chemical databases. We obtain that the novel descriptors do have a high discrimination power
- …