Search arXiv⌕ Search

arXiv · 2503.10916

Kontsevich graphs act on Nambu--Poisson brackets, IV. When the invisible becomes crucial

Abstract

Kontsevich's graphs allow encoding multi-vectors whose coefficients are differential-polynomial in the coefficients of a given Poisson bracket on an affine real manifold. Encoding formulas by directed graphs adapts to the class of Nambu-determinant Poisson brackets, yet the graph topology becomes dimension-specific. To inspect whether a given Kontsevich graph cocycle $γ$ acts (non)trivially -- in the second Poisson cohomology -- on the space of Nambu brackets, taking a vector field solution $\smash{\vec{X}^γ_d}$ from dimension $d$ does not work in $d+1$. For $2 \leqslant d \leqslant 4$, the action of tetrahedron $γ_3$ on Nambu brackets is known to be a Poisson coboundary, $\dot{P} = [[ P,\smash{\vec{X}^{γ_3}_d} (P)]]$. We explore which minimal (sub)sets of graphs, encoding (non)vanishing objects over $\mathbb{R}^d_{\text{aff}}$, generate the topological data that suffice for a solution $\smash{\vec{X}^{γ_3}_{d+1}}$ to appear. We detect that there can be no solution in higher dimension without invisible graphs that vanish as formulas in $d=3$, but whose descendants do not all vanish over $d=4$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mollie S. Jagoe Brown, Arthemy V. Kiselev. 2025-09-30. Kontsevich graphs act on Nambu--Poisson brackets, IV. When the invisible becomes crucial. https://doi.org/10.1088/1742-6596%2F3152%2F1%2F012016

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