English
Related papers

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

200 papers

In this paper, we mainly investigate $K_{1,2}$-structure-connectivity for any connected graph. Let $G$ be a connected graph with $n$ vertices, we show that $\kappa(G; K_{1,2})$ is well-defined if $diam(G)\geq 4$, or $n\equiv 1\pmod 3$, or…

Combinatorics · Mathematics 2024-03-14 Xiao Zhao , Haojie Zheng , Hengzhe Li

We construct a natural chain map from the Kontsevich graph complex to the rational singular chain complex of $B\mathrm{Diff}_\partial(D^{2k})$ when the dimension $2k$ is sufficiently large, generalizing Goussarov and Habiro's theories of…

Geometric Topology · Mathematics 2026-01-14 Boris Botvinnik , Tadayuki Watanabe

A connected graph G is 3-flow-critical if G does not have a nowhere-zero 3-flow, but every proper contraction of G does. We prove that every n-vertex 3-flow-critical graph other than K_2 and K_4 has at least 5n/3 edges. This bound is tight…

Combinatorics · Mathematics 2024-04-02 Zdeněk Dvořák , Sergey Norin

Let $\mathcal{D}$ be a set of straight-line segments in the plane, potentially crossing, and let $c$ be a positive integer. We denote by $P$ the union of the endpoints of the straight-line segments of $\mathcal{D}$ and of the intersection…

Computational Geometry · Computer Science 2022-09-07 Jonas Cleve , Nicolas Grelier , Kristin Knorr , Maarten Löffler , Wolfgang Mulzer , Daniel Perz

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…

Computational Geometry · Computer Science 2014-05-12 Thomas Bläsius , Guido Brückner , Ignaz Rutter

Let $T$ be a graph in a compact, orientable 3--manifold $M$ and let $\Gamma$ be a subgraph. $T$ can be placed in bridge position with respect to a Heegaard surface $H$. We show that if $H$ is what we call $(T,\Gamma)$-c-weakly reducible in…

Geometric Topology · Mathematics 2014-03-17 Scott Taylor , Maggy Tomova

Identifying codes in graphs have been widely studied since their introduction by Karpovsky, Chakrabarty and Levitin in 1998. In particular, there are a lot of results regarding the binary hypercubes, that is, the Hamming graphs $K_2^n$. In…

Combinatorics · Mathematics 2018-05-07 Ville Junnila , Tero Laihonen , Tuomo Lehtilä

In 1981, Lubiw proved that the fixed point free automorphism problem (FPFAut) is NP-complete: given a graph G, determine whether there exists an automorphism that maps no vertex of G to itself. We revisit this problem and prove that FPFAut…

Discrete Mathematics · Computer Science 2026-03-30 Aida Abiad , Gabriel Coutinho , Emanuel Juliano , Vinicius F. dos Santos , Sjanne Zeijlemaker

Gauss diagram formulas are extensively used to study Vassiliev link invariants. Now we apply this approach to invariants of 3-manifolds, considering manifolds given by surgery on framed links in the 3-sphere. We study the lowest degree case…

Geometric Topology · Mathematics 2011-08-23 Sergei Matveev , Michael Polyak

We develop a new framework for noncommutative differential geometry based on double derivations. This leads to the notion of moment map and of Hamiltonian reduction in noncommutative symplectic geometry. For any smooth associative algebra…

Algebraic Geometry · Mathematics 2007-05-23 William Crawley-Boevey , Pavel Etingof , Victor Ginzburg

For a planar graph $H$, let $\operatorname{\mathbf{N}}_{\mathcal P}(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. In this paper, we prove that $\operatorname{\mathbf{N}}_{\mathcal P}(n,P_7)\sim{4\over…

Combinatorics · Mathematics 2022-04-20 Christopher Cox , Ryan R. Martin

Let $Z\subset\mathbb{C}^N$ be an $n$-pseudoconcave subset, for $1\leq n<N$, which is locally the graph of a continuous function over a closed subset of $\mathbb{C}^n\times\mathbb{R}$. We show that $Z$ can be realised as the disjoint union…

Complex Variables · Mathematics 2026-03-31 Filippo Valnegri

For two vertex disjoint graphs $H$ and $F$, we use $H\cup F$ to denote the graph with vertex set $V(H)\cup V(F)$ and edge set $E(H)\cup E(F)$, and use $H+F$ to denote the graph with vertex set $V(H)\cup V(F)$ and edge set $E(H)\cup…

Combinatorics · Mathematics 2023-08-21 Rui Li , Jinfeng Li , Di Wu

Coset methods are used to construct the action describing the dynamics associated with the spontaneous breaking of the Poincare symmetries of D dimensional space-time due to the embedding of a p-brane with codimension N=D-p-1. The resulting…

High Energy Physics - Theory · Physics 2008-11-26 T. E. Clark , S. T. Love , Muneto Nitta , T. ter Veldhuis , C. Xiong

In this paper, we define the quotinet graphs. In particular, we introduce the boundary quotient graphs, admissible boundary quotient graphs and subgraph boundary qoutient graphs. By the property of the quotient spaces, the boundary…

Combinatorics · Mathematics 2007-05-23 Ilwoo Cho

We derive analytic covariance matrices for the $N$-Point Correlation Functions (NPCFs) of galaxies in the Gaussian limit. Our results are given for arbitrary $N$ and projected onto the isotropic basis functions of Cahn & Slepian (2020),…

Cosmology and Nongalactic Astrophysics · Physics 2022-08-31 Jiamin Hou , Robert N. Cahn , Oliver H. E. Philcox , Zachary Slepian

We are motivated by a conjecture of A. and S. Katok to study the smooth cohomologies of a family of Weyl chamber flows. The conjecture is a natural generalization of the Livshitz Theorem to Anosov actions by higher-rank abelian groups; it…

Dynamical Systems · Mathematics 2013-07-12 Felipe A. Ramirez

We study graphs with nonnegative Bakry-\'Emery curvature or Ollivier curvature outside a finite subset. For such a graph, via introducing the discrete Gromov-Hausdorff convergence we prove that the space of bounded harmonic functions is…

Differential Geometry · Mathematics 2022-10-04 Bobo Hua , Florentin Münch

A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…

Geometric Topology · Mathematics 2015-03-20 Michael Brandenbursky

We explain the notion of a grope cobordism between two knots in a 3-manifold. Each grope cobordism has a type that can be described by a rooted unitrivalent tree. By filtering these trees in different ways, we show how the Goussarov-Habiro…

Geometric Topology · Mathematics 2010-08-25 Jim Conant , Peter Teichner
‹ Prev 1 4 5 6 7 8 10 Next ›