42 research outputs found
Laver's results and low-dimensional topology
In connection with his interest in selfdistributive algebra, Richard Laver
established two deep results with potential applications in low-dimensional
topology, namely the existence of what is now known as the Laver tables and the
well-foundedness of the standard ordering of positive braids. Here we present
these results and discuss the way they could be used in topological
applications
Virtual knot homology and concordance
We construct and investigate the properties of a new extension of Khovanov homology to virtual links, known as doubled Khovanov homology. We describe a perturbation of doubled Khovanov homology, analogous to Lee homology, and produce a doubled Rasmussen invariant; we use it obtain a number of results regarding virtual knot and link concordance. For instance, we demonstrate that the doubled Rasmussen invariant can obstruct the existance of a concordance between a virtual knot and a classical knot (i.e. a knot in the three-sphere ). Kawamura and independently Lobb defned easily-computable bounds on the Rasmussen invariant of classical knots; we generalise these bounds to both the doubled Rasmussen invariant and to a distinct concordance invariant known as the virtual Rasmussen invariant, due to Dye, Kaestner, and Kaufman. We use the new bounds to compute or estimate the slice genus of all virtual knots of 4 classical crossings or less. Finally, we use doubled Khovanov homology as a framework to construct a homology theory of links in thickened surfaces (objects closely related to, but distinct from, virtual links). This homology theory of links in thickened surfaces feeds back to the study of virtual knot concordance, as we are able to use it to investigate a refnement of the notion of sliceness of virtual knots
Graph Relations and Constrained Homomorphism Partial Orders
We consider constrained variants of graph homomorphisms such as embeddings,
monomorphisms, full homomorphisms, surjective homomorpshims, and locally
constrained homomorphisms. We also introduce a new variation on this theme
which derives from relations between graphs and is related to
multihomomorphisms. This gives a generalization of surjective homomorphisms and
naturally leads to notions of R-retractions, R-cores, and R-cocores of graphs.
Both R-cores and R-cocores of graphs are unique up to isomorphism and can be
computed in polynomial time.
The theory of the graph homomorphism order is well developed, and from it we
consider analogous notions defined for orders induced by constrained
homomorphisms. We identify corresponding cores, prove or disprove universality,
characterize gaps and dualities. We give a new and significantly easier proof
of the universality of the homomorphism order by showing that even the class of
oriented cycles is universal. We provide a systematic approach to simplify the
proofs of several earlier results in this area. We explore in greater detail
locally injective homomorphisms on connected graphs, characterize gaps and show
universality. We also prove that for every the homomorphism order on
the class of line graphs of graphs with maximum degree is universal
A hyperbolic 4-manifold with a perfect circle-valued Morse function
We exhibit a finite-volume cusped hyperbolic four-manifold with a perfect
circle-valued Morse function, that is a circle-valued Morse smooth function
with critical points, all of index 2. The map
is built by extending and smoothening a combinatorial Morse function defined by
Jankiewicz - Norin - Wise via Bestvina - Brady theory.
By elaborating on this construction we also prove the following facts:
There are infinitely many finite-volume hyperbolic 4-manifolds having a
handle decomposition with bounded numbers of 1- and 3-handles, so with bounded
Betti numbers and .
The kernel of determines a
geometrically infinite hyperbolic four-manifold obtained by
adding infinitely many 2-handles to a product , for some cusped
hyperbolic 3-manifold . The manifold is infinitesimally (and
hence locally) rigid.
There are type-preserving representations of the fundamental groups of and of the surface with genus 2 and one puncture in whose image is a discrete subgroup with limit set .
These representations are not faithful. We do not know if they are rigid.Comment: 50 pages, 22 figure
Entropy of random coverings and 4D quantum gravity
We discuss the counting of minimal geodesic ball coverings of -dimensional
riemannian manifolds of bounded geometry, fixed Euler characteristic and
Reidemeister torsion in a given representation of the fundamental group. This
counting bears relevance to the analysis of the continuum limit of discrete
models of quantum gravity. We establish the conditions under which the number
of coverings grows exponentially with the volume, thus allowing for the search
of a continuum limit of the corresponding discretized models. The resulting
entropy estimates depend on representations of the fundamental group of the
manifold through the corresponding Reidemeister torsion. We discuss the sum
over inequivalent representations both in the two-dimensional and in the
four-dimensional case. Explicit entropy functions as well as significant bounds
on the associated critical exponents are obtained in both cases.Comment: 54 pages, latex, no figure
Homomorphisms of (j,k)-mixed graphs
A mixed graph is a simple graph in which a subset of the edges have been assigned directions to form arcs. For non-negative integers j and k, a (j,k)−mixed graph is a mixed graph with j types of arcs and k types of edges. The collection of (j,k)−mixed graphs contains simple graphs ((0,1)−mixed graphs), oriented graphs ((1,0)−mixed graphs) and k−edge- coloured graphs ((0,k)−mixed graphs).A homomorphism is a vertex mapping from one (j,k)−mixed graph to another in which edge type is preserved, and arc type and direction are preserved. The (j,k)−chromatic number of a (j,k)−mixed graph is the least m such that an m−colouring exists. When (j,k)=(0,1), we see that these definitions are consistent with the usual definitions of graph homomorphism and graph colouring.In this thesis we study the (j,k)−chromatic number and related parameters for different families of graphs, focussing particularly on the (1,0)−chromatic number, more commonly called the oriented chromatic number, and the (0,k)−chromatic number.In addition to considering vertex colourings, we also consider incidence colourings of both graphs and digraphs. Using systems of distinct representatives, we provide a new characterisation of the incidence chromatic number. We define the oriented incidence chromatic number and find, by way of digraph homomorphism, a connection between the oriented incidence chromatic number and the chromatic number of the underlying graph. This connection motivates our study of the oriented incidence chromatic number of symmetric complete digraphs.Un graphe mixte est un graphe simple tel que un sous-ensemble des arêtes a une orientation. Pour entiers non négatifs j et k, un graphe mixte-(j,k) est un graphe mixte avec j types des arcs and k types des arêtes. La famille de graphes mixte-(j,k) contient graphes simple, (graphes mixte−(0,1)), graphes orienté (graphes mixte−(1,0)) and graphe coloré arête −k (graphes mixte−(0,k)).Un homomorphisme est un application sommet entre graphes mixte−(j,k) que tel les types des arêtes sont conservés et les types des arcs et leurs directions sont conservés. Le nombre chromatique−(j,k) d’un graphe mixte−(j,k) est le moins entier m tel qu’il existe un homomorphisme à une cible avec m sommets. Quand on observe le cas de (j,k) = (0,1), on peut déterminer ces définitions correspondent à les définitions usuel pour les graphes.Dans ce mémoire on etude le nombre chromatique−(j,k) et des paramètres similaires pour diverses familles des graphes. Aussi on etude les coloration incidence pour graphes and digraphs. On utilise systèmes de représentants distincts et donne une nouvelle caractérisation du nombre chromatique incidence. On define le nombre chromatique incidence orienté et trouves un connexion entre le nombre chromatique incidence orienté et le nombre chromatic du graphe sous-jacent
Homomorphism Reconfiguration via Homotopy
We consider the following problem for a fixed graph H: given a graph G and two H-colorings of G, i.e. homomorphisms from G to H, can one be transformed into the other by changing one color at a time, maintaining an H-coloring throughout.This is the same as finding a path in the Hom(G,H) complex. For H=K_k this is the problem of finding paths between k-colorings, which was recently shown to be in P for kleq 3 and PSPACE-complete otherwise (Bonsma and Cereceda 2009, Cereceda et al. 2011).
We generalize the positive side of this dichotomy by providing an algorithm that solves the problem in polynomial time for any H with no C_4 subgraph. This gives a large class of constraints for which finding solutions to the Constraint Satisfaction Problem is NP-complete, but paths in the solution space can be found in polynomial time.
The algorithm uses a characterization of possible reconfiguration sequences (that is, paths in Hom(G,H)), whose main part is a purely topological condition described in terms of the fundamental groupoid of H seen as a topological space