scholarly journals VoIDext: Vocabulary and Patterns for Enhancing Interoperable Datasets with Virtual Links

2019 ◽  
pp. 607-625 ◽  
Author(s):  
Tarcisio Mendes de Farias ◽  
Kurt Stockinger ◽  
Christophe Dessimoz
Keyword(s):  
Virtual Links

Polynomial invariants for virtual marked graphs and virtual surface-link theory I

2017 ◽  
Vol 26 (12) ◽  
pp. 1750081
Author(s):  
Sang Youl Lee
Keyword(s):  
Natural Extension ◽  
Polynomial Invariants ◽  
Kauffman Bracket ◽  
Virtual Links ◽  
Link Theory ◽  
Marked Graphs ◽  
Bracket Polynomial ◽  
The Ideal

In this paper, we introduce a notion of virtual marked graphs and their equivalence and then define polynomial invariants for virtual marked graphs using invariants for virtual links. We also formulate a way how to define the ideal coset invariants for virtual surface-links using the polynomial invariants for virtual marked graphs. Examining this theory with the Kauffman bracket polynomial, we establish a natural extension of the Kauffman bracket polynomial to virtual marked graphs and found the ideal coset invariant for virtual surface-links using the extended Kauffman bracket polynomial.

Architecture and design of optical path networks utilizing waveband virtual links

2016 ◽  
Author(s):  
Yusaku Ito ◽  
Yojiro Mori ◽  
Hiroshi Hasegawa ◽  
Ken-ichi Sato
Keyword(s):  
Optical Path ◽  
Virtual Links ◽  
Architecture And Design

A MULTI-VARIABLE POLYNOMIAL INVARIANT FOR UNORIENTED VIRTUAL KNOTS AND LINKS

2009 ◽  
Vol 18 (05) ◽  
pp. 625-649 ◽  
Author(s):  
YASUYUKI MIYAZAWA
Keyword(s):  
Crossing Number ◽  
Weighted Sum ◽  
Virtual Link ◽  
Polynomial Invariant ◽  
Virtual Knots ◽  
Virtual Links ◽  
Knots And Links

We construct a multi-variable polynomial invariant Y for unoriented virtual links as a certain weighted sum of polynomials, which are derived from virtual magnetic graphs with oriented vertices, on oriented virtual links associated with a given virtual link. We show some features of the Y-polynomial including an evaluation of the virtual crossing number of a virtual link.

scholarly journals Flexibility from networks of data centers: A market clearing formulation with virtual links

2020 ◽  
Vol 189 ◽  
pp. 106723
Author(s):  
Weiqi Zhang ◽  
Line A. Roald ◽  
Andrew A. Chien ◽  
John R. Birge ◽  
Victor M. Zavala
Keyword(s):  
Data Centers ◽  
Market Clearing ◽  
Virtual Links

GENERALIZED INDEX POLYNOMIALS FOR VIRTUAL LINKS

2012 ◽  
Vol 21 (14) ◽  
pp. 1250128
Author(s):  
KYEONGHUI LEE ◽  
YOUNG HO IM
Keyword(s):  
Knot Theory ◽  
Recursive Method ◽  
Polynomial Invariant ◽  
Polynomial Invariants ◽  
Virtual Knots ◽  
Virtual Links

We construct some polynomial invariants for virtual links by the recursive method, which are different from the index polynomial invariant defined in [Y. H. Im, K. Lee and S. Y. Lee, Index polynomial invariant of virtual links, J. Knot Theory Ramifications19(5) (2010) 709–725]. We show that these polynomials can distinguish whether virtual knots can be invertible or not although the index polynomial cannot distinguish the invertibility of virtual knots.

SOME NUMERICAL INVARIANTS OF FLAT VIRTUAL LINKS ARE ALWAYS REALIZED BY REDUCED DIAGRAMS

2006 ◽  
Vol 15 (03) ◽  
pp. 289-297 ◽  
Author(s):  
TERUHISA KADOKAMI
Keyword(s):  
Intersection Number ◽  
Finite Sequence ◽  
Closed Surface ◽  
Crossing Number ◽  
The Self ◽  
Virtual Link ◽  
Virtual Knot ◽  
Virtual Links ◽  
Geodesic Loop ◽  
Numerical Invariants

Any flat virtual link has a reduced diagram which satisfies a certain minimality, and reduced diagrams are related one another by a finite sequence of a certain Reidemeister move. The move preserves some numerical invariants of diagrams. So we can define numerical invariants for flat virtual links. One of them, the crossing number of a flat virtual knot K, coinsides with the self-intersection number of K as an essential geodesic loop on a hyperbolic closed surface. We also show an equation among these numerical invariants, basic properties by using the equation, and determine non-split flat virtual links with the crossing number up to three.

scholarly journals Graphs, Links, and Duality on Surfaces

2010 ◽  
Vol 20 (2) ◽  
pp. 267-287 ◽  
Author(s):  
VYACHESLAV KRUSHKAL
Keyword(s):  
Planar Graphs ◽  
Jones Polynomial ◽  
Tutte Polynomial ◽  
Natural Duality ◽  
Polynomial Invariant ◽  
Topological Duality ◽  
Ribbon Graphs ◽  
Virtual Links ◽  
Graphs On Surfaces ◽  
Tutte Polynomials

We introduce a polynomial invariant of graphs on surfaces,PG, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result forPG, analogous to the duality for the Tutte polynomial of planar graphs. This property is important from the perspective of statistical mechanics, where the Tutte polynomial is known as the partition function of the Potts model. For ribbon graphs,PGspecializes to the well-known Bollobás–Riordan polynomial, and in fact the two polynomials carry equivalent information in this context. Duality is also established for a multivariate version of the polynomialPG. We then consider a 2-variable version of the Jones polynomial for links in thickened surfaces, taking into account homological information on the surface. An analogue of Thistlethwaite's theorem is established for these generalized Jones and Tutte polynomials for virtual links.

Sign in / Sign up

Export Citation Format

Share Document