English
Related papers

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

200 papers

In this paper we study associative algebras with a Poisson algebra structure on the center acting by derivations on the rest of the algebra. These structures, which we call Poisson fibred algebras, appear in the study of quantum groups at…

q-alg · Mathematics 2008-02-03 Nicolai Reshetikhin , Alexander A. Voronov , Alan Weinstein

In this article, we construct countably many mutually non-isotopic diffeomorphisms of some closed non simply-connected 4-manifolds that are homotopic to but not isotopic to the identity, by surgery along $\Theta$-graphs. As corollaries of…

Geometric Topology · Mathematics 2023-02-24 Tadayuki Watanabe

It is shown that the new Poisson brackets proposed in Part I of this work (J. Math. Phys. 34, 5747(hep-th/9305133)) arise naturally in an extension of the formal variational calculus incorporating divergences. The linear spaces of local…

q-alg · Mathematics 2008-02-03 Vladimir O. Soloviev

We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time…

Computational Complexity · Computer Science 2015-09-25 Bart M. P. Jansen , Astrid Pieterse

Given an oriented surface S with base point * on the boundary, we introduce for all N>0, a canonical quasi-Poisson bracket on the space of N-dimensional linear representations of \pi_1(S,*). Our bracket extends the well-known Poisson…

Geometric Topology · Mathematics 2014-01-03 Gwenael Massuyeau , Vladimir Turaev

Let $G$ be a nonabelian, simple group with a nontrivial conjugacy class $C \subseteq G$. Let $K$ be a diagram of an oriented knot in $S^3$, thought of as computational input. We show that for each such $G$ and $C$, the problem of counting…

Geometric Topology · Mathematics 2021-08-18 Greg Kuperberg , Eric Samperton

Bott and Taubes used integrals over configuration spaces to produce finite-type a.k.a. Vassiliev knot invariants. Cattaneo, Cotta-Ramusino and Longoni then used these methods together with graph cohomology to construct "Vassiliev classes"…

Geometric Topology · Mathematics 2021-06-23 Robin Koytcheff

Kuratowski proved that a finite graph embeds in the plane if it does not contain a subdivision of either K_5 or K_{3,3}, called Kuratowski subgraphs. A conjectured generalization of this result to all nonorientable surfaces says that a…

Combinatorics · Mathematics 2008-08-05 Suhkjin Hur

This text gives some results about quantum torsors. Our starting point is an old reformulation of torsors recalled recently by Kontsevich. We propose an unification of the definitions of torsors in algebraic geometry and in Poisson…

Quantum Algebra · Mathematics 2007-05-23 Cyril Grunspan

A $k$-additive spanner of a graph is a subgraph that preserves the distance between any two nodes up to a total additive error of $+k$. Efficient algorithms have been devised for constructing 2 [Aingworth et al. SIAM '99], 6 [Baswana et al.…

Data Structures and Algorithms · Computer Science 2021-09-21 Bandar Al-Dhalaan

The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…

Discrete Mathematics · Computer Science 2007-05-23 Joel Friedman , Jean-Pierre Tillich

We prove that the Kontsevich tetrahedral flow $\dot{\mathcal{P}} = \mathcal{Q}_{a:b} (\mathcal{P})$, the right-hand side of which is a linear combination of two differential monomials of degree four in a bi-vector $\mathcal{P}$ on an affine…

Quantum Algebra · Mathematics 2017-06-06 Anass Bouisaghouane , Ricardo Buring , Arthemy V. Kiselev

We give a new proof that the Poisson boundary of a planar graph coincides with the boundary of its square tiling and with the boundary of its circle packing, originally proven by Georgakopoulos and Angel, Barlow, Gurel-Gurevich and Nachmias…

Probability · Mathematics 2018-05-01 Tom Hutchcroft , Yuval Peres

Let v(G) and p(G) be the number of vertices and the maximum number of disjoint 3-vertex paths in G, respectively. We discuss the following old Problem: Is the following claim (P) true ? (P) if G is a 3-connected and cubic graph, then p(G) =…

Combinatorics · Mathematics 2008-01-09 Alexander Kelmans

Recently, the authors gave Ramsey-type results for the path cover/partition number of graphs. In this paper, we continue the research about them focusing on digraphs, and find a relationship between the path cover/partition number and…

Combinatorics · Mathematics 2021-11-30 Shuya Chiba , Michitaka Furuya

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…

Combinatorics · Mathematics 2025-09-30 Sean Dewar , Georg Grasegger , Eleftherios Kastis , Anthony Nixon

Given $n$ distinct points $\mathbf{x}_1, \ldots, \mathbf{x}_n$ in $\mathbb{R}^d$, let $K$ denote their convex hull, which we assume to be $d$-dimensional, and $B = \partial K $ its $(d-1)$-dimensional boundary. We construct an explicit…

Metric Geometry · Mathematics 2021-07-01 Joseph Malkoun , Peter J. Olver

For the Kirillov-Poisson structure on the vector space $\g^*$, where $\g$ is a finite-dimensional Lie algebra, it is known at least two canonical deformations quantization of this structure: they are the M. Kontsevich universal formula [K],…

Quantum Algebra · Mathematics 2007-05-23 Boris Shoikhet

Gaussian processes (GPs) are widely-used tools in spatial statistics and machine learning and the formulae for the mean function and covariance kernel of a GP $T u$ that is the image of another GP $u$ under a linear transformation $T$…

Probability · Mathematics 2024-10-08 Tadashi Matsumoto , T. J. Sullivan

We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the structure of finite and infinite directed graphs with respect…

Combinatorics · Mathematics 2023-05-17 Nathan Bowler , Florian Gut , Meike Hatzel , Ken-ichi Kawarabayashi , Irene Muzi , Florian Reich
‹ Prev 1 3 4 5 6 7 10 Next ›