English
Related papers

Related papers: Kontsevich graphs act on Nambu--Poisson brackets, …

200 papers

A finite simple graph $\Gamma$ determines a quotient $P_\Gamma$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior…

Geometric Topology · Mathematics 2021-09-10 Daniel C Cohen , Michael J Falk

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ő

A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…

Computational Geometry · Computer Science 2016-10-25 Radoslav Fulek

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

Combinatorics · Mathematics 2012-12-27 Tyler Friesen , Vassily Manturov

The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…

Probability · Mathematics 2026-04-01 Matthias Lienau

We obtain an operator algebraic characterization of the noncommutative Furstenberg-Poisson boundary $\operatorname{L}(\Gamma) \subset \operatorname{L}(\Gamma \curvearrowright B)$ associated with an admissible probability measure $\mu \in…

Operator Algebras · Mathematics 2025-07-17 Cyril Houdayer

In this paper, we study surfaces embedded in $4$-manifolds. We give a complete set of moves relating banded unlink diagrams of isotopic surfaces in an arbitrary $4$-manifold. This extends work of Swenton and Kearton-Kurlin in $S^4$. As an…

Geometric Topology · Mathematics 2020-10-07 Mark C. Hughes , Seungwon Kim , Maggie Miller

Let p be a regular prime number, let Gp denote the Galois group of the maximal unramified away from p extension of Q, and let H_et denote the Heisenberg group over Qp with Gp-action given by H_et = Qp(1)^2 \oplus Qp(2). Although Soul\'e…

Number Theory · Mathematics 2014-03-20 Ishai Dan-Cohen , Stefan Wewers

We study families of diffeomorphisms detected by trivalent graphs via the Kontsevich classes. We specify some recent results and constructions of the second named author to show that those non-trivial elements in homotopy groups…

Geometric Topology · Mathematics 2023-01-19 Boris Botvinnik , Tadayuki Watanabe

A $K_4$-decomposition of a graph is a partition of its edges into $K_4$s. A fractional $K_4$-decomposition is an assignment of a nonnegative weight to each $K_4$ in a graph such that the sum of the weights of the $K_4$s containing any given…

Combinatorics · Mathematics 2025-10-10 Menglong Zhang , Gennian Ge

We obtain constraints on the topology of families of smooth $4$-manifolds arising from a finite dimensional approximation of the families Seiberg-Witten monopole map. Amongst other results these constraints include a families generalisation…

Differential Geometry · Mathematics 2021-03-10 David Baraglia

We first prove that for every vertex x of a 4-connected graph G there exists a subgraph H in G isomorphic to a subdivision of the complete graph K4 on four vertices such that G-V(H) is connected and contains x. This implies an affirmative…

Combinatorics · Mathematics 2011-01-28 Matthias Kriesell

Let v(G) and dom(G) denote the number of vertices and the domination number of a graph G, and let r (G) = dom(G)/v(G)$. Let [x] and ]x[ be the floor and the ceiling of a number x. In 1996 B. Reed conjectured that if G is a cubic graph, then…

Combinatorics · Mathematics 2007-05-23 Alexander Kelmans

M. Carr and S. Devadoss introduced in [7] the notion of tubing on a finite simple graph $\Gamma$, in the context of configuration spaces on the Hilbert plane. To any finite simple graph $\Gamma$ they associated a finite partially ordered…

Rings and Algebras · Mathematics 2019-10-03 Stefan Forcey , María Ronco

We compute the Kontsevich graph cohomology in loop order 11, and for some degrees in higher loop order. We apply our results to discuss a conjecture of F. Brown, providing a counterexample to a strong version of the conjecture.

Quantum Algebra · Mathematics 2025-08-20 Thomas Willwacher

The aim of the paper is to address the behavior in large population of diffusions interacting on a random, possibly diluted and inhomogeneous graph. This is the natural continuation of a previous work, where the homogeneous Erd\H os-R\'enyi…

Probability · Mathematics 2019-04-01 Eric Luçon

We study actions of discrete subgroups $\Gamma$ of semi-simple Lie groups $G$ on associated oriented flag manifolds. These are quotients $G/P$, where the subgroup $P$ lies between a parabolic subgroup and its identity component. For Anosov…

Differential Geometry · Mathematics 2018-06-13 Florian Stecker , Nicolaus Treib

The first part of the paper explains how to encode a one-cocycle and a two-cocycle on a group $G$ with values in its representation by networks of planar trivalent graphs with edges labelled by elements of $G$, elements of the…

K-Theory and Homology · Mathematics 2024-10-10 Mee Seong Im , Mikhail Khovanov

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

The fourth listed author and Hans Parshall (\cite{IosevichParshall}) proved that if $E \subset {\mathbb F}_q^d$, $d \ge 2$, and $G$ is a connected graph on $k+1$ vertices such that the largest degree of any vertex is $m$, then if $|E| \ge C…

Combinatorics · Mathematics 2023-08-21 Paige Bright , Xinyu Fang , Barrett Heritage , Alex Iosevich , Maxwell Sun