相关论文: Statistics on some classes of knot shadows

Quandle cocycle invariants form a powerful and well developed tool in knot theory. This paper treats their variations - namely, positive and twisted quandle cocycle invariants, and shadow invariants. We interpret the former as particular…

In this paper we study the generating polynomials obtained by enumerating signed simsun permutations by number of the descents. Properties of the polynomials, including the recurrence relations and generating functions are studied.

Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…

We extend the notion of (smooth) stable generalized complex structures to allow for an anticanonical section with normal self-crossing singularities. This weakening not only allows for a number of natural examples in higher dimensions but…

We compute the shadows of colliding black holes using the Kastor-Traschen cosmological multiblack hole solution that is an exact solution describing the collision of maximally charged black holes with a positive cosmological constant. We…

We extend the concepts of trivializing and knotting numbers for knots to spatial graphs and 2-bouquet graphs, in particular. Furthermore, we calculate the trivializing and knotting numbers for projections and pseudodiagrams of 2-bouquet…

The 1-form symmetries in two-dimensional topological systems are ``shadowed'' as global symmetries in their one-dimensional quantum transfer matrices. In this work, we introduce a distinct shadow effect arising from the pair-creation of…

In this paper, we research the grid homology for spatial graphs with cut edges. We show that the grid homology for spatial graph $f$ is trivial if $f$ has sinks, sources, or cut edges. As an application, we give purely combinatorial proofs…

The knots-quivers correspondence states that various characteristics of a knot are encoded in the corresponding quiver and the moduli space of its representations. However, this correspondence is not a bijection: more than one quiver may be…

We introduce an alternative stratification of knots: by the size of lattice on which a knot can be first met. Using this classification, we find ratio of unknots and knots with more than 10 minimal crossings inside different lattices and…

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…

There exists many complicated $k$-noncrossing pseudoknot RNA structures in nature based on some special conditions. The special characteristic of RNA structures gives us great challenges in researching the enumeration, prediction and the…

This paper investigates the relationship between the signature and the crossing number of knots and links. We refine existing theorems and provide a comprehensive classification of links with specific properties, particularly those with…

In this paper, we discuss the (co)homology theory of biquandles, derived biquandle cocycle invariants for oriented surface-links using broken surface diagrams and how to compute the biquandle cocycle invariants from marked graph diagrams.…

We propose a novel unifying approach to study the shadowing property for a broad class of dynamical systems (in particular, discontinuous and non-invertible) under a variety of perturbations. In distinction to known constructions, our…

We introduce a new invariant for a $2$-knot in $S^4$, called the shadow-complexity, based on the theory of Turaev shadows, and we give a characterization of $2$-knots with shadow-complexity at most $1$. Specifically, we show that the unknot…

In this paper we use artificial neural networks to predict and help compute the values of certain knot invariants. In particular, we show that neural networks are able to predict when a knot is quasipositive with a high degree of accuracy.…

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed…

An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between…

"Classical shadows" are estimators of an unknown quantum state, constructed from suitably distributed random measurements on copies of that state [Nature Physics 16, 1050-1057]. Here, we analyze classical shadows obtained using random…