Contact graphs of circular arcs

We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most 2s − k edges, and (2, k)-tight if in addition it has exactly 2n−k edges, where n is the number of vertices. Every graph with a CCA-representation is planar and (2, 0)-sparse, and it follows from known results that for k ≥ 3 every (2, k)-sparse graph has a CCA-representation. Hence the question of CCA-representability is open for (2, k)-sparse graphs with 0 ≤ k ≤ 2. We partially answer this question by computing CCArepresentations for several subclasses of planar (2, 0)-sparse graphs. Next, we study CCA-representations in which each arc has an empty convex hull. We show that every plane graph of maximum degree 4 has such a representation, but that finding such a representation for a plane (2, 0)-tight graph with maximum degree 5 is NP-complete. Finally, we describe a simple algorithm for representing plane (2, 0)-sparse graphs with wedges, where each vertex is represented with a sequence of two circular arcs (straight-line segments). © Springer International Publishing Switzerland 2015

On iterated torus knots and transversal knots

A knot type is exchange reducible if an arbitrary closed n-braid representative can be changed to a closed braid of minimum braid index by a finite sequence of braid isotopies, exchange moves and +/- destabilizations. In the manuscript [J Birman and NC Wrinkle, On transversally simple knots, preprint (1999)] a transversal knot in the standard contact structure for S^3 is defined to be transversally simple if it is characterized up to transversal isotopy by its topological knot type and its self-linking number. Theorem 2 of Birman and Wrinkle [op cit] establishes that exchange reducibility implies transversally simplicity. The main result in this note, establishes that iterated torus knots are exchange reducible. It then follows as a Corollary that iterated torus knots are transversally simple.Comment: Published by Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol5/paper21.abs.htm

Uniquely D-colourable digraphs with large girth

Let C and D be digraphs. A mapping $f:V(D)\to V(C)$ is a C-colouring if for every arc $uv$ of D, either $f(u)f(v)$ is an arc of C or $f(u)=f(v)$, and the preimage of every vertex of C induces an acyclic subdigraph in D. We say that D is C-colourable if it admits a C-colouring and that D is uniquely C-colourable if it is surjectively C-colourable and any two C-colourings of D differ by an automorphism of C. We prove that if a digraph D is not C-colourable, then there exist digraphs of arbitrarily large girth that are D-colourable but not C-colourable. Moreover, for every digraph D that is uniquely D-colourable, there exists a uniquely D-colourable digraph of arbitrarily large girth. In particular, this implies that for every rational number $r\geq 1$, there are uniquely circularly r-colourable digraphs with arbitrarily large girth.Comment: 21 pages, 0 figures To be published in Canadian Journal of Mathematic

Imagining circles: empirical data and a perceptual model for the arc-size illusion

An essential part of visual object recognition is the evaluation of the curvature of both an object's outline as well as the contours on its surface. We studied a striking illusion of visual curvature--the arc-size illusion (ASI)--to gain insight into the visual coding of curvature. In the ASI, short arcs are perceived as flatter (less curved) compared to longer arcs of the same radius. We investigated if and how the ASI depends on (i) the physical size of the stimulus and (ii) on the length of the arc. Our results show that perceived curvature monotonically increases with arc length up to an arc angle of about 60°, thereafter remaining constant and equal to the perceived curvature of a full circle. We investigated if the misjudgment of curvature in the ASI translates into predictable biases for three other perceptual tasks: (i) judging the position of the centre of circular arcs; (ii) judging if two circular arcs fall on the circumference of the same (invisible) circle and (iii) interpolating the position of a point on the circumference of a circle defined by two circular arcs. We found that the biases in all the above tasks were reliably predicted by the same bias mediating the ASI. We present a simple model, based on the central angle subtended by an arc, that captures the data for all tasks. Importantly, we argue that the ASI and related biases are a consequence of the fact that an object's curvature is perceived as constant with viewing distance, in other words is perceptually scale invariant