Knot Colorings: Coloring and Goeritz Matrices

نویسندگان

چکیده

Knot colorings are one of the simplest ways to distinguish knots, dating back Reidemeister and popularized by Fox. In this mostly expository article, we discuss knot invariants like colorability, determinant, number colorings, how these can be computed from either coloring matrix or Goeritz matrix. We give an elementary approach equivalence, without using any algebraic topology. also compute determinant nullity pretzel knots with arbitrarily many twist regions.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Dimensions of Knot Coloring

A knot is a circle smoothly embedded in 3-dimensional Euclidean space or its compactification, the 3-sphere. Two knots are regarded as the same if one can be smoothly deformed into the other.1 The mathematical theory of knots emerged from the smoky ruins of Lord Kelvin’s “vortex atom theory,” a hopelessly optimistic theory of matter of the nineteenth century in which atoms appeared as microscop...

متن کامل

Colorings and Orientations of Matrices and Graphs

We introduce colorings and orientations of matrices as generalizations of the graph theoretic terms. The permanent per(A[ζ|ξ]) of certain copies A[ζ|ξ] of a matrix A can be expressed as a weighted sum over the orientations or the colorings of A . When applied to incidence matrices of graphs these equations include Alon and Tarsi’s theorem about Eulerian orientations and the existence of list co...

متن کامل

Path homomorphisms, graph colorings, and boolean matrices

We investigate bounds on the chromatic number of a graph G derived from the nonexistence of homomorphisms from some path ~ P into some orientation ~ G of G. The condition is often efficiently verifiable using boolean matrix multiplications. However, the bound associated to a path ~ P depends on the relation between the “algebraic length” and “derived algebraic length” of ~ P . This suggests tha...

متن کامل

Tabu Search for Graph Coloring, T-colorings and Set T-colorings

In this paper, a generic tabu search is presented for three coloring problems: graph coloring, T-colorings and set T-colorings. This algorithm integrates important features such as greedy initialization, solution re-generation, dynamic tabu tenure, incremental evaluation of solutions and constraint handling techniques. Empirical comparisons show that this algorithm approaches the best coloring ...

متن کامل

A Note on Graph Coloring Extensions and List-Colorings

Let G be a graph with maximum degree ∆ ≥ 3 not equal to K∆+1 and let P be a subset of vertices with pairwise distance, d(P ), between them at least 8. Let each vertex x be assigned a list of colors of size ∆ if x ∈ V \P and 1 if x ∈ P . We prove that it is possible to color V (G) such that adjacent vertices receive different colors and each vertex has a color from its list. We show that d(P ) c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Mathematical Monthly

سال: 2023

ISSN: ['1930-0972', '0002-9890']

DOI: https://doi.org/10.1080/00029890.2023.2174352