相关论文: Matrix Integrals and the Generation and Counting o…
Pseudodiagrams are knot or link diagrams where some of the crossing information is missing. Pseudoknots are equivalence classes of pseudodiagrams, where equivalence is generated by a natural set of Reidemeister moves. In this paper, we…
This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there…
We introduce and study strongly invertible Legendrian links in the standard contact three-dimensional space. We establish the equivariant analogs of basic results separately well-known for strongly invertible and Legendrian links, i.e. the…
Consider the special linear group of degree $2$ over an arbitrary finite field, acting on the full space of $2 \times 2$-matrices by transpose. We explicitly construct a generating set for the corresponding modular matrix invariant ring,…
We present a method to construct new tilting complexes from existing ones using tensor products, generalizing a result of Rickard. The endomorphism rings of these complexes are generalized matrix rings that are "componentwise" tensor…
The near threshold expansion of Feynman diagrams is derived from their configuration space representation, by performing all x integrations. The general scalar Feynman diagram is considered, with an arbitrary number of external momenta, an…
Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…
Besides finding trends and unveiling typical patterns, modern information retrieval is increasingly more interested in the discovery of surprising information in textual datasets. In this work we focus on finding "unexpected links" in…
We define the {\it Wirtinger number} of a link, an invariant closely related to the meridional rank. The Wirtinger number is the minimum number of generators of the fundamental group of the link complement over all meridional presentations…
Tangles were originally introduced as a concept to formalize regions of high connectivity in graphs. In recent years, they have also been discovered as a link between structural graph theory and data science: when interpreting similarity in…
Given a prime, alternating link diagram, we build a special cover of the link complement whose degree is bounded by a factorial function of the crossing number. It follows that a subgroup of the link group of that index embeds into…
Associated to Legendrian links in the standard contact three-space, Ruling polynomials are Legendrian isotopy invariants, which also compute augmentation numbers, that is, the points-counting of augmentation varieties for Legendrian links…
Links in most real networks often change over time. Such temporality of links encodes the ordering and causality of interactions between nodes and has a profound effect on network dynamics and function. Empirical evidences have shown that…
Tangles of graphs have been introduced by Robertson and Seymour in the context of their graph minor theory. Tangles may be viewed as describing "k-connected components" of a graph (though in a twisted way). They play an important role in…
We consider an algebra of (classical or virtual) tangles over an ordered circuit operad and introduce Conway-type invariants of tangles which respect this algebraic structure. The resulting invariants contain both the coefficients of the…
A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertex-segments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices;…
In this paper, we establish that the arc shift operation on a $n$-component virtual link diagram acts as an unknotting operation when the virtual link is $n$-homogeneous proper, aiding in the classification of \( n \)-component virtual…
The statistical mechanics of spin models, such as the Ising or Potts models, on generic random graphs can be formulated economically by considering the N --> 1 limit of Hermitian matrix models. In this paper we consider the N --> 1 limit in…
Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
We use crossing parity to construct a generalization of biquandles for virtual knots which we call Parity Biquandles. These structures include all biquandles as a standard example referred to as the even parity biquandle. Additionally, we…