Spanning embeddings of arrangeable graphs with sublinear bandwidth

The Bandwidth Theorem of B\"ottcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this result to a-arrangeable graphs H with \Delta(H)<sqrt(n)/log(n), where n is the number of vertices of H. Our result implies that sufficiently large n-vertex graphs G with minimum degree at least (3/4+\gamma)n contain almost all planar graphs on n vertices as subgraphs. Using techniques developed by Allen, Brightwell and Skokan [Combinatorica, to appear] we can also apply our methods to show that almost all planar graphs H have Ramsey number at most 12|H|. We obtain corresponding results for graphs embeddable on different orientable surfaces.Comment: 20 page

A higher rank Racah algebra and the Z2n\mathbb{Z}_2^{n} Laplace-Dunkl operator

A higher rank generalization of the (rank one) Racah algebra is obtained as the symmetry algebra of the Laplace-Dunkl operator associated to the $\mathbb{Z}_2^n$ root system. This algebra is also the invariance algebra of the generic superintegrable model on the $n$-sphere. Bases of Dunkl harmonics are constructed explicitly using a Cauchy-Kovalevskaia theorem. These bases consist of joint eigenfunctions of maximal Abelian subalgebras of the higher rank Racah algebra. A method to obtain expressions for both the connection coefficients between these bases and the action of the symmetries on these bases is presented.Comment: 20 pages, various small changes, accepted in J. Phys.

A characterization of testable hypergraph properties

We provide a combinatorial characterization of all testable properties of $k$-graphs (i.e. $k$-uniform hypergraphs). Here, a $k$-graph property $\mathbf{P}$ is testable if there is a randomized algorithm which makes a bounded number of edge queries and distinguishes with probability $2/3$ between $k$-graphs that satisfy $\mathbf{P}$ and those that are far from satisfying $\mathbf{P}$. For the $2$-graph case, such a combinatorial characterization was obtained by Alon, Fischer, Newman and Shapira. Our results for the $k$-graph setting are in contrast to those of Austin and Tao, who showed that for the somewhat stronger concept of local repairability, the testability results for graphs do not extend to the $3$-graph setting.Comment: 82 pages; extended abstract of this paper appears in FOCS 201

Isomorphism test for digraphs with weighted edges

Colour refinement is at the heart of all the most efficient graph isomorphism software packages. In this paper we present a method for extending the applicability of refinement algorithms to directed graphs with weighted edges. We use Traces as a reference software, but the proposed solution is easily transferrable to any other refinement-based graph isomorphism tool in the literature. We substantiate the claim that the performances of the original algorithm remain substantially unchanged by showing experiments for some classes of benchmark graphs

Combating Food Waste: Dumpster Diving as a Form of Consumer Resistance

This paper explores North America’s food waste issue associated with our current industrial globalized food system. Through a sociocultural lens, this essay examines the new social movement of dumpster diving among food waste activists and ‘freegans’ in urban areas. Millions of people are currently unaware as to where their next meal will come from, yet Western households and supermarkets waste massive amounts of edible food. Dumpster divers do not just encourage us to be mindful of the choices we make with respect to food waste; they seek to challenge pre-existing capitalist structures and conventional ways of thinking. Analyzing the counterculture movement of dumpster diving can help us better understand the role food plays in our daily lives, and can provide an important ideological template to follow in order to mitigate this pressing social and environmental injustice