Related papers: The Mathematics of String Art Nets
In this paper we report a new promising idea on the design and manufacturing of ply composite structures, tailored to exhibit maximum stiffness under given weight constraints and loading conditions. It is based on the idea behind an…
New classes of distance-constrained structures are introduced, namely string-node nets and meshes, a mesh being a string-node net for which the nodes are dense in the strings. Various construction schemes are given including the minimal…
A string figure is topologically a trivial knot lying on an imaginary plane orthogonal to the fingers with some crossings. The fingers prevent cancellation of these crossings. As a mathematical model of string figure we consider a knot…
An algorithm to generate the locus of a circle using the intersection points of straight lines is proposed. The pixels on the circle are plotted independent of one another and the operations involved in finding the locus of the circle from…
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a thrackle drawing of a graph on the plane cannot have more edges than vertices. We prove the Conjecture for…
This paper proposes a way to understand neural network artworks as juxtapositions of natural image cues. It is hypothesized that images with unusual combinations of realistic visual cues are interesting, and, neural models trained to model…
A graph is a mathematical object consisting of a set of vertices and a set of edges connecting vertices. Graphs can be drawn on paper in various ways, but until recently all published methods of drawing graphs have had undesirable…
Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider problems in the intersection of these two areas. Given the…
We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
A string graph is an intersection graph of curves in the plane. A $k$-string graph is a graph with a string representation in which every pair of curves intersects in at most $k$ points. We introduce the class of $(=k)$-string graphs as a…
In recent work, the author and others have studied compositional algebras of Petri nets. Here we consider mathematical aspects of the pure linking algebras that underly them. We characterise composition of nets without places as the…
By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We…
Type IIB string theory admits a BPS configuration in which three strings (of different type) meet at a point. Using this three string configuration we construct a string network and study its properties. In particular we prove supersymmetry…
A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…
We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it…
In the game of pegging, each vertex of a graph is considered a hole into which a peg can be placed. A pegging move is performed by jumping one peg over another peg, and then removing the peg that has been jumped over from the graph. We…
String diagrams are a graphical language used to represent processes that can be composed sequentially or in parallel, which correspond graphically to horizontal or vertical juxtaposition. In this paper we demonstrate how to compute the…
A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…