Related papers: Statistics on some classes of knot shadows
There are 2^n possible resolutions of a smooth pseudodiagram with n precrossings. If we consider piecewise-linear (PL) pseudodiagrams and resolutions that themselves are PL, certain resolutions of the pseudodiagram may not exist in…
The special shadow-complexity is an invariant of closed $4$-manifolds defined by Costantino using Turaev's shadows. We show that for any positive integer $k$, the special shadow-complexity of the connected sum of $k$ copies of $S^1\times…
We study a class polynomials obtained from an enumeration of the number of queen paths. In particular, we find the generating function for the diagonal sequence of this table and the zero distribution of a sequence of related polynomials.
We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…
Arborescent knots are the ones which can be represented in terms of double fat graphs or equivalently as tree Feynman diagrams. This is the class of knots for which the present knowledge is enough for lifting topological description to the…
The generation of random graphs using edge swaps provides a reliable method to draw uniformly random samples of sets of graphs respecting some simple constraints, e.g. degree distributions. However, in general, it is not necessarily…
We prove a minimum degree version of the Kruskal--Katona theorem: given $d\ge 1/4$ and a triple system $F$ on $n$ vertices with minimum degree at least $d\binom n2$, we obtain asymptotically tight lower bounds for the size of its shadow.…
Let c(K;F) denote the surface crossing number of a knot K with respect to a closed connected surface F in S^3. We relate c(K;F) to the tunnel number t(K) and to the Heegaard deficiency delta(F)=g(M_1;F)+g(M_2;F)-g(F), where S^3=M_1 union_F…
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem…
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…
Spin networks, essentially labeled graphs, are ``good quantum numbers'' for the quantum theory of geometry. These structures encompass a diverse range of techniques which may be used in the quantum mechanics of finite dimensional systems,…
We study the size of the shadow of $k$-uniform hypergraphs with bounded degree. Lower bounds on the ratio of the size of the shadow and the size of the hypergraph are given as a function of the degree bound and $k$. We show that cliques are…
We study a family of tree-type diagrams that arise in studies of the cumulant expansion in discrete Erd\H os-R\'enyi random matrix models. Using a version of the Pr\" ufer code, we obtain an explicit expression for the number of tree-type…
This paper is a survey of several papers in quandle homology theory and cocycle knot invariants that have been published recently. Here we describe cocycle knot invariants that are defined in a state-sum form, quandle homology, and methods…
This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is…
We describe a procedure that creates an explicit complex-valued polynomial function of three-dimensional space, whose nodal lines are the three-twist knot $5_2$. The construction generalizes a similar approach for lemniscate knots: a braid…
The study of knot mosaics is based upon representing knot diagrams using a set of tiles on a square grid. This branch of knot theory has many unanswered questions, especially regarding the efficiency with which we draw knots as mosaics.…
We give an efficient construction of a reasonably small dominating set in a circulant graph on $n$ notes and $k$ distinct chord lengths. This result is based on bounds on some double exponential sums. .
Several complementary approaches to investigate knotted solutions of Maxwell's equations in vacuum are now available in literature. However, only partial results towards a unified description of them have been achieved. This is potentially…
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by means of shadows (projections) and by finitely many forbidden…