Circulant tournaments of prime order are tight

AbstractWe say that a tournament is tight if for every proper 3-coloring of its vertex set there is a directed cyclic triangle whose vertices have different colors. In this paper, we prove that all circulant tournaments with a prime number p≥3 of vertices are tight using results relating to the acyclic disconnection of a digraph and theorems of additive number theory

Hamilton cycles in graphs and hypergraphs: an extremal perspective

As one of the most fundamental and well-known NP-complete problems, the Hamilton cycle problem has been the subject of intensive research. Recent developments in the area have highlighted the crucial role played by the notions of expansion and quasi-randomness. These concepts and other recent techniques have led to the solution of several long-standing problems in the area. New aspects have also emerged, such as resilience, robustness and the study of Hamilton cycles in hypergraphs. We survey these developments and highlight open problems, with an emphasis on extremal and probabilistic approaches.Comment: to appear in the Proceedings of the ICM 2014; due to given page limits, this final version is slightly shorter than the previous arxiv versio

Harmonic equiangular tight frames comprised of regular simplices

An equiangular tight frame (ETF) is a sequence of unit-norm vectors in a Euclidean space whose coherence achieves equality in the Welch bound, and thus yields an optimal packing in a projective space. A regular simplex is a simple type of ETF in which the number of vectors is one more than the dimension of the underlying space. More sophisticated examples include harmonic ETFs which equate to difference sets in finite abelian groups. Recently, it was shown that some harmonic ETFs are comprised of regular simplices. In this paper, we continue the investigation into these special harmonic ETFs. We begin by characterizing when the subspaces that are spanned by the ETF's regular simplices form an equi-isoclinic tight fusion frame (EITFF), which is a type of optimal packing in a Grassmannian space. We shall see that every difference set that produces an EITFF in this way also yields a complex circulant conference matrix. Next, we consider a subclass of these difference sets that can be factored in terms of a smaller difference set and a relative difference set. It turns out that these relative difference sets lend themselves to a second, related and yet distinct, construction of complex circulant conference matrices. Finally, we provide explicit infinite families of ETFs to which this theory applies

Club guessing and the universal models

We survey the use of club guessing and other pcf constructs in the context of showing that a given partially ordered class of objects does not have a largest, or a universal element