scholarly journals On symmetric matrices associated with oriented link diagrams

2021 ◽  
pp. 131-146
Author(s):  
Rinat Kashaev
2014 ◽  
Vol 23 (08) ◽  
pp. 1450041
Author(s):  
Tatsuo Ando ◽  
Chuichiro Hayashi ◽  
Miwa Hayashi

Rectangular diagrams of links are link diagrams in the plane ℝ2 such that they are composed of vertical line segments and horizontal line segments and vertical segments go over horizontal segments at all crossings. Cromwell and Dynnikov showed that rectangular diagrams of links are useful for deciding whether a given link is split or not, and whether a given knot is trivial or not. We show in this paper that an oriented link diagram D with c(D) crossings and s(D) Seifert circles can be deformed by an ambient isotopy of ℝ2 into a rectangular diagram with at most c(D) + 2s(D) vertical segments, and that, if D is connected, at most 2c(D) + 2 - w(D) vertical segments, where w(D) is a certain non-negative integer. In order to obtain these results, we show that the system of Seifert circles and arcs substituting for crossings can be deformed by an ambient isotopy of ℝ2 so that Seifert circles are rectangles composed of two vertical line segments and two horizontal line segments and arcs are vertical line segments, and that we can obtain a single circle from a connected link diagram by smoothing operations at the crossings regardless of orientation.


2010 ◽  
Vol 19 (01) ◽  
pp. 81-92
Author(s):  
XIAN'AN JIN ◽  
FUJI ZHANG

It is well known that Kauffman constructed a state model of the Jones polynomial based on unoriented link diagrams. In his approach, in order to obtain Jones polynomial one needs to calculate both the writhe and the Kauffman bracket. Stimulated by a paper of Altintas (An oriented state model for the Jones polynomial and its applications to alternating links, Appl. Math. Comput.194 (2007) 168–178), in this paper we present a state sum model based on oriented link diagrams. In our approach, we succeed in adding the writhe to the state sum model and need not to compute the writher any more. We further show that, via our state sum model, Jones polynomial of any link (alternating or not) is a special parametrization of the dichromatic polynomial of a weighted graph with two different edge weights.


1996 ◽  
Vol 11 (31) ◽  
pp. 2531-2537 ◽  
Author(s):  
TATSUO KOBAYASHI ◽  
ZHI-ZHONG XING
Keyword(s):  

We study the Kielanowski parametrization of the Kobayashi-Maskawa (KM) matrix V. A new two-angle parametrization is investigated explicitly and compared with the Kielanowski ansatz. Both of them are symmetric matrices and lead to |V13/V23|=0.129. Necessary corrections to the off-diagonal symmetry of V are also discussed.


2021 ◽  
Vol 618 ◽  
pp. 76-96
Author(s):  
M.A. Duffner ◽  
A.E. Guterman ◽  
I.A. Spiridonov
Keyword(s):  

2019 ◽  
Vol 7 (1) ◽  
pp. 257-262
Author(s):  
Kenji Toyonaga

Abstract Given a combinatorially symmetric matrix A whose graph is a tree T and its eigenvalues, edges in T can be classified in four categories, based upon the change in geometric multiplicity of a particular eigenvalue, when the edge is removed. We investigate a necessary and sufficient condition for each classification of edges. We have similar results as the case for real symmetric matrices whose graph is a tree. We show that a g-2-Parter edge, a g-Parter edge and a g-downer edge are located separately from each other in a tree, and there is a g-neutral edge between them. Furthermore, we show that the distance between a g-downer edge and a g-2-Parter edge or a g-Parter edge is at least 2 in a tree. Lastly we give a combinatorially symmetric matrix whose graph contains all types of edges.


Author(s):  
Heather M Russell ◽  
Julianna Tymoczko

Abstract Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link diagrams in terms of webs, producing quantum invariants like the well-known Jones polynomial. One important question in representation theory is to identify the relationships between different bases; coefficients in the change-of-basis matrix often describe combinatorial, algebraic, or geometric quantities (e.g., Kazhdan–Lusztig polynomials). By ”flattening” the braiding maps, webs can also be viewed as the basis elements of a symmetric group representation. In this paper, we define two new combinatorial structures for webs: band diagrams and their one-dimensional projections, shadows, which measure depths of regions inside the web. As an application, we resolve an open conjecture that the change of basis between the so-called Specht basis and web basis of this symmetric group representation is unitriangular for $\mathfrak{sl}_3$-webs ([ 33] and [ 29].) We do this using band diagrams and shadows to construct a new partial order on webs that is a refinement of the usual partial order. In fact, we prove that for $\mathfrak{sl}_2$-webs, our new partial order coincides with the tableau partial order on webs studied by the authors and others [ 12, 17, 29, 33]. We also prove that though the new partial order for $\mathfrak{sl}_3$-webs is a refinement of the previously studied tableau order, the two partial orders do not agree for $\mathfrak{sl}_3$.


Author(s):  
A. E. Guterman ◽  
M. A. Duffner ◽  
I. A. Spiridonov
Keyword(s):  

2021 ◽  
Vol 9 (1) ◽  
pp. 31-35
Author(s):  
Isaac Cinzori ◽  
Charles R. Johnson ◽  
Hannah Lang ◽  
Carlos M. Saiago
Keyword(s):  

Abstract Using the recent geometric Parter-Wiener, etc. theorem and related results, it is shown that much of the multiplicity theory developed for real symmetric matrices associated with paths and generalized stars remains valid for combinatorially symmetric matrices over a field. A characterization of generalized stars in the case of combinatorially symmetric matrices is given.


Sign in / Sign up

Export Citation Format

Share Document