El fandango de Huelva en "El Traslado" de la Virgen del Rocío: un estudio etnomusicológico

El cante flamenco está presente en múltiples manifestaciones religioso-festivas en torno a la Imagen de la Virgen del Rocío, patrona de la localidad de Almonte, en la provincia de Huelva. En el presente estudio se realiza un análisis etnomusicológico sobre un evento que ocurre cada siete años cuando la Imagen es trasladada desde la aldea del Rocío al pueblo de Almonte para rendirle pleitesía durante nueve meses, tras los cuales, la Virgen vuelve a su ermita en la aldea marismeña. Durante «El Traslado», la Virgen es portada a hombros tres leguas de camino por los almonteños, que la vitorean con salvas de escopeta y cantes por fandangos y sevillanas. Nos centramos aquí en el cante por fandangos de Huelva dedicados a la Virgen. Concretamente, el performance que se analiza se refiere a la ofrenda que le dedica un aficionado local que, subido a un pino, un montículo o un caballo, le canta a la Imagen por fandangos. Por tanto, se realiza un análisis de «El Traslado» de la Virgen como un marco socio-religioso donde aparece integrada una variante específica del fandango como vehículo expresivo de un tipo de religiosidad popular al tiempo que refleja una idea de identidad cultural y pertenencia local

Un algoritmo eficiente para estudiar la similitud melódica de los cantes flamencos

En este trabajo se estudia la similitud melódica entre cantes flamencos usando el paradigma Dynamic Time Warping como medida. Centramos nuestro estudio en un grupo de estilos en particular, las tonás, cantes flamencos a capela, caracterizados por ser cantes ad libitum y por su alto grado de complejidad en la ornamentación. Se muestra que esta medida de similitud discrimina correctamente variaciones entre estilos. Con relación a la aceleración de los algoritmos de similitud clásicos, nuestra estrategia calcula una segmentación eficiente del contorno melódico previa a la aplicación de la medida de similitud. Se demuestra que nuestro método obtiene mejores resultados (tanto en eficiencia como en precisión) que otros algoritmos existentes

Aspectos evolutivos de la guitarra flamenca en relación con el cante

La música flamenca, como música de tradición oral, está involucrada en un continuo proceso de evolución y cambio influenciado por el marco cultural donde se desarrolla. En este trabajo apuntamos varios casos en los que ha existido una interacción entre guitarra y cante ‒entre guitarrista y cantaor‒ que ha posibilitado cambios en los estilos o palos flamencos. Aspectos como la armonía, el ritmo y el compás, además de la propia melodía, son considerados para analizar algunos de los cambios observados en la primera mitad del siglo XX

Improved enumeration of simple topological graphs

A simple topological graph T = (V (T ), E(T )) is a drawing of a graph in the plane where every two edges have at most one common point (an endpoint or a crossing) and no three edges pass through a single crossing. Topological graphs G and H are isomorphic if H can be obtained from G by a homeomorphism of the sphere, and weakly isomorphic if G and H have the same set of pairs of crossing edges. We generalize results of Pach and Tóth and the author's previous results on counting different drawings of a graph under both notions of isomorphism. We prove that for every graph G with n vertices, m edges and no isolated vertices the number of weak isomorphism classes of simple topological graphs that realize G is at most 2 O(n2log(m/n)), and at most 2O(mn1/2 log n) if m ≤ n 3/2. As a consequence we obtain a new upper bound 2 O(n3/2 log n) on the number of intersection graphs of n pseudosegments. We improve the upper bound on the number of weak isomorphism classes of simple complete topological graphs with n vertices to 2n2 ·α(n) O(1), using an upper bound on the size of a set of permutations with bounded VC-dimension recently proved by Cibulka and the author. We show that the number of isomorphism classes of simple topological graphs that realize G is at most 2 m2+O(mn) and at least 2 Ω(m2) for graphs with m > (6 + ε)n.Graph Drawings and Representations, EuroGIGA ProjectCentre Interfacultaire Bernoull

Continuous surveillance of points by rotating floodlights

Let P and F be sets of n ≥ 2 and m ≥ 2 points in the plane, respectively, so that P∪F is in general position. We study the problem of finding the minimum angle α ∈ [2π/m, 2π] such that one can install at each point of F a stationary rotating floodlight with illumination angle α, initially oriented in a suitable direction, in such a way that, at all times, every target point of P is illuminated by at least one light. All floodlights rotate at unit speed and clockwise. We give an upper bound for the 1-dimensional problem and present results for some instances of the general problem. Specifically, we solve the problem for the case in which we have two floodlights and many points, and give an upper bound for the case in which there are many floodlights and only two target points.Ministerio de Educación y CienciaEuropean Science FoundationMinisterio de Ciencia e InnovaciónComisión Nacional de Investigación Científica y Tecnológica (Chile)Fondo Nacional de Desarrollo Científico y Tecnológico (Chile

Three location tapas calling for CG sauce

Based on some recent modelling considerations in location theory we call for study of three CG constructs of Voronoi type that seem not to have been studied much before

Abstract Voronoi diagrams

Abstract Voronoi diagrams are a unifying framework that covers many types of concrete Voronoi diagrams. This talk reports on the state of the art, including recent progress.European Science Foundatio

Phase transitions in the Ramsey-Turán theory

Let f(n) be a function and L be a graph. Denote by RT(n, L, f(n)) the maximum number of edges of an L-free graph on n vertices with independence number less than f(n). Erdos and Sós asked if RT (n, K5, c√ n) = o (n2) for some constant c. We answer this question by proving the stronger RT(n, K5, o (√n log n)) = o(n2). It is known that RT (n, K5, c√n log n )= n2/4 + o (n2) for c > 1, so one can say that K5 has a Ramsey-Turán-phase transition at c√n log n. We extend this result to several other Kp's and functions f(n), determining many more phase transitions. We shall formulate several open problems, in particular, whether variants of the Bollobás-Erdos graph, which is a geometric construction, exist to give good lower bounds on RT (n, Kp, f(n)) for various pairs of p and f(n). These problems are studied in depth by Balogh-HuSimonovits, where among others, the Szemerédi's Regularity Lemma and the Hypergraph Dependent Random Choice Lemma are used.National Science Foundatio

Recent developments on the crossing number of the complete graph

Ministerio de Economía y CompetitividadEuropean Science Foundatio

On the nonexistence of k-reptile simplices in R3 and R4

A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled without overlaps by k simplices with disjoint interiors that are all mutually congruent and similar to S. For d=2, triangular k-reptiles exist for many values of k and they have been completely characterized by Snover, Waiveris, and Williams. On the other hand, the only k-reptile simplices that are known for d≥3, have k=m d, where m is a positive integer. We substantially simplify the proof by Matoušek and the second author that for d=3, k-reptile tetrahedra can exist only for k=m 3. We also prove a weaker analogue of this result for d=4 by showing that four-dimensional k-reptile simplices can exist only for k=m 2.Czech Science FoundationCentre Interfacultaire BernoulliSwiss National Science Foundatio