Related papers: A Stringy Generalization of the Kontsevich Integra…
A graph in which every connected induced subgraph has a disconnected complement is called a cograph. Such graphs are precisely the graphs that do not have the 4-vertex path as an induced subgraph. We define a $2$-cograph to be a graph in…
Convexity is a notion that has been defined for subsets of $\RR^n$ and for subsets of general graphs. A convex cut of a graph $G=(V, E)$ is a $2$-partition $V_1 \dot{\cup} V_2=V$ such that both $V_1$ and $V_2$ are convex, \ie shortest paths…
A generalization of the topological fundamental group is developed in order to exhibit a topologically complete braid group containing Artin's braid group on infinitely many strands with respect to the following notion of convergence: A…
The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of…
We introduce the concept of degree to classify the periods in the sense of Kontsevich. Using this notion we give some new understanding of some problems in transcendental number theory.
Kontsevich's 1997 formula for the deformation quantization of Poisson brackets is a Feynman expansion involving volume integrals over moduli spaces of marked disks. We develop a systematic theory of integration on these moduli spaces via…
We introduce $3$-dimensional generalizations of Postnikov's plabic graphs and use them to establish cluster structures for type $A$ braid varieties. Our results include known cluster structures on open positroid varieties and double Bruhat…
String rewriting systems have proved very useful to study monoids. In good cases, they give finite presentations of monoids, allowing computations on those and their manipulation by a computer. Even better, when the presentation is…
We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…
We refine a Le and Murakami uniqueness theorem for the Kontsevich Integral in order to specify the relationship between the two (possibly equal) main universal link invariants: the Kontsevich Integral and the perturbative expression of the…
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…
We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…
Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…
We apply a recently developed method to exactly solve the $\Phi^3$ matrix model with covariance of a two-dimensional theory, also known as regularised Kontsevich model. Its correlation functions collectively describe graphs on a…
We study the graphs generated when the formula for linking Markov triples is applied to general triples of integers. We find there are a finite number of equivalence classes of graphs, each with particular properties.
The entropy of random graph ensembles has gained widespread attention in the field of graph theory and network science. We consider microcanonical ensembles of simple graphs with prescribed degree sequences. We demonstrate that the…
We establish some inequalities about the Khovanov-Rozansky cohomologies of braids. These give new upper bounds of the self-linking numbers of transversal links in standard contact $S^3$ which is sharper than the well known bound given by…
We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure.…
A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…