相关论文: Link mutations and Goeritz matrices
In this paper we study the equivalence relation on the set of acyclic orientations of a graph Y that arises through source-to-sink conversions. This source-to-sink conversion encodes, e.g. conjugation of Coxeter elements of a Coxeter group.…
V.I. Arnold [Russian Math. Surveys 26(2) (1971) 29-43] constructed a miniversal deformation of a square complex matrix under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it…
Motivated by classification, up to order isomorphism, of some dense subgroups of Euclidean space that are free of minimal rank, we obtain apparently new invariants for an equivalence relation (intermediate between Hermite and Smith) on…
We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…
This is a short survey of algebro-combinatorial link homology theories which have the Jones polynomial and other link polynomials as their Euler characteristics.
There are many papers devoted to derivation of Lorentz Transformations (LT). Many people have pro posed alternative derivations. Their analysis allows looking at LT and their consequences from different standpoints. At the same time it is…
We use Kirk's invariant of link maps $S^2\sqcup S^2\to S^4$ and its variations due to Koschorke and Kirk-Livingston to deduce results about classical links. Namely, we give a new proof of the Nakanishi-Ohyama classification of two-component…
We introduce a new equivalence relation, named R-equivalence relation, on the set of colorings of an oriented knot diagram by a quandle. We determine the R-equivalence classes of colorings of a diagram of a torus knot by a quandle, called…
A pass-move and a $#$-move are local moves on oriented links defined by L.H. Kauffman and H. Murakami respectively. Two links are self pass-equivalent (resp. self $#$-equivalent) if one can be deformed into the other by pass-moves (resp.…
Let $B \subseteq A$ be an extension of finite dimensional algebras. We provide a sufficient condition for the existence of triangle equivalences of singularity categories (resp. Gorenstein defect categories) between $A$ and $B$. This result…
An open question akin to the slice-ribbon conjecture asks whether every ribbon knot can be represented as a symmetric union. Next to this basic existence question sits the question of uniqueness of such representations. Eisermann and Lamm…
Let L be a Legendrian knot in R^3 with the standard contact structure. In [10], a map was constructed from equivalence classes of Morse complex sequences for L, which are combinatorial objects motivated by generating families, to homotopy…
We give a new and elementary proof that simultaneous similarity and simultaneous equivalence of families of matrices are invariant under extension of the ground field, a result which is non-trivial for finite fields and first appeared in a…
A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…
Given a finite dimensional representation of a semisimple Lie algebra there are two ways of constructing link invariants: 1) quantum group invariants using the R-matrix, 2) the Kontsevich universal link invariant followed by the Lie algebra…
This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction…
In 1977 Diaconis and Graham proved two inequalities relating different measures of disarray in permutations, and asked for a characterization of those permutations for which equality holds in one of these inequalities. Such a…
We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…