Generalized Tonnetze and Zeitnetze, and the topology of music concepts

The music-theoretic idea of a Tonnetz can be generalized at different levels: as a network of chords relating by maximal intersection, a simplicial complex in which vertices represent notes and simplices represent chords, and as a triangulation of a manifold or other geometrical space. The geometrical construct is of particular interest, in that allows us to represent inherently topological aspects to important musical concepts. Two kinds of music-theoretical geometry have been proposed that can house Tonnetze: geometrical duals of voice-leading spaces and Fourier phase spaces. Fourier phase spaces are particularly appropriate for Tonnetze in that their objects are pitch-class distributions (real-valued weightings of the 12 pitch classes) and proximity in these space relates to shared pitch-class content. They admit of a particularly general method of constructing a geometrical Tonnetz that allows for interval and chord duplications in a toroidal geometry. This article examines how these duplications can relate to important musical concepts such as key or pitch height, and details a method of removing such redundancies and the resulting changes to the homology of the space. The method also transfers to the rhythmic domain, defining Zeitnetze for cyclic rhythms. A number of possible Tonnetze are illustrated: on triads, seventh chords, ninth chords, scalar tetrachords, scales, etc., as well as Zeitnetze on common cyclic rhythms or timelines. Their different topologies – whether orientable, bounded, manifold, etc. – reveal some of the topological character of musical concepts.Accepted manuscrip

The Three Tree Theorem

We prove that every 2-sphere graph different from a prism can be vertex 4-colored in such a way that all Kempe chains are forests. This implies the following three tree theorem: the arboricity of a discrete 2-sphere is 3. Moreover, the three trees can be chosen so that each hits every triangle. A consequence is a result of an exercise in the book of Bondy and Murty based on work of A. Frank, A. Gyarfas and C. Nash-Williams: the arboricity of a planar graph is less or equal than 3.Comment: 17 pages, 3 figure

Phase diagram of the triangular-lattice Potts antiferromagnet

We study the phase diagram of the triangular-lattice Q-state Potts model in the real (Q, v)-plane, where v - e(J) - 1 is the temperature variable. Our first goal is to provide an obviously missing feature of this diagram: the position of the antiferromagnetic critical curve. This curve turns out to possess a bifurcation point with two branches emerging from it, entailing important consequences for the global phase diagram. We have obtained accurate numerical estimates for the position of this curve by combining the transfer-matrix approach for strip graphs with toroidal boundary conditions and the recent method of critical polynomials. The second goal of this work is to study the corresponding A(p-1) RSOS model on the torus, for integer p = 4, 5,..., 8. We clarify its relation to the corresponding Potts model, in particular concerning the role of boundary conditions. For certain values of p, we identify several new critical points and regimes for the RSOS model and we initiate the study of the flows between the corresponding field theories.The research of JLJ was supported in part by the Agence Nationale de la Recherche (grant ANR-10-BLAN-0414: DIME), the Institut Universitaire de France, and the European Research Council (through the advanced grant NuQFT). The research of JLJ and JS was supported in part by Spanish MINECO grant FIS2014-57387-C3-3-P. The work of CRS was performed under the auspices of the U.S. Department of Energy at the Lawrence Livermore National Laboratory under Contract No DE-AC52-07NA27344

A computational approach for finding 6-List-critical graphs on the Torus

