Related papers: Tutte Invariants for Alternating Dimaps
Associated to a Thurston map $f: S^2 \to S^2$ with postcritical set $P$ are several different invariants obtained via pullback: a relation on the set of free homotopy classes of curves in $S^2- P$, a linear operator on the free $\R$-module…
A common generalization for the chromatic polynomial and the flow polynomial of a graph $G$ is the Tutte polynomial $T(G;x,y)$. The combinatorial meaning for the coefficients of $T$ was discovered by Tutte at the beginning of its…
A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely, their higher-dimensional analogues) naturally appear in…
The Tutte polynomial is a powerfull analytic tool to study the structure of planar graphs. In this paper, we establish some relations between the number of clusters per bond for planar graph and its dual : these relations bring into play…
We consider tilings of Euclidean spaces by polygons or polyhedra, in particular, tilings made by a substitution process, such as the Penrose tilings of the plane. We define an isomorphism invariant related to a subgroup of rotations and…
A cycle $C$ in a graph $G$ is called a Tutte cycle if, after deleting $C$ from $G$, each component has at most three neighbors on $C$. Tutte cycles play an important role in the study of Hamiltonicity of planar graphs. Thomas and Yu and…
The trace anomaly and anomaly-induced action are evaluated for the two-dimensional $2D$ vector theory with classical conformal symmetry. Implementing local conformal symmetry while preserving the gauge invariance requires either giving up…
A slice-torus invariant is an $\mathbb{R}$-valued homomorphism on the knot concordance group whose value gives a lower bound for the 4-genus such that the equality holds for any positive torus knot. Such invariants have been discovered in…
An edge-ordered graph is a graph with a total ordering of its edges. A path $P=v_1v_2\ldots v_k$ in an edge-ordered graph is called increasing if $(v_iv_{i+1}) > (v_{i+1}v_{i+2})$ for all $i = 1,\ldots,k-2$; it is called decreasing if…
Graph invariants are a useful tool in graph theory. Not only do they encode useful information about the graphs to which they are associated, but complete invariants can be used to distinguish between non-isomorphic graphs. Polynomial…
We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edges, which generalize the notions of colorings and flows over a graph. We show that the corresponding arithmetic chromatic polynomial and…
For any arbitrary algebraic curve, we define an infinite sequence of invariants. We study their properties, in particular their variation under a variation of the curve, and their modular properties. We also study their limits when the…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
We propose AD3, a new algorithm for approximate maximum a posteriori (MAP) inference on factor graphs based on the alternating directions method of multipliers. Like dual decomposition algorithms, AD3 uses worker nodes to iteratively solve…
We prove some variants of the exponential formula and apply them to the multivariate Tutte polynomials (also known as Potts-model partition functions) of graphs. We also prove some further identities for the multivariate Tutte polynomial,…
For almost all interval exchange maps T_0, with combinatorics of genus g>=2, we construct affine interval exchange maps T which are semi-conjugate to T_0 and have a wandering interval.
For an adjoint action of a Lie group G (or its subgroup) on Lie algebra Lie(G) we suggest a method for construction of invariants. The method is easy in implementation and may shed the light on algebraical independence of invariants. The…
An algorithm is described for the construction of actions for scalar, spinor, and vector gauge fields that remains well-defined when the metric is degenerate and that involve no contravariant tensor fields. These actions produce the…
Let $M$ be a Riemannian manifold, $\tau: G \times M \to M$ an isometric action on $M$ of an $n$-torus $G$ and $V: M \to \mathbb R$ a bounded $G$-invariant smooth function. By $G$-invariance the Schr\"odinger operator, $P=-\hbar^2…
The magnitude of a graph is one of a family of cardinality-like invariants extending across mathematics; it is a cousin to Euler characteristic and geometric measure. Among its cardinality-like properties are multiplicativity with respect…