中文
相关论文

相关论文: Estimates for the minimal crossing number

200 篇论文

Using the colored Kauffman skein relation, we study the highest and lowest $4n$ coefficients of the $n^{th}$ unreduced colored Jones polynomial of alternating links. This gives a natural extension of a result by Kauffman in regard with the…

几何拓扑 · 数学 2016-10-10 Mustafa Hajij

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…

几何拓扑 · 数学 2023-04-04 Jundai Nanasawa

We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the space crossing numbers of pseudo-random graphs.

组合数学 · 数学 2011-08-16 Boris Bukh , Alfredo Hubard

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

Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…

组合数学 · 数学 2007-05-23 Jeff Kahn , Gil Kalai

The aim of this text is to provide an elementary and self-contained exposition of Gromov's argument on topological overlap (the presentation is based on Gromov's work, as well as two follow-up papers of Matousek and Wagner, and of…

几何拓扑 · 数学 2015-08-05 Amir Yehudayoff

We extend the construction of the DAHA-Jones polynomials for any reduced root systems and DAHA-superpolynomials in type A from the iterated torus knots (our previous paper) to links, including arbitrary algebraic links. Such a passage…

量子代数 · 数学 2017-01-17 Ivan Cherednik , Ivan Danilenko

A multi-crossing (or n-crossing) is a singular point in a projection at which n strands cross so that each strand bisects the crossing. We generalize the classic result of Kauffman, Murasugi, and Thistlethwaite, which gives the upper bound…

This is supplementary material for the article arxiv:0708.3250. We provide an alternative introduction of the mean Euler Characteristic, additional examples and the percolation thresholds for 2-uniform lattices.

统计力学 · 物理学 2008-01-13 Richard A. Neher , Klaus Mecke , Herbert Wagner

We answer a question posed by Fielder in [1] concerning two notions of crossing number for algebraic knots $K$ under Hopf fibration, one topological, denoted $h(K)$, the other coming from the realization of such knots around complex…

几何拓扑 · 数学 2020-06-30 Maciej Mroczkowski

Every link in the 3-sphere has a projection to the plane where the only singularities are pairwise transverse triple points. The associated diagram, with height information at each triple point, is a triple-crossing diagram of the link. We…

几何拓扑 · 数学 2017-06-29 Colin Adams , Jim Hoste , Martin Palmer

By using motivic homotopy theory, we introduce a counterpart in algebraic geometry to oriented links and their linking numbers. After constructing the (ambient) quadratic linking degree -- our analogue of the linking number which takes…

代数几何 · 数学 2025-08-05 Clémentine Lemarié--Rieusset

Following the recent work by Chan, and by Morton and Hadji on the Homflypt polynomials of some generalized Hopf links, we investigate the Kauffman polynomials of generalized Hopf links. By studying the Kauffman skein module of the solid…

几何拓扑 · 数学 2007-05-23 Jianyuan K. Zhong , Bin Lu

An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements…

离散数学 · 计算机科学 2010-08-17 Bill Rosgen , Lorna Stewart

Link prediction, or the inference of future or missing connections between entities, is a well-studied problem in network analysis. A multitude of heuristics exist for link prediction in ordinary networks with a single type of connection.…

机器学习 · 计算机科学 2020-04-10 Robert E. Tillman , Vamsi K. Potluru , Jiahao Chen , Prashant Reddy , Manuela Veloso

Fox's conjecture (1962) states that the sequence of absolute values of the coefficients of the Alexander polynomial of alternating links is trapezoidal. While the conjecture remains open in general, a number of special cases have been…

组合数学 · 数学 2025-12-16 Karola Mészáros , Melissa Sherman-Bennett , Alexander Vidinas

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…

几何拓扑 · 数学 2018-06-13 Charles Livingston

X.S. Lin and O. Dasbach proved that the sum of the absolute value of the second and penultimate coefficients of the Jones polynomial of an alternating knot is equal to the twist number of the knot. In this paper we give a new proof of their…

几何拓扑 · 数学 2007-05-23 Robert G. Todd

We define a set of restricted Reidemeister moves and show that if $K$ is obtained from $K_0\,\#\,K_1$ using those moves, then the crossing number of $K$ is at least $c(K_0)+c(K_1)$. We also explore topological interpretations of this…

几何拓扑 · 数学 2025-11-26 Vadim Weinstein

In this short note we show the existence of an epimorphism between groups of $2$-bridge knots by means of an elementary argument using the Riley polynomial. As a corollary, we give a classification of $2$-bridge knots by Riley polynomials.

几何拓扑 · 数学 2016-09-27 Teruaki Kitano , Takayuki Morifuji
‹ 上一页 1 8 9 10 下一页 ›