相关论文: Determinant of the crossing matrix of a braid
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 study the crossing matrix of a braid and introduce a polynomial invariant for braid systems that is invariant under Hurwitz equivalence. As an application to the study of surface braids and surface links, we also define an invariant that…
We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…
The crossing matrix of a braid on $N$ strands is the $N\times N$ integer matrix with zero diagonal whose $i,j$ entry is the algebraic number (positive minus negative) of crossings by strand $i$ over strand $j$ . When restricted to the…
We consider birack and switch colorings of braids. We define a switch structure on the set of permutation representations of the braid group and consider when such a representation is a switch automorphism. We define quiver-valued…
We prove that the variety defined by the determinant of the matrix of diagonals is $F$-pure for matrices of all sizes and in all positive prime characteristics. Moreover, we find a system of parameters for it.
We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…
In this note we give concise formulas, which lead to a simple and fast computer program that computes a powerful knot invariant. This invariant $\rho_1$ is not new, yet our formulas are by far the simplest and fastest: given a knot we write…
Using the recoupling theory, we define a representation of the pure braid group and show that it is not trivial.
Under binary matrices we mean matrices whose entries take one of two values. In this paper, explicit formulae for calculating the determinant of some type of binary Toeplitz matrices are obtained. Examples of the application of the…
Every square matrix $A=(a_{uv})\in \mathcal{C}^{n\times n}$ can be represented as a digraph having $n$ vertices. In the digraph, a block (or 2-connected component) is a maximally connected subdigraph that has no cut-vertex. The determinant…
A classical result states that the determinant of an alternating link is equal to the number of spanning trees in a checkerboard graph of an alternating connected projection of the link. We generalize this result to show that the…
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…
Many interesting families of polynomials are indexed by permutations or related objects, and are defined by applying divided difference operators, modified by polynomials, on some initial base case. The fact that these constructions produce…
We present a consistent definition for braided ribbon networks in 3-dimensional manifolds, unifying both three and four valent networks in a single framework. We present evolution moves for these networks which are dual to the Pachner moves…
In this expositional essay, we introduce some elements of the study of groups by analysing the braid pattern on a knitted blanket. We determine that the blanket features pure braids with a minimal number of crossings. Moreover, we determine…
The aim of this paper is to show an estimate for the determinant of the covariance of a two-dimensional vector of multiple stochastic integrals of the same order in terms of a linear combination of the expectation of the determinant of its…
We compare two crossed homomorphisms on a braid group, one defined diagrammatically and the other defined algebraically. We show that these crossed homomorphisms are essentially the same, and compute them in detail for simple braids, namely…
We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…