相关论文: The rank of a warping matrix
We introduce the warping matrix which is a new description of oriented knots from a viewpoint of warping degree.
The warping degree of an oriented knot diagram is the minimal number of crossings which we meet as an under-crossing first when we travel along the diagram from a fixed point. The warping degree of a knot projection is the minimal value of…
A weaving knot is an alternating knot whose minimal diagram is a closed braid of a lattice-like pattern. In this paper, the warping degree of a braid diagram is defined, and upper bounds of the unknotting number and the region unknotting…
For an oriented knot diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain the monotone diagram from D in the usual way. We show that d(D) + d(-D) + 1 is less than or equal to the crossing…
We introduce the warping polynomial of an oriented knot diagram. In this paper, we characterize the warping polynomial, and define the span of a knot to be the minimal span of the warping polynomial for all diagrams of the knot. We show…
In this paper, we define the OU matrix of a braid diagram and discuss how the OU matrix reflects the warping degree or the layeredness of the braid diagram, and show that the determinant of the OU matrix of a layered braid diagram is the…
We introduce the warping crossing polynomial of an oriented knot diagram by using the warping degrees of crossing points of the diagram. Given a closed transversely intersected plane curve, we consider oriented knot diagrams obtained from…
The warping degree of an oriented knot diagram is the minimal number of crossing changes which are required to obtain a monotone knot diagram from the diagram. The minimal warping degree of a knot is the minimal value of the warping degree…
Let $W_{k,n}^{i}(m)$ denote a matrix with rows and columns indexed by the $k$-subsets and $n$-subsets, respectively, of an $m$-element set. The row $S$, column $T$ entry of $W_{k,n}^{i}(m)$ is $1$ if $|S \cap T| = i$, and is $0$ otherwise.…
An \"{u}bercrossing diagram is a knot diagram with only one crossing that may involve more than two strands of the knot. Such a diagram without any nested loops is called a petal projection. Every knot has a petal projection from which the…
A new notion of vertex independence and rank for a finite graph G is introduced. The independence of vertices is based on the boolean independence of columns of a natural boolean matrix associated to G. Rank is the cardinality of the…
The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\it high-girth} matrices, whose…
Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…
It is shown that the projection image of an oriented spatial arc to any oriented plane is approximated by a unique arc diagram (up to isomorphic arc diagrams) determined from the spatial arc and the projection. In a separated paper, the…
In this paper we further develop the theory of matrices over the extended tropical semiring. Introducing a notion of tropical linear dependence allows for a natural definition of matrix rank in a sense that coincides with the notions of…
We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…
For an oriented link diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain a monotone diagram from D. We show that d(D)+d(-D)+sr(D) is less than or equal to the crossing number of D, where…
Every m by n matrix A with rank r has exactly r independent rows and r independent columns. The fact has become the most fundamental theorem in linear algebra such that we may favor it in an unconscious way. The sole aim of this paper is to…
For the class of stably dissipative Lotka-Volterra systems we prove that the rank of its defining matrix, which is the dimension of the associated invariant foliation, is completely determined by the system's graph.
Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…