Onset of plane layer magnetoconvection at low Ekman number

We study the onset of magnetoconvection between two infinite horizontal planes subject to a vertical magnetic field aligned with background rotation. In order to gain insight into the convection taking place in the Earth's tangent cylinder, we target regimes of asymptotically strong rotation. The critical Rayleigh number Ra-c and critical wavenumber a(c) are computed numerically by solving the linear stability problem in a systematic way, with either stress-free or no-slip kinematic boundary conditions. A parametric study is conducted, varying the Ekman number E (ratio of viscous to Coriolis forces) and the Elsasser number. (ratio of the Lorentz force to the Coriolis force). E is varied from 10(-9) to 10(-2) and. from 10(-3) to 1. For a wide range of thermal and magnetic Prandtl numbers, our results verify and confirm previous experimental and theoretical results showing the existence of two distinct unstable modes at low values of E-one being controlled by the magnetic field, the other being controlled by viscosity (often called the viscous mode). It is shown that oscillatory onset does not occur in the range of parameters we are interested in. Asymptotic scalings for the onset of these modes are numerically confirmed and their domain of validity is precisely quantified. We show that with no-slip boundary conditions, the asymptotic behavior is reached for E < 10(-6) and establish a map in the (E, Lambda) plane. We distinguish regions where convection sets in either through the magnetic mode or through the viscous mode. Our analysis gives the regime in which the transition between magnetic and viscous modes may be observed. We also show that within the asymptotic regime, the role played by the kinematic boundary conditions is minimal. (C) 2015 AIP Publishing LLC.

Upper bound on cubicity in terms of boxicity for graphs of low chromatic number

The boxicity (respectively cubicity) of a graph G is the least integer k such that G can be represented as an intersection graph of axis-parallel k-dimensional boxes (respectively k-dimensional unit cubes) and is denoted by box(G) (respectively cub(G)). It was shown by Adiga and Chandran (2010) that for any graph G, cub(G) <= box(G) log(2) alpha(G], where alpha(G) is the maximum size of an independent set in G. In this note we show that cub(G) <= 2 log(2) X (G)] box(G) + X (G) log(2) alpha(G)], where x (G) is the chromatic number of G. This result can provide a much better upper bound than that of Adiga and Chandran for graph classes with bounded chromatic number. For example, for bipartite graphs we obtain cub(G) <= 2(box(G) + log(2) alpha(G)] Moreover, we show that for every positive integer k, there exist graphs with chromatic number k such that for every epsilon > 0, the value given by our upper bound is at most (1 + epsilon) times their cubicity. Thus, our upper bound is almost tight. (c) 2015 Elsevier B.V. All rights reserved.