Dimension Reduction via Colour Refinement

Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph into "colour classes" in such a way that all vertices in the same colour class have the same number of neighbours in every colour class. Tinhofer (Disc. App. Math., 1991), Ramana, Scheinerman, and Ullman (Disc. Math., 1994) and Godsil (Lin. Alg. and its App., 1997) established a tight correspondence between colour refinement and fractional isomorphisms of graphs, which are solutions to the LP relaxation of a natural ILP formulation of graph isomorphism. We introduce a version of colour refinement for matrices and extend existing quasilinear algorithms for computing the colour classes. Then we generalise the correspondence between colour refinement and fractional automorphisms and develop a theory of fractional automorphisms and isomorphisms of matrices. We apply our results to reduce the dimensions of systems of linear equations and linear programs. Specifically, we show that any given LP L can efficiently be transformed into a (potentially) smaller LP L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm, applied to a matrix associated with the LP. The transformation is such that we can easily (by a linear mapping) map both feasible and optimal solutions back and forth between the two LPs. We demonstrate empirically that colour refinement can indeed greatly reduce the cost of solving linear programs

A Moving Boundary Flux Stabilization Method for Cartesian Cut-Cell Grids using Directional Operator Splitting

An explicit moving boundary method for the numerical solution of time-dependent hyperbolic conservation laws on grids produced by the intersection of complex geometries with a regular Cartesian grid is presented. As it employs directional operator splitting, implementation of the scheme is rather straightforward. Extending the method for static walls from Klein et al., Phil. Trans. Roy. Soc., A367, no. 1907, 4559-4575 (2009), the scheme calculates fluxes needed for a conservative update of the near-wall cut-cells as linear combinations of standard fluxes from a one-dimensional extended stencil. Here the standard fluxes are those obtained without regard to the small sub-cell problem, and the linear combination weights involve detailed information regarding the cut-cell geometry. This linear combination of standard fluxes stabilizes the updates such that the time-step yielding marginal stability for arbitrarily small cut-cells is of the same order as that for regular cells. Moreover, it renders the approach compatible with a wide range of existing numerical flux-approximation methods. The scheme is extended here to time dependent rigid boundaries by reformulating the linear combination weights of the stabilizing flux stencil to account for the time dependence of cut-cell volume and interface area fractions. The two-dimensional tests discussed include advection in a channel oriented at an oblique angle to the Cartesian computational mesh, cylinders with circular and triangular cross-section passing through a stationary shock wave, a piston moving through an open-ended shock tube, and the flow around an oscillating NACA 0012 aerofoil profile.Comment: 30 pages, 27 figures, 3 table

Limitations of Algebraic Approaches to Graph Isomorphism Testing

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and only if if the graphs are isomorphic, and then to (try to) decide satisfiability of the system using, for example, the Gr\"obner basis algorithm. In some cases this can be done in polynomial time, in particular, if the equations admit a bounded degree refutation in an algebraic proof systems such as Nullstellensatz or polynomial calculus. We prove linear lower bounds on the polynomial calculus degree over all fields of characteristic different from 2 and also linear lower bounds for the degree of Positivstellensatz calculus derivations. We compare this approach to recently studied linear and semidefinite programming approaches to isomorphism testing, which are known to be related to the combinatorial Weisfeiler-Lehman algorithm. We exactly characterise the power of the Weisfeiler-Lehman algorithm in terms of an algebraic proof system that lies between degree-k Nullstellensatz and degree-k polynomial calculus

Black Holes as Quantum Gravity Condensates

We model spherically symmetric black holes within the group field theory formalism for quantum gravity via generalised condensate states, involving sums over arbitrarily refined graphs (dual to 3d triangulations). The construction relies heavily on both the combinatorial tools of random tensor models and the quantum geometric data of loop quantum gravity, both part of the group field theory formalism. Armed with the detailed microscopic structure, we compute the entropy associated with the black hole horizon, which turns out to be equivalently the Boltzmann entropy of its microscopic degrees of freedom and the entanglement entropy between the inside and outside regions. We recover the area law under very general conditions, as well as the Bekenstein-Hawking formula. The result is also shown to be generically independent of any specific value of the Immirzi parameter.Comment: 22 page