Disjoint cycles in directed graphs on the torus and the Klein bottle

We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein bottle to contain pairwise disjoint circuits, each of a given orientation and homotopy, and in a given order. For the Klein bottle, the theorem is new. For the torus, the theorem was proved before by P. D. Seymour. This paper gives a shorter proof of that result. © 1993 by Academic Press, Inc

Disjoint circuits on a Klein bottle and a theorem on posets

In this paper, we consider the problem of packing disjoint directed circuits in a digraph drawn on the Klein bottle or on the torus. We formulate a problem on posets which unifies all the problems considered by Ding et al. and by Seymour. Then we generalize all the results of their two papers by proving a theorem on our special posets. © 1993

Drawing bobbin lace graphs, or, Fundamental cycles for a subclass of periodic graphs

In this paper, we study a class of graph drawings that arise from bobbin lace patterns. The drawings are periodic and require a combinatorial embedding with specific properties which we outline and demonstrate can be verified in linear time. In addition, a lace graph drawing has a topological requirement: it contains a set of non-contractible directed cycles which must be homotopic to $(1,0)$, that is, when drawn on a torus, each cycle wraps once around the minor meridian axis and zero times around the major longitude axis. We provide an algorithm for finding the two fundamental cycles of a canonical rectangular schema in a supergraph that enforces this topological constraint. The polygonal schema is then used to produce a straight-line drawing of the lace graph inside a rectangular frame. We argue that such a polygonal schema always exists for combinatorial embeddings satisfying the conditions of bobbin lace patterns, and that we can therefore create a pattern, given a graph with a fixed combinatorial embedding of genus one.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Developing a Mathematical Model for Bobbin Lace

Bobbin lace is a fibre art form in which intricate and delicate patterns are created by braiding together many threads. An overview of how bobbin lace is made is presented and illustrated with a simple, traditional bookmark design. Research on the topology of textiles and braid theory form a base for the current work and is briefly summarized. We define a new mathematical model that supports the enumeration and generation of bobbin lace patterns using an intelligent combinatorial search. Results of this new approach are presented and, by comparison to existing bobbin lace patterns, it is demonstrated that this model reveals new patterns that have never been seen before. Finally, we apply our new patterns to an original bookmark design and propose future areas for exploration.Comment: 20 pages, 18 figures, intended audience includes Artists as well as Computer Scientists and Mathematician

Cohomology of wheels on toric varieties

We describe explicitly the cohomology of the total complex of certain diagrams of invertible sheaves on normal toric varieties. These diagrams, called wheels, arise in the study of toric singularities associated to dimer models. Our main tool describes the generators in a family of syzygy modules associated to the wheel in terms of walks in a family of graphs.Comment: 17 pages, 5 figures. arXiv admin note: substantial text overlap with arXiv:1111.6018; final version 21 page

One brick at a time: a survey of inductive constructions in rigidity theory

We present a survey of results concerning the use of inductive constructions to study the rigidity of frameworks. By inductive constructions we mean simple graph moves which can be shown to preserve the rigidity of the corresponding framework. We describe a number of cases in which characterisations of rigidity were proved by inductive constructions. That is, by identifying recursive operations that preserved rigidity and proving that these operations were sufficient to generate all such frameworks. We also outline the use of inductive constructions in some recent areas of particularly active interest, namely symmetric and periodic frameworks, frameworks on surfaces, and body-bar frameworks. We summarize the key outstanding open problems related to inductions.Comment: 24 pages, 12 figures, final versio