相关论文: Ravels arising from Montesinos Tangles
We give explicit deformations of embeddings of abstractly planar graphs that lie on the standard torus $T^2 \subset \mathbb{R}^3$ and that contain neither a nontrivial knot nor a nonsplit link into the plane. It follows that ravels do not…
A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths…
A planar Tangle is a smooth simple closed curve piecewise defined by quadrants of circles with constant curvature. We can enumerate Tangles by counting their dual graphs, which consist of a certain family of polysticks. The number of…
An array is row-Latin if no symbol is repeated within any row. An array is Latin if it and its transpose are both row-Latin. A transversal in an $n\times n$ array is a selection of $n$ different symbols from different rows and different…
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…
The Reeb graph of a smooth function is a graph being a natural quotient space of the manifold of the domain and the space of all connected components of preimages. Such a combinatorial and topological object roughly and compactly represents…
An algebraic domain is a closed topological subsurface of a real affine plane whose boundary consists of disjoint smooth connected components of real algebraic plane curves. We study the geometric shape of an algebraic domain by collapsing…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
A bowtie is a graph consisting of two triangles with one vertex identified. We show that the class of all (countable) graphs not containing a bowtie as a subgraph has a Ramsey lift (expansion). This solves one of the old problems in the…
We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This…
The rising algebra is a subalgebra of the group algebra of the symmetric group S_n, gotten by lumping together permutations having the same number of rising sequences. This well-known algebra arises naturally when studying riffle shuffles.…
We define treetopes, a generalization of the three-dimensional roofless polyhedra (Halin graphs) to arbitrary dimensions. Like roofless polyhedra, treetopes have a designated base facet such that every face of dimension greater than one…
A latin square of order $n$ is an $n\times n$ array of $n$ symbols in which each symbol occurs exactly once in each row and column. A transversal of such a square is a set of $n$ entries such that no two entries share the same row, column…
A tessellation or tiling is a collection of sets, called tiles, that cover a plane without gaps and overlaps. The present note is an invitation to get to know the beauty and majesty of tessellations and triangulation of orientable surfaces.
This article addresses persistent tangles. These are tangles whose presence in a knot diagram forces that diagram to be knotted. We provide new methods for constructing persistent tangles. Our techniques rely mainly on the existence of…
A Latin square is an $n$ by $n$ grid filled with $n$ symbols so that each symbol appears exactly once in each row and each column. A transversal in a Latin square is a collection of cells which do not share any row, column, or symbol. This…
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…
A vertex ranking of a graph is an assignment of ranks (or colors) to the vertices of the graph, in such a way that any simple path connecting two vertices of equal rank, must contain a vertex of a higher rank. In this paper we study a…
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…
We develop an algebraic structure modeling local operators in a three-dimensional quantum field theory which is partially holomorphic and partially topological. The geometric space organizing our algebraic structure is called the raviolo…