Related papers: Successively almost positive links
We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of…
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject for their own sake, they serve as essential instruments in…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
A virtual link is a generalization of a classical link that is defined as an equivalence class of certain diagrams, called virtual link diagrams. It is further generalized to a twisted link. Twisted links are in one-to-one correspondence…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences, respectively. Our main result is a probabilistic…
We provide a new bound on the maximum degree of the Jones polynomial of a positive link with second Jones coefficient equal to $\pm 1$ or $\pm 2$. This builds upon the result of our previous work, in which we found such a bound for positive…
Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…
In this article we completely characterise constant length substitution shifts which have an almost automorphic factor, or which have a bijective substitution factor. Our approach is algebraic: we study these dynamical properties in terms…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
We show that the crossing number of any link that is known to be quasi-alternating is less than or equal to its determinant. Based on this, we conjecture that the crossing number of any quasi-alternating link is less than or equal to its…
We consider a variant of so called power-law random graph. A sequence of expected degrees corresponds to a power-law degree distribution with finite mean and infinite variance. In previous works the asymptotic picture with number of nodes…
Scenarios elicit possibilities that may be ignored otherwise, as well as causal relations between them. Even when too little information is available to assess reliable probabilities, the structure of linkages between evoked alternatives…
We provide a combinatorial characterisation of positive diagrams satisfying the equality in the Morton-Franks-Williams bound for the degrees of the HOMFLY-PT polynomial. This characterisation allows generating with relative ease examples of…
A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is `pseudorandom', meaning that, for instance,…
We introduce the class of synchronous subsequential relations, a subclass of the synchronous relations which embodies some properties of subsequential relations. If we take relations of this class as forming the possible transitions of an…
We introduce and solve a model which considers two coupled networks growing simultaneously. The dynamics of the networks is governed by the new arrival of network elements (nodes) making preferential attachments to pre-existing nodes in…
We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman's Lemma. This leads to tight multiply-recursive upper bounds that readily apply to several verification algorithms for…
The symmetric tensor power of graphs is introduced and its fundamental properties are explored. A wide range of intriguing phenomena occur when one considers symmetric tensor powers of familiar graphs. A host of open questions are…
Link prediction in complex networks has attracted increasing attention from both physical and computer science communities. The algorithms can be used to extract missing information, identify spurious interactions, evaluate network evolving…