Algorithms for necklace maps

Necklace maps visualize quantitative data associated with regions by placing scaled symbols, usually disks, without overlap on a closed curve (the necklace) surrounding the map regions. Each region is projected onto an interval on the necklace that contains its symbol. In this paper we address the algorithmic question how to maximize symbol sizes while keeping symbols disjoint and inside their intervals. For that we reduce the problem to a one-dimensional problem which we solve efficiently. Solutions to the one-dimensional problem provide a very good approximation for the original necklace map problem. We consider two variants: Fixed-Order, where an order for the symbols on the necklace is given, and Any-Order where any symbol order is possible. The Fixed-Order problem can be solved in O(n log n) time. We show that the Any-Order problem is NP-hard for certain types of intervals and give an exact algorithm for the decision version. This algorithm is fixed-parameter tractable in the thickness K of the input. Our algorithm runs in O(n log n + n2K4K) time which can be improved to O(n log n + nK2K) time using a heuristic. We implemented our algorithm and evaluated it experimentally. Keywords: Necklace maps; scheduling; automated cartograph

Rigidification of quasi-categories

We give a new construction for rigidifying a quasi-category into a simplicial category, and prove that it is weakly equivalent to the rigidification given by Lurie. Our construction comes from the use of necklaces, which are simplicial sets obtained by stringing simplices together. As an application of these methods, we use our model to reprove some basic facts from Lurie's "Higher Topos Theory" regarding the rigidification process.Comment: 26 page

Polytopal complexes: maps, chain complexes and... necklaces

The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It is then possible to define an induced chain map between the associated chain complexes. Finally, we use this new tool to give the first combinatorial proof of the splitting necklace theorem of Alon. The paper ends with open questions, such as the existence of Sperner's lemma for a polytopal complex or the existence of a cubical approximation theorem.Comment: Presented at the TGGT 08 Conference, May 2008, Paris. The definition of a polytopal map has been modifie

Simplicial models for concurrency

We model both concurrent programs and the possible executions from one state to another in a concurrent program using simplices. The latter are calculated using necklaces of simplices in the former.Comment: 12 pages, Section 4 from v1 omitted since quasi-category equivalences are too strong: they induce equivalences of path categorie

Enhancing non-melonic triangulations: A tensor model mixing melonic and planar maps

Ordinary tensor models of rank $D\geq 3$ are dominated at large $N$ by tree-like graphs, known as melonic triangulations. We here show that non-melonic contributions can be enhanced consistently, leading to different types of large $N$ limits. We first study the most generic quartic model at $D=4$, with maximally enhanced non-melonic interactions. The existence of the $1/N$ expansion is proved and we further characterize the dominant triangulations. This combinatorial analysis is then used to define a non-quartic, non-melonic class of models for which the large $N$ free energy and the relevant expectations can be calculated explicitly. They are matched with random matrix models which contain multi-trace invariants in their potentials: they possess a branched polymer phase and a 2D quantum gravity phase, and a transition between them whose entropy exponent is positive. Finally, a non-perturbative analysis of the generic quartic model is performed, which proves analyticity in the coupling constants in cardioid domains