The paper offers new ways to solve map coloring problems.
problem Coloring plane maps with four colors.
method Alternate formulations including a tautological expansion and an extended Penrose Bracket.
result Extended Penrose Bracket counts colorings of arbitrary cubic graphs.
Quantum representations of mapping class groups are always irreducible for surfaces with colored banded points.
problem Irreducibility of quantum representations of mapping class groups with boundary.
method Proving irreducibility of Witten--Reshetikhin--Turaev SU(2) quantum representations for surfaces with colored banded points.
result Irreducibility of quantum representations is proven for surfaces with at least one colored banded point.
Given a set equipped with a transitive action of a group, we define the notion of an almost invariant coloring of the set. We consider the mapping class group orbit of a multicurve on a compact surface, and prove that in the case of genus at least two, no such almost invariant coloring exists. Conversely, in the case o…
Holonomy maps on colored complexes link manifold topology to group theory.
problem Linking manifold topology with group theory.
method Investigates k-multilayer complexes and their holonomy maps. result Holonomy classes of complexes can represent topological problems.
New deformation of link homology for colored diagrams.
problem Understanding colored Khovanov-Rozansky homology.
method Introducing a multi-parameter deformation and extending to braids.
result Link splitting properties and invariants of colored Hopf links.
The ability to characterize the color content of natural imagery is an important application of image processing. The pixel by pixel coloring of images may be viewed naturally as points in color space, and the inherent structure and distribution of these points affords a quantization, through clustering, of the color i…
Minimal simplicial maps constructed for spheres and manifolds.
problem Constructing minimal simplicial maps of specific degrees.
method Triangulations and degree constructions for manifolds and spheres.
result Minimal triangulations for degree d self-maps of Sn−1imesS1. New colored knot Floer homology defined using infinite full twists.
problem Defining a new homology theory for knots.
method Defining colored knot Floer homology through colimit of link Floer homology with infinite full twists.
result Colored knot Floer homology is a module over the colored knot Floer homology of the unknot.
Infinite group knot coloring polynomial generalizes quandle 2-cocycle invariant.
problem Generalizing knot invariants to infinite groups.
method Longitudinal mapping invariant based on meridian-longitude pair in knot group.
result Invariant values for specific knots and groups.
The paper generalizes Sperner's lemma to higher dimensions and calculates a new invariant.
problem Generalizing Sperner's lemma to higher dimensions and quantifying its outcomes.
method Using triangulations of (m+1)-discs and simplicial mappings, the authors define a new invariant and prove a theorem about fully colored simplices. result The number of fully colored simplices is not less than the new invariant μ([f]).
Taking the signature of the closure of a braid defines a map from the braid group to the integers. In 2005, Gambaudo and Ghys expressed the homomorphism defect of this map in terms of the Meyer cocycle and the Burau representation. In the present paper, we simultaneously extend this result in two directions, considerin…
Unified ADO and colored Jones polynomials for knots.
problem Determining ADO polynomials from colored Jones polynomials.
method Constructing a two-variable knot invariant using completions of rings and algebra.
result Unified invariant maps colored Jones polynomials to ADO polynomials.
Finite image of mapping class group representations proved using graph embeddings.
problem Finiteness of images of mapping class group representations in twisted Dijkgraaf-Witten theory.
method Translation of problem into graph manipulation, using TVBW representations and spherical fusion categories.
result Finiteness of images of mapping class group representations in twisted Dijkgraaf-Witten theory is proven.
The pair (K,r) consisting of a knot K and a surjective map r from the knot group onto a dihedral group is said to be a p-colored knot. D. Moskovich conjectured that for any odd prime p there are exactly p equivalence classes of p-colored knots up to surgery along unknots in the kernel of the coloring. We show that ther…
Extends link colorings to modules over Laurent polynomial rings, showing isomorphisms and dimensions.
problem Extending link colorings to modules over Laurent polynomial rings.
method Using Alexander quandles and modules over Laurent polynomial rings, showing isomorphisms and dimensions.
result Dimension of colorings as vector spaces over fields is determined by ring homomorphisms.
Researchers lift knot coloring polynomial to Habiro ring.
problem Lifting colored Jones polynomial of knots to Habiro ring.
method Introduced new Habiro ring and map, used Alexander polynomial.
result Existence of loop expansion at roots of unity confirmed.
This paper connects virtual biquandles to biquandles for virtual link colorings.
problem Extending invariants from biquandles to virtual biquandles.
method Establishing equivalence between two representations of virtual braid groups and introducing new labeling rules.
result The number of colorings of a virtual link by virtual biquandles can be recovered from colorings by biquandles.
In this article we give an explicit description of the representation matrix of a Heisenberg type action constructed by Blanchet, Habegger, Masbaum and Vogel. We give the matrix in terms of a ribbon graph and its admissible colorings. We show that components of the representation matrix satisfies the {\it external edge…
Proposes m-POT to improve m-OT's misspecified mappings issue.
problem Misspecified mappings in mini-batch optimal transport.
method Partial optimal transport (POT) between mini-batch empirical measures.
result m-POT alleviates incorrect mappings compared to current methods.
Unified solution to Goodman-Pollack transversal problem using matroids and topology.
problem Existence of an affine k-dimensional transversal to convex sets.
method Matroidal joins and topological methods.
result Unified solution including colorful Helly theorem and Holmsen's theorem.
Minimal coloring number found for Z-colorable links.
problem Finding the minimum number of colors needed for Z-colorings of Z-colorable links.
method Defined Z-coloring as a generalization of Fox coloring for links with zero determinants. Provided sufficient conditions for non-splittable Z-colorable links to have the least minimal coloring number.
result Sufficient conditions for non-splittable Z-colorable links to have the least minimal coloring number.
The paper explores minimal coloring numbers for Z-colorable links.
problem Finding the minimum number of colors needed for Z-colorings on minimal diagrams of Z-colorable links. method Investigates minimal diagrams and Z-colorings for Z-colorable links. result For any positive integer N, there exists a minimal diagram of a Z-colorable link with at least N colors in any Z-coloring. The paper shows links can be colored with fewer colors than previously thought.
problem Coloring links using the symmetric group of degree three.
method Analyzing the number of colors for link colorings by S3. result 2-bridge links with 5 colors can be colored with only 4 colors.
Study finds minimal coloring numbers for torus links using rack colorings.
problem Determining the minimal number of colors for torus link diagrams.
method Using rack colorings on link diagrams to classify minimal colorings.
result Complete classifications of Z-colorings by four colors. Study on knots using 17 colors, finding specific color assignments.
problem Understanding the minimum number of colors needed for Fox colorings of knots.
method Investigated 17-colorable knots and their diagrams.
result Found that exactly 6 out of 17 colors are used in diagrams of 17-colorable knots.
Stable cubulations and bicombings in mapping class groups and Teichmüller spaces.
problem Understanding geometric structures in mapping class groups and Teichmüller spaces.
method Proving stably approximated by CAT(0) cube complexes, applying to broader colorable hierarchically hyperbolic spaces and groups.
result Stable cubulations and bicombings in mapping class groups and Teichmüller spaces, with stable coarse barycenters.
Aicardi's invariant F(L) is extended to colored singular links using graphical calculus.
problem Constructing an invariant for colored classical and singular links.
method State-sum model using graphical calculus for oriented, colored, 4-valent planar graphs.
result Extends F(L) to colored singular links, showing it's stronger than HOMFLY-PT polynomial. This paper proves the minimal coloring number for a specific type of link is exactly 4.
problem Determining the minimal coloring number for a specific type of link.
method Investigated Z-colorable links and used their properties to prove the minimal coloring number is 4. result The minimal coloring number of any non-splittable Z-colorable link is exactly 4. The paper finds minimum Dehn colors for knots and defines useful graphs for coloring.
problem Finding the minimum number of colors for Dehn colorings of knots.
method Analyzes Dehn colorings for knots and defines R-palette graphs. result For Dehn p-colorable knots, the minimum number of colors is at least ⌊log2pfloor+2. Dihedral linking invariant uses knot colorings to distinguish knots.
problem Distinguishing knots using knot colorings and linking numbers.
method Algorithm for computing linking numbers in dihedral branched covers.
result The dihedral linking invariant distinguishes more than 98% of prime knot pairs.
Algorithm finds minimal colorings of tree structures.
problem Finding minimal unbounded factor complexity colorings of trees.
method Induction algorithm using colored balls.
result Characterization of Sturmian colorings.
This paper shows the minimal coloring number for certain Z-colorable links is four.
problem Determining the minimal number of colors for Z-colorings of links. method Analyzing diagrams of Z-colorable links and constructing specific diagrams to find the minimal coloring number. result The minimal coloring number for non-splittable Z-colorable links is four. Generalizes tangle Floer homology to A-tangles with A-colorings.
problem Extending tangle Floer homology to include A-colorings and cobordisms.
method Defined A-tangles, A-cobordisms, and tangle Floer homology functors for A-modules.
result Constructs tangle Floer homology for A-tangles and shows functoriality.
Extends Borsuk-Ulam theorem with applications in sphere coverings and colorings.
problem Complexity bounds and structural insights for triangulated sphere mappings.
method Combinatorial labeling and order type analysis of finite point sets.
result New topological Hall theorem and generalizations of hypergraph Hall theorems.
We prove that any 11-colorable knot is presented by an 11-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially 11-colored diagrams of the knot. We also prove a similar result for any 11-colorable ribbon 2-knot.
A bug's perspective on polyhedral surfaces using exponential maps.
problem Understanding visual effects on polyhedral surfaces from a bug's viewpoint.
method Computed the exponential map of a polyhedron by cutting and rotating faces into the tangent plane of the bug.
result Visual effects like lensing and cloaking can be explained using the exponential map.
Asymptotically CAT(0) metrics and Z-structures for HHGs, proving Farrell-Jones Conjecture.
problem Proving Farrell-Jones Conjecture for HHGs.
method Asymptotically CAT(0) metrics and Z-structures construction.
result Many HHGs satisfy Farrell-Jones Conjecture.
This survey article discusses three aspects of knot colorings. Fox colorings are assignments of labels to arcs, Dehn colorings are assignments of labels to regions, and Alexander-Briggs colorings assign labels to vertices. The labels are found among the integers modulo n. The choice of n depends upon the knot. Each typ…
The study characterizes torus links' coloring quivers using dihedral quandles.
problem Characterizing the structure of coloring quivers for torus links.
method Exhaustively determining all possible numbers of colorings and their interconnections.
result The quiver structure varies based on the number of colorings.
The paper discusses colorings and doubled colorings of virtual doodles.
problem Coloring virtual doodles using a new algebraic structure.
method Introduced a new algebra called a doodle switch and defined an invariant for virtual doodles.
result Introduced doubled colorings and defined an invariant for virtual doodles.
For each odd prime p, and for each non-split link admitting non-trivial p-colorings, we prove that the maximum number of Fox colors is p. We also prove that we can assemble a non-trivial p-coloring with any number of colors, from the minimum to the maximum number of colors. Furthermore, for any rational link, we prove …
The paper defines a new homotopy type for colored links and proves stabilization behavior.
problem Understanding the behavior of Khovanov homotopy types for colored links.
method Definition of a Khovanov homotopy type for colored links and quantum spin networks, and derivation of its properties.
result Stabilization of the homotopy types for n-colored B-adequate links as nightarrow∞. Paper describes a state sum formula for a graph coloring polynomial.
problem Counting n-face colorings of ribbon graphs for various n. method Combines topological quantum field theory and diagrammatic tensors.
result Describes a state sum formula for the total face color polynomial.
The paper discusses knot colorings and their invariants using Goeritz matrices.
problem Distinguishing knots using coloring methods.
method Elementary approach to equivalence between coloring and Goeritz matrices.
result Computing knot determinant and nullity of pretzel knots.
For any link and for any modulus m we introduce an equivalence relation on the set of non-trivial m-colorings of the link (an m-coloring has values in Z/mZ). Given a diagram of the link, the equivalence class of a non-trivial m-coloring is formed by each assignment of colors to the arcs of the diagram that is obtaine…
Introduced coloring-allowed invariants of planar knotoids with the coloring number.
problem Construction of polynomial invariants of knotoids with signs of crossings.
method Defined coloring-allowed invariants of planar knotoids with the coloring number.
result Discussed the 4-phases functions of coloring-allowed invariants.
New bicombings found for mapping class groups and Teichmüller spaces.
problem Finding efficient ways to navigate mapping class groups and Teichmüller spaces.
method Explained bicombings via stable cubical intervals in hierarchically hyperbolic spaces.
result Hierarchical hulls are quasi-isometric to finite CAT(0) cube complexes.
Study of quandle coloring quivers with dihedral quandles.
problem Link invariants and their enhancements using quandles.
method Introduced shadow quandle coloring quivers and cocycle quivers, studied equivalence with quandle coloring numbers and shadow quandle cocycle invariants.
result Equivalence of quandle coloring quivers with quandle coloring numbers and shadow quandle cocycle quivers with shadow quandle cocycle invariants for specific dihedral quandles.