Magic Supergravities, N= 8 and Black Hole Composites

We present explicit U-duality invariants for the R, C, Q, O$ (real, complex, quaternionic and octonionic) magic supergravities in four and five dimensions using complex forms with a reality condition. From these invariants we derive an explicit entropy function and corresponding stabilization equations which we use to exhibit stationary multi-center 1/2 BPS solutions of these N=2 d=4 theories, starting with the octonionic one with E_{7(-25)} duality symmetry. We generalize to stationary 1/8 BPS multicenter solutions of N=8, d=4 supergravity, using the consistent truncation to the quaternionic magic N=2 supergravity. We present a general solution of non-BPS attractor equations of the STU truncation of magic models. We finish with a discussion of the BPS-non-BPS relations and attractors in N=2 versus N= 5, 6, 8.Comment: 33 pages, references added plus brief outline at end of introductio

A note on higher-dimensional magic matrices

We provide exact and asymptotic formulae for the number of unrestricted, respectively indecomposable, $d$-dimensional matrices where the sum of all matrix entries with one coordinate fixed equals 2.Comment: AmS-LaTeX, 9 page

Enthusing and inspiring with reusable kinaesthetic activities

We describe the experiences of three University projects that use a style of physical, non-computer based activity to enthuse and teach school students computer science concepts. We show that this kind of activity is effective as an outreach and teaching resource even when reused across different age/ability ranges, in lecture and workshop formats and for delivery by different people. We introduce the concept of a Reusable Outreach Object (ROO) that extends Reusable Learning Objects. and argue for a community effort in developing a repository of such objects

Solving finite-domain linear constraints in presence of the alldifferent\texttt{alldifferent}

In this paper, we investigate the possibility of improvement of the widely-used filtering algorithm for the linear constraints in constraint satisfaction problems in the presence of the alldifferent constraints. In many cases, the fact that the variables in a linear constraint are also constrained by some alldifferent constraints may help us to calculate stronger bounds of the variables, leading to a stronger constraint propagation. We propose an improved filtering algorithm that targets such cases. We provide a detailed description of the proposed algorithm and prove its correctness. We evaluate the approach on five different problems that involve combinations of the linear and the alldifferent constraints. We also compare our algorithm to other relevant approaches. The experimental results show a great potential of the proposed improvement.Comment: 28 pages, 2 figure