English
Related papers

Related papers: A Stringy Generalization of the Kontsevich Integra…

200 papers

Let $R$ be a finite product of integral domains and $D$ be a union of prime ideals (it is possible that $R$ is just an integral domain). Let $n \geq 1$ be a positive integer. This paper introduces the $n$-total graph of a $(R, D)$. The…

Commutative Algebra · Mathematics 2026-01-19 Myriam AbiHabib , Ayman Badawi

Ribbon concordance gives a partial order on knot types, and applying a knot homology functor to a ribbon concordance gives an inclusion of the homologies. The question of the existence of global ribbon minima in each concordance class is a…

Geometric Topology · Mathematics 2026-02-16 Andrew Lobb

We explain new developments in classical knot theory in 3 and 4~dimensions, i.e. we study knots in 3-space, up to isotopy as well as up to concordance. In dimension~3 we give a geometric interpretation of the Kontsevich integral (joint with…

Geometric Topology · Mathematics 2007-05-23 Peter Teichner

Let M be a bounded domain of a Euclidian space with smooth boundary. We relate the Cheeger constant of M and the conductance of a neighborhood graph defined on a random sample from M. By restricting the minimization defining the latter over…

Statistics Theory · Mathematics 2013-03-05 Ery Arias-Castro , Bruno Pelletier , Pierre Pudlo

The $n$-loop Kontsevich invariant of knots takes its value in the completion of the space of $n$-loop open Jacobi diagrams, which is an infinite dimensional vector space. Since the 1-loop part is presented by the Alexander polynomial, we…

Geometric Topology · Mathematics 2024-10-29 Kouki Yamaguchi

Oriented ribbon graphs (dessins d'enfant) are graphs embedded in oriented surfaces. A quasi-tree of a ribbon graph is a spanning subgraph with one face, which is described by an ordered chord diagram. We show that for any link diagram $L$,…

Geometric Topology · Mathematics 2016-01-20 Abhijit Champanerkar , Ilya Kofman , Neal Stoltzfus

We extend the Cauchy residue theorem to a large class of domains including differential chains that represent, via canonical embedding into a space of currents, divergence free vector fields and non-Lipschitz curves. That is, while the…

Complex Variables · Mathematics 2011-07-26 Jenny Harrison , Harrison Pugh

Zaslavsky (1991) introduced a graphical structure called a biased graph and used it to characterize all single-element coextensions and elementary lifts of graphic matroids. We introduce a new, dual graphical structure that we call a…

Combinatorics · Mathematics 2024-02-01 Daniel Slilaty , Thomas Zaslavsky

In the usual procedure for toroidal Kaluza-Klein reduction, all the higher-dimensional fields are taken to be independent of the coordinates on the internal space. It has recently been observed that a generalisation of this procedure is…

High Energy Physics - Theory · Physics 2009-10-07 I. V. Lavrinenko , H. Lu , C. N. Pope

The boxicity of a graph is the smallest dimension $d$ allowing a representation of it as the intersection graph of a set of $d$-dimensional axis-parallel boxes. We present a simple general approach to determining the boxicity of a graph…

Combinatorics · Mathematics 2025-01-10 Marco Caoduro , András Sebő

In this paper, a way of generalizing the tensor renormalization group(TRG) is proposed. Mathematically, the connection between patterns of tensor renormalization group and the concept of truncation sequence in polytope geometry is…

Statistical Mechanics · Physics 2017-06-12 Peiyuan Teng

Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley

We give a generalization of the Reshetikhin-Turaev functor for tangles to get a combinatorial formula for the universal Vassiliev-Kontsevich invariant of framed oriented links which is coincident with the Kontsevich integral. The universal…

High Energy Physics - Theory · Physics 2008-02-03 Le Tu Quoc Thang , Jun Murakami

Vassiliev's knot invariants can be computed in different ways but many of them as Kontsevich integral are very difficult. We consider more visual diagram formulas of the type Polyak-Viro and give new diagram formula for the two basic…

Algebraic Topology · Mathematics 2007-05-23 Svetlana D. Tyurina

Using the orbicell decomposition of the Deligne-Mumford compactification of the moduli space of Riemann surfaces studied previously, a chain complex based on semistable ribbon graphs is constructed which is an extension of Konsevich's graph…

Algebraic Topology · Mathematics 2016-10-25 Javier Zúñiga

We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…

Discrete Mathematics · Computer Science 2023-03-14 Paul Bastide , Linda Cook , Jeff Erickson , Carla Groenland , Marc van Kreveld , Isja Mannens , Jordi L. Vermeulen

Effective periods were defined by Kontsevich and Zagier as complex numbers whose real and imaginary parts are values of absolutely convergent integrals of $\mathbb{Q}$-rational functions over $\mathbb{Q}$-semi-algebraic domains in…

Number Theory · Mathematics 2022-04-15 Jacky Cresson , Juan Viu-Sos

A `total Chern class' invariant of knots is defined. This is a universal Vassiliev invariant which is integral `on the level of Lie algebras' but it is not expressible as an integer sum of diagrams. The construction is motivated by…

Geometric Topology · Mathematics 2014-10-01 Simon Willerton

In this short note, we give a very simple but useful generalization of a result of Vershynin (Theorem 5.39 of [1]) for a random matrix with independent sub-Gaussian rows. We also explain with an example where our generalization is useful.

Probability · Mathematics 2016-12-02 Namrata Vaswani , Seyedehsara Nayer

A graph that is completely determined by its degree sequence is called a unigraph. In 2000, Regina Tyshkevich published one of the most important papers on unigraphs. There are two parts to the paper: a decomposition theorem that describes…

Combinatorics · Mathematics 2026-01-06 Christine T. Cheng , Chelsea Ann Lambert