La coloració de grafs dibuixats a superfícies és un àrea antiga i molt estudiada de la teoria de grafs. Thomassen va demostrar que hi ha un nombre finit de grafs 6-crítics a qualsevol superfície fixa i va proporcionar el conjunt explícit dels grafs 6-crítics al torus. Després, Postle va demostrar que hi ha un nombre finit de grafs 6-llista-crítics a qualsevol superfície fixa. Amb l'objectiu de trobar el conjunt de grafs 6-llista-crítics al torus, desenvolupem i implementem tècniques algorítmiques per la cerca per ordinador de grafs crítics en diferents situacions de coloració per llistes.La coloración de grafos dibujados en superficies es un área antigua y muy estudiada de la teoría de grafos. Thomassen demostró que hay un número finito de grafos 6-críticos en cualquier superficie fija y proporcionó el conjunto explícito de los grafos 6-críticos en el toro. Después, Postle demostró que hay un número finito de grafos 6-lista-críticos en cualquier superficie fija. Con el objetivo de encontrar el conjunto de grafos 6-lista-críticos en el toro, desarrollamos e implementamos técnicas algorítmicas para la búsqueda por ordenador de grafos críticos en diferentes situaciones de coloración por listas.Coloring graphs embedded on surfaces is an old and well-studied area of graph theory. Thomassen proved that there are finitely many 6-critical graphs on any fixed surface and provided the explicit set of 6-critical graphs on the torus. Later, Postle proved that there are finitely many 6-list-critical graphs on any fixed surface. With the goal of finding the set of 6-list-critical graphs on the torus, we develop and implement algorithmic techniques for computer search of critical graphs in different list-coloring settings.Outgoin

High speed all optical networks

An inherent problem of conventional point-to-point wide area network (WAN) architectures is that they cannot translate optical transmission bandwidth into comparable user available throughput due to the limiting electronic processing speed of the switching nodes. The first solution to wavelength division multiplexing (WDM) based WAN networks that overcomes this limitation is presented. The proposed Lightnet architecture takes into account the idiosyncrasies of WDM switching/transmission leading to an efficient and pragmatic solution. The Lightnet architecture trades the ample WDM bandwidth for a reduction in the number of processing stages and a simplification of each switching stage, leading to drastically increased effective network throughputs. The principle of the Lightnet architecture is the construction and use of virtual topology networks, embedded in the original network in the wavelength domain. For this construction Lightnets utilize the new concept of lightpaths which constitute the links of the virtual topology. Lightpaths are all-optical, multihop, paths in the network that allow data to be switched through intermediate nodes using high throughput passive optical switches. The use of the virtual topologies and the associated switching design introduce a number of new ideas, which are discussed in detail

Edge coloring of simple graphs and edge -face coloring of simple plane graphs

We prove that chie( G) = Delta if Delta ≥ 5 and g ≥ 4, or Delta ≥ 4 and g ≥ 5, or Delta ≥ 3 and g ≥ 9. In addition, if chi(Sigma) \u3e 0, then chie( G) = Delta if Delta ≥ 3 and g ≥ 8 where Delta, g is the maximum degree, the girth of the graph G, respectively.;It is proved that G is not critical if d¯ ≤ 6 and Delta ≥ 8, or d¯ ≤ 203 and Delta ≥ 9. This result generalizes earlier results.;Given a simple plane graph G, an edge-face k-coloring of G is a function &phis; : E(G) ∪ F(G) {lcub}1, ···, k{rcub} such that, for any two adjacent elements a, b ∈ E(G) ∪ F(G), &phis;( a) ≠ &phis;(b). Denote chie( G), chief(G), Delta( G) the edge chromatic number, the edge-face chromatic number and the maximum degree of G, respectively. We prove that chi ef(G) = chie( G) = Delta(G) for any 2-connected simple plane graph G with Delta(G) ≥ 24

Continuous Combinatorics of Abelian Group Actions

This paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups. The methods center around the construction of certain specialized hyper-aperiodic elements, which produce compact subflows with useful properties. For example, we show that there is no continuous $3$-coloring of the Cayley graph on $F(2^{\mathbb{Z}^2})$, the free part of the shift action of $\mathbb{Z}^2$ on $2^{\mathbb{Z}^2}$. With earlier work of the authors this computes the continuous chromatic number of $F(2^{\mathbb{Z}^2})$ to be exactly $4$. Combined with marker arguments for the positive directions, our methods allow us to analyze continuous homomorphisms into graphs, and more generally equivariant maps into subshifts of finite type. We present a general construction of a finite set of "tiles" for $2^{\mathbb{Z}^n}$ (there are $12$ for $n=2$) such that questions about the existence of continuous homomorphisms into various structures reduce to finitary combinatorial questions about the tiles. This tile analysis is used to deduce a number of results about $F(2^{\mathbb{Z}^n})$.Comment: 107 pages, 47 figure