中文
相关论文

相关论文: Conway-Gordon type theorem for the complete four-p…

200 篇论文

Conway-Gordon proved that for every spatial complete graph on 6 vertices, the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2, and for every spatial complete graph on 7 vertices, the sum…

几何拓扑 · 数学 2020-05-19 Ryo Nikkuni , Kouki Taniyama

In 1983, Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and that for every spatial complete graph on seven vertices, the…

几何拓扑 · 数学 2020-05-19 Hiroko Morishita , Ryo Nikkuni

In 1983, Conway-Gordon showed that for every spatial complete graph on 6 vertices, the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2, and for every spatial complete graph on 7 vertices,…

几何拓扑 · 数学 2020-05-19 Ryo Nikkuni

For every spatial embedding of each graph in the Petersen family, it is known that the sum of the linking numbers over all of the constituent 2-component links is congruent to 1 modulo 2. In this paper, we give an integral lift of this…

几何拓扑 · 数学 2020-05-19 Hiroka Hashimoto , Ryo Nikkuni

It is known that for every spatial complete graph on $n\ge 7$ vertices, the summation of the second coefficients of the Conway polynomials over the Hamiltonian knots is congruent to $r_{n}$ modulo $(n-5)!$, where $r_{n} = (n-5)!/2$ if…

几何拓扑 · 数学 2023-12-12 Ryo Nikkuni

Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and Kazakov and Korablev proved that for every spatial complete graph…

几何拓扑 · 数学 2021-04-09 Hiroko Morishita , Ryo Nikkuni

We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every…

几何拓扑 · 数学 2014-10-01 Erica Flapan

We show that, given any $n$ and $\alpha$, every embedding of any sufficiently large complete graph in $\mathbb{R}^3$ contains an oriented link with components $Q_1$, ..., $Q_n$ such that for every $i\not =j$, $|\lk(Q_i,Q_j)|\geq\alpha$ and…

几何拓扑 · 数学 2009-01-18 Erica Flapan , Blake Mellor , Ramin Naimi

Let $K_n$ be a complete graph with $n$ vertices. An embedding of $K_n$ in $S^3$ is called a spatial $K_n$-graph. Knots in a spatial $K_n$-graph corresponding to simple cycles of $K_n$ are said to be constituent knots. We consider the case…

几何拓扑 · 数学 2024-10-31 Olga Oshmarina , Andrei Vesnin

The Magnus expansion is a universal finite type invariant of pure braids with values in the space of horizontal chord diagrams. The Conway polynomial composed with the short circuit map from braids to knots gives rise to a series of finite…

几何拓扑 · 数学 2010-01-22 S. V. Duzhin

A low-dimensional version of our main result is the following `converse' of the Conway-Gordon-Sachs Theorem on intrinsic linking of the graph $K_6$ in 3-space: For any integer $z$ there are 6 points $1,2,3,4,5,6$ in 3-space, of which every…

几何拓扑 · 数学 2026-01-08 R. Karasev , A. Skopenkov

The fundamental quandle is a complete invariant for unoriented tame knots \cite{JO, Ma} and non-split links \cite{FR}. The proof involves proving a relationship between the components of the fundamental quandle and the cosets of the…

几何拓扑 · 数学 2026-02-26 Blake Mellor

This work is dedicated to the consideration of the construction of a representation of braid group generators from vertex models with $N$-states, which provides a great way to study the knot invariant. An algebraic formula is proposed for…

统计力学 · 物理学 2022-04-20 T. K. Kassenova , P. Tsyba , O. Razina , R. Myrzakulov

Let $K$ be a knot type for which the quadratic term of the Conway polynomial is nontrivial, and let $\gamma: \mathbb{R}\to \mathbb{R}^3$ be an analytic $\mathbb{Z}$-periodic function with non-vanishing derivative which parameterizes a knot…

几何拓扑 · 数学 2018-04-27 Cole Hugelmeyer

We prove that every internally 4-connected non-planar bipartite graph has an odd K_3,3 subdivision; that is, a subgraph obtained from K_3,3 by replacing its edges by internally disjoint odd paths with the same ends. The proof gives rise to…

组合数学 · 数学 2017-03-28 Robin Thomas , Peter Whalen

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

组合数学 · 数学 2024-02-14 R. Dogra , S. Lando

In this chapter (Chapter III) we introduce the concept of Conway algebras (the notion related to entropic magmas) and describe invariants of links yielded by (partial) Conway algebras (including the Homflypt polynomial and signatures). We…

几何拓扑 · 数学 2012-09-10 Jozef H. Przytycki

We present a universal knot polynomials for 2- and 3-strand torus knots in adjoint representation, by universalization of appropriate Rosso-Jones formula. According to universality, these polynomials coincide with adjoined colored HOMFLY…

高能物理 - 理论 · 物理学 2018-01-09 A. Mironov , R. Mkrtchyan , A. Morozov

We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…

几何拓扑 · 数学 2026-02-03 Carmen Caprau , Victoria Wiest

The Gordian graph and H(2)-Gordian graphs of knots are abstract graphs whose vertex sets represent isotopy classes of unoriented knots, and whose edge sets record whether pairs of knots are related by crossing changes or H(2)-moves,…

几何拓扑 · 数学 2021-11-24 Christopher Flippen , Allison H. Moore , Essak Seddiq
‹ 上一页 1 2 3 10 下一页 ›